拟合所有提示还不够:循环算法推理器中的过早泛滥
Fitting Every Hint Is Not Enough: Premature Floods in Recurrent Algorithmic Reasoners
AI总结:
该研究发现循环算法推理器在深度图上会出现过早泛滥问题,分析了GRU处理器等的两种泛滥路径,提出审计输入范围和深度图测试的解决方案。
摘要:
循环算法推理器在小图上按每一步提示进行训练,而在大图上会运行更多步骤。针对SALSA-CLRS上的广度优先搜索,我们发现推理器可以复现每一条训练提示,但在深度图上仍会失败:在完成若干准确步骤后,它会在搜索到达之前就声明节点已被访问。我们将此现象称为过早泛滥,并追溯出两种导致该现象的路径。在我们带有度数输入的GRU处理器中,泛滥由隐藏状态承载,且当该输入处于训练分布的尾部时触发。在推理时提高输入值会使泛滥更早发生,且六个泛滥模型均未对步数进行计数。若不使用该输入,对邻居状态求和而非取平均值也会破坏该处理器。在基准测试自身的GIN和PGN中,使用其代码训练时,部分随机种子会从固定步数开始泛滥,且在稀疏图和稠密图上均如此。对度数输入进行钳位或添加200个稠密训练图可消除GRU处理器的所有失败情况。在步骤间分离状态可避免该处理器出现泛滥(23个随机种子中0个失败,而全反向传播下为6个),但对求和或残差更新无效,且两种已发表的补救措施仍会留下泛滥情况。基准测试的所有测试集均不同时具备深度和稠密特性,但其中最深的测试集显示了第二种路径:在其1600个节点的Delaunay图上,一个GIN种子从第18步开始泛滥。因此,我们建议对每个输入和聚合的范围进行审计(可捕获第一种路径),并在深度图上进行测试(可捕获两种路径)。
英文摘要:
Recurrent algorithmic reasoners are trained with per-step hints on small graphs and run for many more steps on large ones. On breadth-first search in SALSA-CLRS, we find that a reasoner can reproduce every training hint and still fail on deep graphs: after some exact steps, it declares nodes reached before the search gets there. We call this a premature flood and trace two routes to it. In our GRU processor with a degree input, the flood is carried in the hidden state and set off when that input is in the tail of the training distribution. Setting the input higher at inference brings the flood sooner, and none of the six flooding models counts steps. Without the input, summing the neighbors' states instead of averaging them also breaks the processor. In the benchmark's own GIN and PGN, trained with its code, some seeds instead flood from a fixed step, on sparse and dense graphs alike. Clamping the degree input or adding 200 dense training graphs removes every failure of the GRU processor. Detaching the state between steps avoids the flood in that processor (0 of 23 seeds, against 6 under full backpropagation) but not with sums or a residual update, and two published remedies leave floods. None of the benchmark's test sets is both deep and dense, but its deepest one shows the second route: on its Delaunay graphs at 1,600 nodes, one GIN seed floods from step 18. We therefore recommend auditing the range of every input and aggregate, which catches the first route, and testing on deep graphs, which catches both.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。