arXiv AI By Alex Schutz, Victor-Alexandru Darvariu, Efimia Panagiotaki, Bruno Lacerda, Nick Hawes

Tackling GNARLy Problems: Graph Neural Algorithmic Reasoning Reimagined through Reinforcement Learning

Read the original on arXiv AI →

arXiv:2509. 18930v3 Announce Type: replace-cross Abstract: Neural algorithmic reasoning (NAR) is a paradigm that trains neural networks to execute classic algorithms by supervised learning.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Aug 25

Which Algorithms Can Graph Neural Networks Learn?

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 Machine Learning
Aug 27

Imitation Learning for Connection-Tableau Construction

The paper presents an approach to automated theorem proving by framing the construction of clausal connection tableaux as a policy in a transition system. It introduces a graph neural network that scores proof edits based on structure, trained via imitation learning from existing proofs. Experiments on M2k, MPTP2078-bushy, and TPTP v9.2.1 show that the learned policies solve up to 46% more problems than leanCoP and find proofs in an order of magnitude fewer steps.

By Fredrik R{\o}mming, Mantas Bak\v{s}ys, Martin S. Fixman, Sean B. Holden
arXiv Machine Learning
Sep 23

Deep Reinforcement Learning on Item-Compatibility Graphs for One-Dimensional Bin Packing

The paper introduces a novel end‑to‑end, size‑agnostic graph reinforcement learning framework for the one‑dimensional bin packing problem (1D‑BPP). It models packing as a Markov decision process on an item‑compatibility graph, where a graph neural network actor‑critic policy learns to merge compatible partial bins. Empirical results on the BPPLIB benchmark show that the learned policy reduces the mean optimality gap of a constructive heuristic from 2.66 % to 2.31 %, performs competitively against other learned methods, and outperforms a state‑of‑the‑art learned solver on the hardest benchmark family.

By M. Asl{\i} Ayd{\i}n