Internalizing Tools as Morphisms in Graded Transformers
Tony Shaska

TL;DR
This paper presents a graded transformer framework that internalizes symbolic tools as morphisms, enabling selective, interpretable, and differentiable symbolic operations within neural models, unifying symbolic computation and geometric learning.
Contribution
It introduces a novel graded formulation of internal symbolic computation in transformers, with an algebraic and geometric foundation, and demonstrates its effectiveness on hybrid symbolic-linguistic tasks.
Findings
Selective morphic activation demonstrated on hybrid tasks
Framework unifies symbolic computation with geometric learning
Subsumes prior external-tool paradigms as special cases
Abstract
We introduce a graded formulation of internal symbolic computation for transformers. The hidden space is endowed with a grading , and symbolic operations are realized as typed block maps (morphisms) that are activated selectively by a differentiable routing policy. A self-supervised \emph{graded utility functional}, defined as the loss reduction induced by a candidate morphism, governs activation and yields sparse, interpretable behavior. We develop the algebraic and geometric foundations: an internal model category whose objects are homogeneous components and whose morphisms are admissible grade transitions; adjoint pairs encoding typed round trips; and information-geometric interpretations in terms of KL gain, mirror descent with Bregman divergences, and Fisher natural gradients. Methodologically, we specify a utility--aware…
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
TopicsFerroelectric and Negative Capacitance Devices · Logic, programming, and type systems · Constraint Satisfaction and Optimization
