How to transfer algorithmic reasoning knowledge to learn new algorithms?
Louis-Pascal A. C. Xhonneux, Andreea Deac, Petar Velickovic, Jian Tang

TL;DR
This paper explores how to transfer algorithmic reasoning knowledge to learn new algorithms, using multi-task learning on a dataset of graph algorithms to improve systematic generalisation.
Contribution
It demonstrates that standard transfer techniques are insufficient and proposes multi-task learning as an effective method for transferring algorithmic reasoning knowledge.
Findings
Multi-task learning improves transfer of algorithmic reasoning.
Standard transfer techniques are inadequate for systematic generalisation.
Empirical validation on a dataset of 9 algorithms and 3 graph types.
Abstract
Learning to execute algorithms is a fundamental problem that has been widely studied. Prior work~\cite{veli19neural} has shown that to enable systematic generalisation on graph algorithms it is critical to have access to the intermediate steps of the program/algorithm. In many reasoning tasks, where algorithmic-style reasoning is important, we only have access to the input and output examples. Thus, inspired by the success of pre-training on similar tasks or data in Natural Language Processing (NLP) and Computer Vision, we set out to study how we can transfer algorithmic reasoning knowledge. Specifically, we investigate how we can use algorithms for which we have access to the execution trace to learn to solve similar tasks for which we do not. We investigate two major classes of graph algorithms, parallel algorithms such as breadth-first search and Bellman-Ford and sequential greedy…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsAdvanced Graph Neural Networks · Bayesian Modeling and Causal Inference · Constraint Satisfaction and Optimization
