Position Paper: Generalized grammar rules and structure-based generalization beyond classical equivariance for lexical tasks and transduction
Not on the map. Why?
Abstract (arXiv)
Compositional generalization is one of the main properties which differentiates lexical learning in humans from state-of-art neural networks. We propose a general framework for building models that can generalize compositionally using the concept of Generalized Grammar Rules (GGRs), a class of symmetry-based compositional constraints for transduction tasks, which we view as a transduction analogue of equivariance constraints in physics-inspired tasks. Besides formalizing generalized notions of symmetry for language transduction, our framework is general enough to contain many existing works as special cases. We present ideas on how GGRs might be implemented, and in the process draw connections to reinforcement learning and other areas of research.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 2 Feb 2024.
Builds on
0 of 0 references.
No references here yet.
Built on by
Citing papers per year: 2024: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2026Compositional Reasoning in Language Models under Reinforcement Learning Post-Training
- 2022Neural-Symbolic Recursive Machine for Systematic Generalization
- 2026Compositional Transduction with Latent Analogies for Offline Goal-Conditioned Reinforcement Learning
- 2025Task Generalization With AutoRegressive Compositional Structure: Can Learning From D Tasks Generalize to DT Tasks?
- 2026Towards Compositional Generalization of LLMs via Skill Taxonomy Guided Data Synthesis
- 2025Modeling Unseen Environments with Language-guided Composable Causal Components in Reinforcement Learning
- 2025Characterizing Pattern Matching and Its Limits on Compositional Task Structures
- 2026From Reasoning Traces to Reusable Modules: Understanding Compositional Generalization in Language Model Reasoning