TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

New general-purpose optimization algorithm promises order-of-magnitude speedups

126 pointsby _piusover 9 years ago

6 comments

mlubinover 9 years ago
Very impressive work, here&#x27;s the arxiv link: <a href="http:&#x2F;&#x2F;arxiv.org&#x2F;abs&#x2F;1508.04874" rel="nofollow">http:&#x2F;&#x2F;arxiv.org&#x2F;abs&#x2F;1508.04874</a>
评论 #10442177 未加载
zzleeperover 9 years ago
In an interesting coincidence, I have another of their papers in my hand, and it&#x27;s equally as impressive (I&#x27;m using it to improve a related solver in econometrics).<p>One problem though is that the constant terms of these models make take a while to go down (i.e. don&#x27;t expect to see this in production anywhere for at least 5yrs), but it&#x27;s still great to see progress there.
评论 #10442160 未加载
JoachimSover 9 years ago
A very cool paper, esp how they are able to improve other algorithms. Each of those could have been a paper by themselves.
SixSigmaover 9 years ago
Wow, that is great news. solving optimisation problems is one of the true benefits of IT that few people know about. From warehousing to routing we use it every day in logistics and supply chain.<p>It is gradually moving out in finance and accounting from the big guys.
santaclausover 9 years ago
Are there implementations available, yet?
评论 #10442046 未加载
taneqover 9 years ago
Did anyone else think it was strange, in an article about runtime efficiency, for them to say that problem-specific optimisations promise speedups of &quot;several orders of magnitude&quot;? Because, well, that doesn&#x27;t change the order of the algorithm...
评论 #10443641 未加载