The paper defines infinitesimal non-compositionality as the tangent-lift of factorization failures in learning sketches, and proposes learning as converging to a final coalgebra of iterated tangent lifts.
Applications of metric coinduction
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Learning in Infinitesimal Non-Compositional Sketches
The paper defines infinitesimal non-compositionality as the tangent-lift of factorization failures in learning sketches, and proposes learning as converging to a final coalgebra of iterated tangent lifts.