Learning neuro-symbolic convergent term rewriting systems
Flavio Petruzzellis, Alberto Testolin, Alessandro Sperduti

TL;DR
This paper introduces neuro-symbolic architectures, NRS and FastNRS, for learning convergent term rewriting systems that generalize well to out-of-distribution tasks, with FastNRS being more efficient.
Contribution
The paper presents a novel neuro-symbolic framework for learning convergent term rewriting systems, including two modular models that outperform existing neural baselines.
Findings
Models generalize to out-of-distribution instances.
FastNRS improves memory efficiency and training speed.
System outperforms strong neural baselines and matches or exceeds GPT-4o.
Abstract
Building neural systems that can learn to execute symbolic algorithms is a challenging open problem in artificial intelligence, especially when aiming for strong generalization and out-of-distribution performance. In this work, we introduce a general framework for learning convergent term rewriting systems using a neuro-symbolic architecture inspired by the rewriting algorithm itself. We present two modular implementations of such architecture: the Neural Rewriting System (NRS) and the Fast Neural Rewriting System (FastNRS). As a result of algorithmic-inspired design and key architectural elements, both models can generalize to out-of-distribution instances, with FastNRS offering significant improvements in terms of memory efficiency, training speed, and inference time. We evaluate both architectures on four tasks involving the simplification of mathematical formulas and further…
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
TopicsModel Reduction and Neural Networks · Mathematics, Computing, and Information Processing · Machine Learning in Materials Science
