# Generalized Residual Closure: General Learning Dynamics for Stability-Plasticity Compatibility

arXiv: https://arxiv.org/abs/2609.38911 · HTML: https://mlsanity.com/paper/2609.38911/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 13 of its 29 references that are in the map.
- First posted on arXiv 30 Sep 2026.

## Builds on (most cited first, 13 of 13)

- [Attention Is All You Need](https://mlsanity.com/paper/1706.03762/) (2017)
- [Deep Residual Learning for Image Recognition](https://mlsanity.com/paper/1512.03385/) (2015)
- [Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks](https://mlsanity.com/paper/2005.11401/) (2020)
- [Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks](https://mlsanity.com/paper/1703.03400/) (2017)
- [Overcoming catastrophic forgetting in neural networks](https://mlsanity.com/paper/1612.00796/) (2016)
- [Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity](https://mlsanity.com/paper/2101.03961/) (2021)
- [Convex optimization](https://mlsanity.com/paper/2106.01946/) (2021)
- [Gradient Episodic Memory for Continual Learning](https://mlsanity.com/paper/1706.08840/) (2017)
- [DARTS: Differentiable Architecture Search](https://mlsanity.com/paper/1806.09055/) (2018)
- [Learning to learn by gradient descent by gradient descent](https://mlsanity.com/paper/1606.04474/) (2016)
- [Orthogonal Gradient Descent for Continual Learning](https://mlsanity.com/paper/1910.07104/) (2019)
- [SplitLoRA: Balancing Stability and Plasticity in Continual Learning Through Gradient Space Splitting](https://mlsanity.com/paper/2505.22370/) (2025)
- [FIRE: Frobenius-Isometry Reinitialization for Balancing the Stability-Plasticity Tradeoff](https://mlsanity.com/paper/2602.08040/) (2026)

## Abstract (arXiv)

Learning must acquire new capabilities while preserving both prior responsibilities and the capacity to learn again. We introduce Generalized Residual Closure (GRC), a framework for learning as recursive closure of future-relevant discrepancies: closing a residual establishes the conditions for subsequent prediction, interaction, and learning. Under a complete representation-relation description at a fixed learner-world boundary, persistent internal learning has two primitive modes: Transformation within a representation and revision of the Representation itself. We establish a local tangent decomposition under regularity assumptions and a criterion for when representation revision is necessary. In an affine model, we derive a necessary-and-sufficient condition for stability-plasticity compatibility and the unique solution of a constrained quadratic update problem, which preserves registered old responsibilities while reducing residuals with an effective safe response. We prove that reconstructive semantic protection weakly enlarges the safe-response operator relative to preserving an exact historical realization. Dynamic sufficiency and future-closure viability extend representation adequacy from current prediction to lawful future updating and continued learning. Growth Learning expands the lawful closure domain or lowers optimal closure cost without regression of the registered capability-cost frontier; a conditional commit rule maintains this order. Restricted-sector recoveries and a conditional representation theorem connect the framework to optimization, machine learning, and control. Together, these results organize adaptation, representation revision, and reusable capability within a common account of continued learning.