arXiv AI By Kheer Sagar Patel, Mojtaba Soltanalian

The Structure Gap: When More Data Cannot Replace Structured Reasoning

Read the original on arXiv AI →

The paper argues that for tasks whose behavior is tightly constrained by known structure—such as solvers, symmetry groups, or physical laws—finite data alone cannot fully capture the underlying mapping, even with expressive neural networks. It introduces the concept of a "structure gap," the performance difference between a method that incorporates this governing structure and a purely data‑driven learner. The authors prove this gap for a Gaussian inverse problem and provide additional theoretical bounds and experimental evidence in areas like sparse recovery and graph reachability.

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
Sep 7

DODR: Deterministic Operator-Driven Reasoning in Latent Space

The paper introduces DODR, a deterministic operator‑driven reasoning architecture that models reasoning as graph computations in a high‑dimensional linear‑algebraic space, replacing token‑level sampling with matrix operations. Reasoning states are snapshot vectors of semantic units, and three trainable matrix operators—deduction, induction, and abduction—implement Peirce’s inference types. Experiments on 503 records demonstrate near‑perfect deduction, high generalization for induction, and significant gains for abduction, while the design guarantees zero hallucination and supports continual learning.

By Weicai Huang (Beijing MQPat Technologies, Co., Ltd.)
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