Fetching the paper…
Reading the bibliography…
Understanding how machine learning models respond to distributional shifts is a key research challenge.
“About a Certain Minimal Problem”
Vojtech Jarnık · 1930
Earlier work this paper cites.
“On the shortest spanning subtree of a graph and the traveling salesman problem”
Joseph Kruskal · 1956
Earlier work this paper cites.
“Shortest Connection Networks and Some Generalizations”
Robert Prim · 1957
Earlier work this paper cites.
“A Note on Two Problems in Connexion with Graphs:(Numerische Mathematik, 1 (1959), p 269-271)”
Edsger Dijkstra · 1959
Earlier work this paper cites.
“A Formal Basis for the Heuristic Determination of Minimum Cost Paths”
Peter. Hart, Nils. Nilsson and Bertram Raphael · 1968
Earlier work this paper cites.
“Generating Random Spanning Trees More Quickly than the Cover Time”
David Wilson · 1996
Earlier work this paper cites.
“Some Cluster Size and Percolation Problems”
Michael. Fisher and John. Essam · 2004
Earlier work this paper cites.
Hugo Duminil-Copin · 2017
Earlier work this paper cites.
“Leveraging Procedural Generation to Benchmark Reinforcement Learning”
Karl Cobbe, Christopher Hesse, Jacob Hilton and John Schulman · 2019
Cited alongside, same era.
“Analysis of Maze Generating Algorithms”
Gabrovšek · 2019
Cited alongside, same era.
“MazeExplorer: A Customisable 3D Benchmark for Assessing Generalisation in Reinforcement Learning”
Luke Harries et al · 2019
Cited alongside, same era.
“maze-generation-algorithms”, 2019
Ferenc Németh · 2019
Cited alongside, same era.
“PyTorch: An Imperative Style, High-Performance Deep Learning Library”
Adam Paszke et al · 2019
Cited alongside, same era.
“Can you learn an algorithm? generalizing from easy to hard problems with recurrent networks”
Avi Schwarzschild et al · 2021
“Maze”, 2022
Emad Ehsan · 2022
Later among the works it cites.
“Maze Dataset”, 2023
Michael. Ivanitskiy et al · 2023
Closest in time.
“Maze Transformer Interpretability”, 2023
Michael. Ivanitskiy et al · 2023
Closest in time.
“Evaluating Large Language Models on Graphs: Performance Insights and Comparative Analysis”
Chang Liu and Bo Wu · 2023
Closest in time.
“Faster predict-and-optimize with three-operator splitting”
Daniel McKenzie, Samy Fung and Howard Heaton · 2023
Closest in time.
“Toward transparent ai: A survey on interpreting the inner structures of deep neural networks”
Tilman Räuker, Anson Ho, Stephen Casper and Dylan Hadfield-Menell · 2023
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
“Datasets for Studying Generalization from Easy to Hard Examples”
Avi Schwarzschild et al · 2021
Cited alongside, same era.
Closest in time.
“Evaluating ChatGPT and GPT-4 for Visual Programming”
Adish Singla · 2023
Closest in time.