Fetching the paper…
Reading the bibliography…
We introduce an extension to the CLRS algorithmic learning benchmark, prioritizing scalability and the utilization of sparse representations.
On random graphs i
Paul Erdős and Alfréd Rényi · 1959
Earlier work this paper cites.
On the evolution of random graphs
Paul Erdős, Alfréd Rényi, et al · 1960
Earlier work this paper cites.
Collective dynamics of ‘small-world’networks
Duncan J Watts and Steven H Strogatz · 1998
Earlier work this paper cites.
The vanishing gradient problem during learning recurrent neural nets and problem solutions
Sepp Hochreiter · 1998
Earlier work this paper cites.
Gradient-based learning applied to document recognition
Yann LeCun, Léon Bottou, Yoshua Bengio, and Patrick Haffner · 1998
Earlier work this paper cites.
Small-world networks: Evidence for a crossover picture
Marc Barthélémy and Luis A Nunes Amaral · 1999
Earlier work this paper cites.
Lstm recurrent networks learn simple context-free and context-sensitive languages
Felix A Gers and E Schmidhuber · 2001
Earlier work this paper cites.
On the properties of neural machine translation: Encoder-decoder approaches
Kyunghyun Cho, Bart Van Merriënboer, Dzmitry Bahdanau, and Yoshua Bengio · 2014
Earlier work this paper cites.
Alex Graves, Greg Wayne, and Ivo Danihelka · 2014
Earlier work this paper cites.
Jimmy Lei Ba, Jamie Ryan Kiros, and Geoffrey E Hinton · 2016
Earlier work this paper cites.
Relational inductive biases, deep learning, and graph networks
Peter W Battaglia, Jessica B Hamrick, Victor Bapst, Alvaro Sanchez-Gonzalez, Vinicius Zambaldi, Mateusz Malinowski, Andrea Tacchetti, David Raposo, Adam Santoro, Ryan Faulkner, et al · 2018
Earlier work this paper cites.
How powerful are graph neural networks?
Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka · 2018
Earlier work this paper cites.
Learning a sat solver from single-bit supervision
Daniel Selsam, Matthew Lamm, Benedikt Bünz, Percy Liang, Leonardo de Moura, and David L Dill · 2018
Earlier work this paper cites.
Recurrent relational networks
Rasmus Palm, Ulrich Paquet, and Ole Winther · 2018
Cited alongside, same era.
JAX: composable transformations of Python+NumPy programs, 2018
James Bradbury, Roy Frostig, Peter Hawkins, Matthew James Johnson, Chris Leary, Dougal Maclaurin, George Necula, Adam Paszke, Jake VanderPlas, Skye Wanderman-Milne, and Qiao Zhang · 2018
Cited alongside, same era.
Fast Graph Representation Learning with PyTorch Geometric, May 2019
Matthias Fey and Jan Eric Lenssen · 2019
Cited alongside, same era.
Strategies for pre-training graph neural networks
Weihua Hu, Bowen Liu, Joseph Gomes, Marinka Zitnik, Percy Liang, Vijay Pande, and Jure Leskovec · 2019
Cited alongside, same era.
What graph neural networks cannot learn: depth vs width
Andreas Loukas · 2019
Cited alongside, same era.
Introduction to algorithms
Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, and Clifford Stein · 2022
Later among the works it cites.
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.
Learning graph algorithms with recurrent graph neural networks
Florian Grötschla, Joël Mathys, and Roger Wattenhofer · 2022
Later among the works it cites.
End-to-end algorithm synthesis with recurrent networks: Logical extrapolation without overthinking
Arpit Bansal, Avi Schwarzschild, Eitan Borgnia, Zeyad Emam, Furong Huang, Micah Goldblum, and Tom Goldstein · 2022
Later among the works it cites.
Graph neural networks are dynamic programmers
Andrew J Dudzik and Petar Veličković · 2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Adam Paszke, Sam Gross, Francisco Massa, Adam Lerer, James Bradbury, Gregory Chanan, Trevor Killeen, Zeming Lin, Natalia Gimelshein, Luca Antiga, Alban Desmaison, Andreas Kopf, Edward Yang, Zachary DeVito, Martin Raison, Alykhan Tejani, Sasank Chilamkurthy, Benoit Steiner, Lu Fang, Junjie Bai, and Soumith Chintala · 2019
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.
Mastering distributed algorithms, 2020
Roger Wattenhofer · 2020
Cited alongside, same era.
Pointer graph networks
Petar Veličković, Lars Buesing, Matthew Overlan, Razvan Pascanu, Oriol Vinyals, and Charles Blundell · 2020
Cited alongside, same era.
Learning the travelling salesperson problem requires rethinking generalization
Chaitanya K Joshi, Quentin Cappart, Louis-Martin Rousseau, and Thomas Laurent · 2020
Cited alongside, same era.
How neural networks extrapolate: From feedforward to graph neural networks
Keyulu Xu, Mozhi Zhang, Jingling Li, Simon S Du, Ken-ichi Kawarabayashi, and Stefanie Jegelka · 2020
Cited alongside, same era.
Can you learn an algorithm? generalizing from easy to hard problems with recurrent networks
Avi Schwarzschild, Eitan Borgnia, Arjun Gupta, Furong Huang, Uzi Vishkin, Micah Goldblum, and Tom Goldstein · 2021
Cited alongside, same era.
A generalist neural algorithmic learner
Borja Ibarz, Vitaly Kurin, George Papamakarios, Kyriacos Nikiforou, Mehdi Bennani, Róbert Csordás, Andrew Joseph Dudzik, Matko Bošnjak, Alex Vitvitskyi, Yulia Rubanova, Andreea Deac, Beatrice Bevilacqua, Yaroslav Ganin, Charles Blundell, and Petar Veličković · 2022
Later among the works it cites.
Parallel algorithms align with neural execution
Valerie Engelmayer, Dobrik Georgiev, and Petar Veličković · 2023
Closest in time.
Towards better out-of-distribution generalization of neural algorithmic reasoning tasks
Sadegh Mahdavi, Kevin Swersky, Thomas Kipf, Milad Hashemi, Christos Thrampoulidis, and Renjie Liao · 2023
Closest in time.
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
Closest in time.
Neural algorithmic reasoning without intermediate supervision
Gleb Rodionov and Liudmila Prokhorenkova · 2023
Closest in time.
Relational attention: Generalizing transformers for graph-structured tasks
Cameron Diao and Ricky Loynd · 2023
Closest in time.
Neural algorithmic reasoning for combinatorial optimisation
Dobrik Georgiev, Danilo Numeroso, Davide Bacciu, and Pietro Liò · 2023
Closest in time.