mlsanityData to 7 Oct 2026

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

arXiv 2607.22931 ↗First posted 24 Jul 2026cs.LG cs.CVcited by 0

Not on the map. Why?

Abstract (arXiv)

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 (L2) 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.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 25 of its 35 references that are in the map. First posted on arXiv 24 Jul 2026.

Builds on

25 of 35 references.

References · 25

  1. 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
  2. 2017Progressive Growing of GANs for Improved Quality, Stability, and Variationcited by 2,967
  3. 2019Class-Balanced Loss Based on Effective Number of Samplescited by 1,239
  4. 2019Learning Imbalanced Datasets with Label-Distribution-Aware Margin Losscited by 987
  5. 2021Learning to Prompt for Continual Learningcited by 938
  6. 2019Decoupling Representation and Classifier for Long-Tailed Recognitioncited by 806
  7. 2019Large Scale Incremental Learningcited by 727
  8. 2021Understanding Dimensional Collapse in Contrastive Self-supervised Learningcited by 374
  9. 2021Gradient Projection Memory for Continual Learningcited by 338
  10. 2023RanPAC: Random Projections and Pre-trained Models for Continual Learningcited by 162
  11. 2019Implicit Semantic Data Augmentation for Deep Networkscited by 106
  12. 2019Lifelong Machine Learning with Deep Streaming Linear Discriminant Analysiscited by 91
13 more
  1. 2023FeCAM: Exploiting the Heterogeneity of Class Distributions in Exemplar-Free Continual Learningcited by 86
  2. 2020Imbalanced Continual Learning with Partitioning Reservoir Samplingcited by 71
  3. 2022ACIL: Analytic Class-Incremental Learning with Absolute Memorization and Privacy Protectioncited by 56
  4. 2022A Simple Baseline that Questions the Use of Pretrained-Models in Continual Learningcited by 54
  5. 2022Long-Tailed Class Incremental Learningcited by 36
  6. 2024GACL: Exemplar-Free Generalized Analytic Continual Learningcited by 22
  7. 2024Continual Learning Using a Kernel-Based Method Over Foundation Modelscited by 13
  8. 2024AIR: Analytic Imbalance Rectifier for Continual Learningcited by 7
  9. 2024Preserving Generalization of Language models in Few-shot Continual Relation Extractioncited by 7
  10. 2025AnaCP: Toward Upper-Bound Continual Learning via Analytic Contrastive Projectioncited by 7
  11. 2024Leveraging Hierarchical Taxonomies in Prompt-based Continual Learningcited by 3
  12. 2022An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learningcited by 2
  13. 2025Few-Shot, No Problem: Descriptive Continual Relation Extractioncited by 2

Built on by

Not cited yet.