LACE: Loss-Adaptive Capacity Expansion for Continual Learning
Not on the map. Why?
Abstract (arXiv)
Fixed representational capacity is a fundamental constraint in continual learning: practitioners must guess an appropriate model width before training, without knowing how many distinct concepts the data contains. We propose LACE (Loss-Adaptive Capacity Expansion), a simple online mechanism that expands a model's representational capacity during training by monitoring its own loss signal. When sustained loss deviation exceeds a threshold - indicating that the current capacity is insufficient for newly encountered data - LACE adds new dimensions to the projection layer and trains them jointly with existing parameters. Across synthetic and real-data experiments, LACE triggers expansions exclusively at domain boundaries (100% boundary precision, zero false positives), matches the accuracy of a large fixed-capacity model while starting from a fraction of its dimensions, and produces adapter dimensions that are collectively critical to performance (3% accuracy drop when all adapters removed). We further demonstrate unsupervised domain separation in GPT-2 activations via layer-wise clustering, showing a U-shaped separability curve across layers that motivates adaptive capacity allocation in deep networks. LACE requires no labels, no replay buffers, and no external controllers, making it suitable for on-device continual learning under resource constraints.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 8 of its 17 references that are in the map. First posted on arXiv 30 Mar 2026.
Builds on
8 of 17 references.
References · 8
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,073
- 2017Gradient Episodic Memory for Continual Learningcited by 1,898
- 2016Progressive Neural Networkscited by 1,361
- 2022Toy Models of Superpositioncited by 971
- 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 898
- 2021Towards a Unified View of Parameter-Efficient Transfer Learningcited by 872
Built on by
Not cited yet.