Skip to content
Preprint

SPARCL: Spectral Partitioned Analytic Continual Learning

Aug 2026 · 0 citations · 38 references
Computer Science

TL;DR

SPARCL is proposed, a spectral partitioned analytic continual learner that decomposes the running autocorrelation into a high-energy core and a residual complement, freezes old-class classifier components in the core subspace, and updates only the residual block through recursive least squares with an optional residual random-projection expansion.

Abstract

Analytic continual learning has emerged as a strong exemplar-free alternative to gradient-based class-incremental learning because it replaces iterative optimization with closed-form ridge updates. Yet the usual forgetting narrative, centered on stochastic gradient overwriting, does not explain why analytic methods still drift on old classes despite exact recursive solvers. We identify the culprit as spectral interference: the joint ridge classifier for all tasks shares the inverse autocorrelation operator $(R+\lambda I)^{-1}$, so incoming task samples that load onto old dominant eigendirections dilute the spectrum and perturb old-class logits even when old labels are never revisited. Based on this view, we propose SPARCL, a spectral partitioned analytic continual learner that decomposes the running autocorrelation into a high-energy core and a residual complement, freezes old-class classifier components in the core subspace, and updates only the residual block through recursive least squares with an optional residual random-projection expansion. This yields a simple closed-form update with a provable invariance guarantee for the core contribution of old logits. Across CIFAR-100, CUB-200, ImageNet-R, and ImageNet-A under a frozen ViT-B/16 protocol, SPARCL closes most of the gap from classical analytic learners to strong representation matchers, while remaining complementary to sparse feature-decorrelation approaches such as Fly-CL.

View source

Similar papers

#machine learning Preprint Oct 2026

MuLoRA: Spectrally Balanced Low-Rank Adaptation for Continual Learning

Low-rank adaptation (LoRA) provides a parameter-efficient approach to continual learning, but its nominal rank can conceal a loss of effective adaptation capacity. We identify \emph{spectral plasticity collapse}: during sequential adaptation, update energy becomes concentrated in a small subset of singular modes, leavi...

Jun-Kang Liu · 0 citations
#machine learning Preprint Sep 2026

Why Learning Rediscovers the Closed-Form Diagonal Regularizer

We identify a diagonal saturation principle in modal inverse problems: when truncation noise is isotropic, the Bayes-optimal Tikhonov shape is a closed-form power law Gamma_k proportional to lambda_k^|s| set by the prior alone, independent of the domain. Berry's random-wave conjecture decorrelates the truncation noise...

Jeahn Han, Pyojin Kim · 0 citations
#machine learning Preprint Sep 2026

A Dynamical Theory of LoRA in Continual Learning

Despite the widespread use of Low-Rank Adaptation (LoRA), little is known about its dynamics in continual learning and the mechanisms by which low-rank updates affect catastrophic forgetting. We provide an asymptotically exact dynamical characterization of LoRA in a solvable two-task teacher-student model. In the high-...

Théo Marchetta, F. Alessandroni, Alessandro Breccia et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Hyperbolic Multimodal Continual Learning: A Closest-Admissible Solution

Across a unified 16-task classification-retrieval stream with three hyperbolic backbones, HMCL improves final performance and backward transfer over sequential fine-tuning and four continual-learning baselines; HMCL-CA gives the highest Overall score on every backbone.

Jia-Hong Liu, Ming Shen, Xiao-Hao Liu et al. · 0 citations
#machine learning Preprint Oct 2026

PaLoRA: Paced Low-Rank Adaptation for Continual Learning

LoRA-based continual learning methods mitigate catastrophic forgetting through various mechanisms, yet nearly all complement these with small learning rates as a heuristic to restrict gradient scaling magnitude. Such fixed heuristics lack theoretical guidance on how the strength of this restriction should evolve as tas...

Yuxuan Li, Fan-Hu Zeng, Hao Tang · 0 citations
#artificial intelligence Preprint Aug 2026

The Sequential Price of Continual Learning

It is proved that distribution-level forgetting and population loss converge to the same stationary limit, and the additional loss incurred by sequential exact fitting, or the sequential price is quantified.

Zong-Huan Xu, Xing-Gang Ma · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.