AlphaDev generated a range of fixed sort and variable sort algorithms that are correct with lower latency than the state-of-the-art:

AlphaDev generated a range of fixed sort and variable sort algorithms that are correct with lower latency than the state-of-the-art:

"For the functions that handle a specific number of items, it's possible to write code without any branches where you execute different code based on the state of a variable. As a result, the performance of this code generally scales with a number of instructions required. AlphaDev was able to shave an instruction each off sort-3, sort-5, and sort-8, and even more off sort-6 and sort-7. There was only one (sort-4) where it didn't find a way to improve the human code. Repeated runs of the code on actual systems showed that fewer instructions did lead to better performance."

要查看或添加评论,请登录

Ken Wasserman的更多文章

社区洞察

其他会员也浏览了