Deepmind Alphadev: Faster sorting algorithms discovered using deep RL
1–10 of 328 posts
Re: Deepmind Alphadev: Faster sorting algorithms discovered using deep RL
#2LLVM merge: https://reviews.llvm.org/D118029
Benchmark: https://bit.ly/3AtesYf
Benchmark seems to be in the range of a 1-5% improvement for 80% of sizes.
Re: Deepmind Alphadev: Faster sorting algorithms discovered using deep RL
#3"AlphaDev uncovered new sorting algorithms that led to improvements in the LLVM libc++ sorting library that were up to 70% faster for shorter sequences and about 1.7% faster for sequences exceeding 250,000 elements."
Re: Deepmind Alphadev: Faster sorting algorithms discovered using deep RL
#4Broken link. Ok it's there now, maybe a Nature snafu.
News Release:
https://www.deepmind.com/blog/alphadev-discovers-faster-sort...
Re: Deepmind Alphadev: Faster sorting algorithms discovered using deep RL
#5The most interesting part of this paper to me is that they let the agent guess how efficient it’s own solutions were and only had the model experimentally verify it’s guesses in 0.002% of cases. This allowed the model to search much faster than another program that didn’t guess and had to run every program.
Re: Deepmind Alphadev: Faster sorting algorithms discovered using deep RL
#6Does anyone have high level guidance on when (deep) RL is worth pursuing for optimization (e.g. optimizing algorithm design) rather than other approaches (e.g genetic)?
Re: Deepmind Alphadev: Faster sorting algorithms discovered using deep RL
#7This is really cool. I’ll be interested to see if the team can produce useful and provably hard cryptographic hash functions with this tech. The other interesting application that this inspires is use of this tech to optimize the optimization algorithms used by compilers. Perhaps we can all benefit from optimized optimizers.
Re: Deepmind Alphadev: Faster sorting algorithms discovered using deep RL
#8[deleted]
Re: Deepmind Alphadev: Faster sorting algorithms discovered using deep RL
#9Not general or universal. Only for pre-trained data and with abysmal worst cases.
Re: Deepmind Alphadev: Faster sorting algorithms discovered using deep RL
#10This is really cool. I’ll be interested to see if the team can produce useful and provably hard cryptographic hash functions with this tech. The other interesting application that this inspires is use of this tech to optimize the optimization algorithms used by compilers. Perhaps we can all benefit from optimized optimizers.
There’s already been quite a bit of work done on replacing compiler heuristics with ML models. Google has productionized it with MLGO and there have been quite a few papers/experiments on the topic.