Neural Abstract Reasoner
Victor Kolev, Bogdan Georgiev, Svetlin Penkov

TL;DR
This paper introduces the Neural Abstract Reasoner (NAR), a memory-augmented neural architecture that, with spectral regularization, significantly improves abstract reasoning accuracy, surpassing symbolic solvers on the ARC benchmark.
Contribution
The paper presents NAR, a novel neural architecture capable of learning and applying abstract rules, enhanced by spectral regularization for better reasoning performance.
Findings
NAR achieves 78.8% accuracy on ARC.
Spectral regularization improves neural reasoning capabilities.
Performance surpasses symbolic solvers by 4 times.
Abstract
Abstract reasoning and logic inference are difficult problems for neural networks, yet essential to their applicability in highly structured domains. In this work we demonstrate that a well known technique such as spectral regularization can significantly boost the capabilities of a neural learner. We introduce the Neural Abstract Reasoner (NAR), a memory augmented architecture capable of learning and using abstract rules. We show that, when trained with spectral regularization, NAR achieves accuracy on the Abstraction and Reasoning Corpus, improving performance 4 times over the best known human hand-crafted symbolic solvers. We provide some intuition for the effects of spectral regularization in the domain of abstract reasoning based on theoretical generalization bounds and Solomonoff's theory of inductive inference.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsEEG and Brain-Computer Interfaces · Neural Networks and Applications · Explainable Artificial Intelligence (XAI)
