Fetching the paper…
Reading the bibliography…
The execution of graph algorithms using neural networks has recently attracted significant interest due to promising empirical progress.
A note on two problems in connexion with graphs
Edsger W Dijkstra · 1959
Earlier work this paper cites.
The Shortest Path Through a Maze
Edward F. Moore · 1959
Earlier work this paper cites.
The Design and Analysis of Computer Algorithms
Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman · 1974
Earlier work this paper cites.
“neural” computation of decisions in optimization problems
John J Hopfield and David W Tank · 1985
Earlier work this paper cites.
Urisc: the ultimate reduced instruction set computer
Farhad Mavaddat and Behrooz Parhami · 1988
Earlier work this paper cites.
Approximation by superpositions of a sigmoidal function
George Cybenko · 1989
Earlier work this paper cites.
Multilayer feedforward networks are universal approximators
Kurt Hornik, Maxwell Stinchcombe, and Halbert White · 1989
Earlier work this paper cites.
On the computational power of neural nets
Hava Siegelmann and Eduardo Sontag · 1995
Earlier work this paper cites.
Neural networks for combinatorial optimization: a review of more than a decade of research
Kate A Smith · 1999
Earlier work this paper cites.
Universality of deep convolutional neural networks
Ding-Xuan Zhou · 1999
Earlier work this paper cites.
Alex Graves, Greg Wayne, and Ivo Danihelka · 2014
Earlier work this paper cites.
Jason Weston, Sumit Chopra, and Antoine Bordes · 2014
Earlier work this paper cites.
Hybrid computing using a neural network with dynamic external memory
Alex Graves, Greg Wayne, Malcolm Reynolds, Tim Harley, Ivo Danihelka, Agnieszka Grabska-Barwińska, Sergio Gómez Colmenarejo, Edward Grefenstette, Tiago Ramalho, John Agapiou, et al · 2016
Earlier work this paper cites.
Neural gpus learn algorithms
Łukasz Kaiser and Ilya Sutskever · 2016
Earlier work this paper cites.
Neural programmer-interpreters
Scott Reed and Nando De Freitas · 2016
Earlier work this paper cites.
Semi-supervised classification with graph convolutional networks
Thomas N. Kipf and Max Welling · 2017
Earlier work this paper cites.
Why does deep and cheap learning work so well?
Henry W Lin, Max Tegmark, and David Rolnick · 2017
Earlier work this paper cites.
Attention is all you need
Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, Łukasz Kaiser, and Illia Polosukhin · 2017
Earlier work this paper cites.
Understanding deep neural networks with rectified linear units
Raman Arora, Amitabh Basu, Poorya Mianjy, and Anirbit Mukherjee · 2018
Cited alongside, same era.
Graph attention networks
Petar Veličković, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Liò, and Yoshua Bengio · 2018
Cited alongside, same era.
What graph neural networks cannot learn: depth vs width
Andreas Loukas · 2020
Cited alongside, same era.
Towards scale-invariant graph-related problem solving by iterative homogeneous GNNs
Hao Tang, Zhiao Huang, Jiayuan Gu, Bao-Liang Lu, and Hao Su · 2020
Cited alongside, same era.
Sparse sinkhorn attention
Yi Tay, Dara Bahri, Liu Yang, Donald Metzler, and Da-Cheng Juan · 2020
Cited alongside, same era.
Neural execution of graph algorithms
Petar Veličković, Rex Ying, Matilde Padovano, Raia Hadsell, and Charles Blundell · 2020
Cited alongside, same era.
The CLRS algorithmic reasoning benchmark
Petar Veličković, Adrià Puigdomènech Badia, David Budden, Razvan Pascanu, Andrea Banino, Misha Dashevskiy, Raia Hadsell, and Charles Blundell · 2022
Later among the works it cites.
Neural algorithmic reasoning with causal regularisation
Beatrice Bevilacqua, Kyriacos Nikiforou, Borja Ibarz, Ioana Bica, Michela Paganini, Charles Blundell, Jovana Mitrovic, and Petar Veličković · 2023
Later among the works it cites.
Combinatorial optimization and reasoning with graph neural networks
Quentin Cappart, Didier Chételat, Elias B Khalil, Andrea Lodi, Christopher Morris, and Petar Veličković · 2023
Later among the works it cites.
Scaling vision transformers to 22 billion parameters
Mostafa Dehghani, Josip Djolonga, Basil Mustafa, Piotr Padlewski, Jonathan Heek, Justin Gilmer, Andreas Peter Steiner, Mathilde Caron, Robert Geirhos, Ibrahim Alabdulmohsin, et al · 2023
Later among the works it cites.
Relational attention: Generalizing transformers for graph-structured tasks
Cameron Diao and Ricky Loynd · 2023
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
What can neural networks reason about?
Keyulu Xu, Jingling Li, Mozhi Zhang, Simon S. Du, Ken ichi Kawarabayashi, and Stefanie Jegelka · 2020
Cited alongside, same era.
Neural execution engines: Learning to execute subroutines
Yujun Yan, Kevin Swersky, Danai Koutra, Parthasarathy Ranganathan, and Milad Hashemi · 2020
Cited alongside, same era.
Are transformers universal approximators of sequence-to-sequence functions?
Chulhee Yun, Srinadh Bhojanapalli, Ankit Singh Rawat, Sashank Reddi, and Sanjiv Kumar · 2020
Cited alongside, same era.
Attention is turing-complete
Jorge Pérez, Pablo Barceló, and Javier Marinkovic · 2021
Cited alongside, same era.
Neural algorithmic reasoning
Petar Veličković and Charles Blundell · 2021
Cited alongside, same era.
Incorporating convolution designs into visual transformers
Kun Yuan, Shaopeng Guo, Ziwei Liu, Aojun Zhou, Fengwei Yu, and Wei Wu · 2021
Cited alongside, same era.
Parallel algorithms align with neural execution
Valerie Engelmayer, Dobrik Georgiev, and Petar Veličković · 2023
Later among the works it cites.
Learning transformer programs
Dan Friedman, Alexander Wettig, and Danqi Chen · 2023
Later among the works it cites.
Beyond erdos-renyi: Generalization in algorithmic reasoning on graphs
Dobrik Georgiev, Pietro Liò, Jakub Bachurski, Junhua Chen, and Tunan Shi · 2023
Later among the works it cites.
Looped transformers as programmable computers
Angeliki Giannou, Shashank Rajput, Jy-Yong Sohn, Kangwook Lee, Jason D. Lee, and Dimitris Papailiopoulos · 2023
Later among the works it cites.
Relu neural networks of polynomial size for exact maximum flow computation
Christoph Hertrich and Leon Sering · 2023
Later among the works it cites.
Provably good solutions to the knapsack problem via neural networks of bounded size
Christoph Hertrich and Martin Skutella · 2023
Later among the works it cites.
Tracr: Compiled transformers as a laboratory for interpretability
David Lindner, János Kramár, Sebastian Farquhar, Matthew Rahtz, Thomas McGrath, and Vladimir Mikulik · 2023
Later among the works it cites.
Transformers learn shortcuts to automata
Bingbin Liu, Jordan T. Ash, Surbhi Goel, Akshay Krishnamurthy, and Cyril Zhang · 2023
Later among the works it cites.
Dual algorithmic reasoning
Danilo Numeroso, Davide Bacciu, and Petar Veličković · 2023
Later among the works it cites.
Neural algorithmic reasoning without intermediate supervision
Gleb Rodionov and Liudmila Prokhorenkova · 2023
Later among the works it cites.
Llama: Open and efficient foundation language models
Hugo Touvron, Thibaut Lavril, Gautier Izacard, Xavier Martinet, Marie-Anne Lachaux, Timothée Lacroix, Baptiste Rozière, Naman Goyal, Eric Hambro, Faisal Azhar, et al · 2023
Later among the works it cites.
Teaching arithmetic to small transformers
Nayoung Lee, Kartik Sreenivasan, Jason D Lee, Kangwook Lee, and Dimitris Papailiopoulos · 2024
Closest in time.