Skip to content

Spectral-Aware Analytic Class-Incremental Learning for Long-Tailed Distributions

Jul 2026 · arXiv.org · Vol abs/2607.22931 · 0 citations · 35 references
Computer Science

TL;DR

Geometry-Spectral Rectification (GSR), a theoretically grounded framework that treats long-tailed learning as a spectral regularization problem, is proposed, offering a superior trade-off between computational efficiency and robust generalization in long-tailed settings.

Abstract

Analytic Continual Learning (ACL) offers a computationally efficient alternative to gradient-based approaches. Recent ACL methods are based on Recursive Least Squares (RLS) and have achieved the state-of-the-art results compared to other alternatives. However, they falter significantly in Class-Incremental Learning scenarios characterized by Long-Tailed distributions. While the ill-conditioning of the autocorrelation (Gram) matrix is a known limitation of RLS, we demonstrate that class imbalance exacerbates this issue into a distinct spectral pathology:"tail"classes suffer from severe spectral collapse, rendering their subspaces numerically indistinguishable from noise. Standard Ridge Regression ($L_2$) fails to address this effectively as it applies isotropic regularization - a uniform penalty that is insufficient to stabilize the tail without over-shrinking the head. To address this, we propose Geometry-Spectral Rectification (GSR), a theoretically grounded framework that treats long-tailed learning as a spectral regularization problem. Unlike standard isotropic regularization (Ridge) which uniformly penalizes all eigenvalues, GSR acts as an anisotropic spectral filter, selectively inflating the collapsed eigenvalues of tail classes. We construct a structured, data-dependent spectral perturbation matrix $\Delta$ that selectively inflates collapsed tail eigen-directions of the Gram matrix. Theoretical analysis proves that GSR guarantees an improved stable rank for the Gram matrix, ensuring numerical stability. Extensive experiments show that GSR establishes a new state-of-the-art for analytic CIL, offering a superior trade-off between computational efficiency and robust generalization in long-tailed settings.

View source

Similar papers

Preprint Aug 2026

SPARCL: Spectral Partitioned Analytic Continual Learning

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...

James E. Hartley, Zeropy Surio, D. Whitmore et al. · 0 citations
Preprint Aug 2026

Geometric Regularization for Long-Tailed Semi-Supervised Learning via Gaussian Feature Bridges

This work introduces a novel framework, Gaussian Bridge Consistency (GBC), to address challenges of semi-supervised learning by constructing semantic interpolation paths between unlabeled samples and high-quality class anchors, and proposes BridgeMix, a confidence-aware feature mixing strategy that interpolates both sa...

Hong-Yang He, Xin-Yuan Song, Yan Zhong et al. · 1 citation
#artificial intelligence Preprint Aug 2026

Learning Dynamics of Logits Debiasing for Long-Tailed Semi-Supervised Learning

DyTrim is proposed, a principle-based dynamic pruning framework that reallocates gradient budget through class-aware pruning on labeled data and confidence-based soft pruning on unlabeled data and provides theoretical guarantees that DyTrim reduces class bias and improves generalization.

Yue Cheng, Jia-Jun Zhang, Xiao-Hui Gao et al. · 1 citation
#artificial intelligence Preprint Sep 2026

Belted Engression: Sufficient Dimension Reduction for Generative Distributional Regression

Modern conditional generative models face significant challenges when learning complex covariate dependencies. While sufficient dimension reduction (SDR) provides a principled approach to compress these dependencies, traditional SDR frameworks were not formulated for conditional generation. To bridge this gap, we propo...

W. Tan, Bing Li, Ling-Zhou Xue · 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

Understanding and Exploiting Anisotropy in Post-Training

LLM post-training combines supervised fine-tuning (SFT), a mode-covering forward-KL objective, with reinforcement learning (RL), a mode-seeking reverse-KL objective, with reinforcement learning (RL), a mode-seeking reverse-KL objective to exploit anisotropy, a division of labor that post-training can exploit.

Samyak Jha, Harshvardhan Saini, Yi-Zhen Liao et al. · 0 citations

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