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:2606. 24418v1 Announce Type: new Abstract: Data augmentation is a simple and model-agnostic approach for exploiting known invariances in learning problems.
By Behrooz Tahmasebi, Melanie Weber, Stefanie Jegelka
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:2603. 03538v4 Announce Type: replace Abstract: Large Language Models (LLMs) using chain-of-thought reasoning have demonstrated great potential for solving complex reasoning and planning tasks.
By Maria-Florina Balcan, Avrim Blum, Kiriaki Fragkia, Zhiyuan Li, Dravyansh Sharma
arXiv:2603. 25414v4 Announce Type: replace-cross Abstract: A prevailing assumption in machine learning is that model correctness must be enforced after the fact.
By Houston Haynes
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