arXiv:2607. 26699v1 Announce Type: new Abstract: We investigate message-passing graph neural networks with random node features.
By Lukas Gonon, Thilo Meyer-Brandis, Niklas Weber
arXiv:2602.13106v2 Announce Type: replace-cross
Abstract: In recent years, there has been growing interest in understanding neural architectures' ability to learn to execute discrete algorithms, a li...
By Solveig Wittig, Antonis Vasileiou, Robert R. Nerem, Timo Stoll, Floris Geerts, Yusu Wang, Christopher Morris
arXiv:2601. 23207v2 Announce Type: replace-cross Abstract: Understanding what graph neural networks can learn, especially their ability to learn to execute algorithms, remains a central theoretical challenge.
By Muhammad Fetrat Qharabagh, Artur Back de Luca, George Giapitzakis, Kimon Fountoulakis
arXiv:2510. 10101v4 Announce Type: replace Abstract: Understanding the interplay between generalization, expressivity, and the geometry of the input space is a central challenge in graph learning.
By Martin Carrasco, Caio F. Deberaldini Netto, Vahan A. Martirosyan, Ehimare Okoyomon, Caterina Graziani
arXiv:2602. 08785v2 Announce Type: replace Abstract: Generalization and approximation capabilities of message passing graph neural networks (MPNNs) are often studied by defining a compact metric on a space of input graphs under which MPNNs are equicontinuous.
By Ofek Amran, Tom Gilat, Ron Levie
arXiv:2610.00420v1 Announce Type: new
Abstract: A weight space network (or metanetwork) takes the weights of another neural network as input and predicts properties of it. Most prior work trains such...
By Yuxin Ma, Adir Dayan, Yam Eitan, Haggai Maron, Soledad Villar