论文标题
CLR算法推理基准
The CLRS Algorithmic Reasoning Benchmark
论文作者
论文摘要
算法的学习表示是机器学习的一个新兴领域,试图从具有经典算法的神经网络中桥接概念。几项重要的作品已经调查了神经网络是否可以有效地推理算法,通常是通过学习执行它们。然而,该地区的共同趋势是生成针对性的算法数据来评估特定的假设,从而使跨出版物的结果难以转移并增加进入障碍。为了巩固进步和努力统一评估,我们提出了CLRS算法推理基准,涵盖了算法教科书的简介中的经典算法。我们的基准测试跨越各种算法推理过程,包括分类,搜索,动态编程,图形算法,字符串算法和几何算法。我们进行了广泛的实验,以证明几种流行的算法推理基准在这些任务上的执行方式,因此突出了与几个开放挑战的链接。我们的图书馆很容易在https://github.com/deepmind/clrs上找到。
Learning representations of algorithms is an emerging area of machine learning, seeking to bridge concepts from neural networks with classical algorithms. Several important works have investigated whether neural networks can effectively reason like algorithms, typically by learning to execute them. The common trend in the area, however, is to generate targeted kinds of algorithmic data to evaluate specific hypotheses, making results hard to transfer across publications, and increasing the barrier of entry. To consolidate progress and work towards unified evaluation, we propose the CLRS Algorithmic Reasoning Benchmark, covering classical algorithms from the Introduction to Algorithms textbook. Our benchmark spans a variety of algorithmic reasoning procedures, including sorting, searching, dynamic programming, graph algorithms, string algorithms and geometric algorithms. We perform extensive experiments to demonstrate how several popular algorithmic reasoning baselines perform on these tasks, and consequently, highlight links to several open challenges. Our library is readily available at https://github.com/deepmind/clrs.