cs.CVAug 5, 2026

MAGIC-SSCIL: Manifold Anchoring and Geometric Incremental Calibration for Semi-Supervised Class Incremental Learning

Authors: Yousef AbdiMohammad AsadpourYousef Seyfari

Organizations: Faculty of Electrical and Computer Engineering, Universityof Tabriz, Tabriz, Iran · Faculty of Engineering, University of Maragheh, Maragheh,Iran

Abstract

Semi-supervised Class Incremental Learning (SSCIL) is a severe challenge for neural networks, and it is hardest in the exemplar-free setting where no past data may be stored. Existing methods forget catastrophically due to feature drift, and their pseudo-labels become increasingly unreliable as the label space grows. In this paper, we propose MAGIC (Manifold Anchoring and Geometric Incremental Calibration), a framework that stabilizes plasticity without storing exemplars. MAGIC's design centers on two components. The first is Soft-Weighted Geometry Calibration (SWGC), which uses graph-based label propagation on the learner's plastic feature space to weight and calibrate class means and variances computed on the frozen backbone; from these calibrated Gaussians, we sample phantom features that stand in for data from previous tasks. The second is a Geometric Structural Alignment (GSA) objective that preserves representation topology by matching the relational structure of student and teacher heads and aligning feature anchors with the fixed classifier prototypes, locking the orientation of the feature space. Together, these constraints keep the adapter from drifting, so geometric relations between classes remain stable as new classes arrive. We implement MAGIC with a frozen ResNet-18 backbone and a learnable plastic adapter. Across CIFAR-100, CUB-200, and ImageNet-R, at label ratios of 1%, 5%, and 10%, MAGIC improves average incremental accuracy over most of the supervised CIL methods equipped with FixMatch and native SSCIL baselines; the largest gains occur in the fine-grained, low-label setting, where confidence thresholding fails most clearly.

Explore similar work

Jun 2, 2026cs.CV

Weakly Supervised Incremental Segmentation via Semantic Anchors and Spatial Arbitration

Weakly Incremental Learning for Semantic Segmentation (WILSS) suffers from the continuous introduction of noisy supervision, which progressively corrupts class-level representations, leading to severe feature drift and semantic corruption, thereby causing newly learned classes to overwrite old ones. To address these issues, we propose a drift-resilient WILSS approach, named SASA, designed to stabilize semantic learning via Semantic Anchors and Spatial Arbitration. Specifically, at the representation level, we introduce semantic anchors of learnable tokens as rigid class-level references to preserve long-term semantic identity. Complementary to this, an elastic residual adaptation facilitates controlled, instance-specific refinement, ensuring a stable yet flexible learning trajectory. At the supervision level, we develop a Spatial Label Arbitration mechanism that performs geometry-aware decisions to directly filter unreliable signals and enforce a strict "one object, one class" constraint. By synergistically stabilizing representations and improving supervision reliability, SASA effectively mitigates feature drift under weak supervision. Extensive experiments on standard benchmarks demonstrate that our approach consistently outperforms existing state-of-the-art methods, particularly in challenging multi-step incremental settings. The code is available at https://github.com/ZhonggaiWang/SASA.
Zhonggai Wang, Kai Fang, Guangyu Gao
Jun 24, 2026cs.LG

Geometry-Anchored Transport Framework for Exemplar-Free Class-Incremental Learning

Exemplar-free class-incremental learning (EFCIL) requires stable decision boundaries within a shifting feature space. While maintaining class-conditional Gaussian statistics provides a principled classification strategy, these parametric summaries remain sensitive to anisotropic representation drift. Existing methods often transport these statistics across tasks using a decoupled, post-hoc paradigm: optimizing a backbone without explicit geometric constraints can distort the legacy manifold, limiting the precision of retroactive alignment. In this paper, we formulate feature transport as an endogenous training constraint rather than a separate post-task step, presenting the Geometry-Anchored Transport Framework. First, we derive an Analytic Geometric Anchor via Mahalanobis-aligned regression to mitigate macroscopic anisotropic drift. Second, we introduce a Topology-Aware Evolution objective that regularizes localized manifold degradation while calibrating a residual network against the analytic prior. By coupling manifold evolution with transport constraints during the primary training phase, our framework mitigates evaluation errors without requiring decoupled fine-tuning. Experiments across CIFAR-100, TinyImageNet, and ImageNet-100 demonstrate that the proposed framework consistently improves upon existing post-hoc alternatives under strict exemplar-free constraints.
Hongye Xu, Bartosz Krawczyk
Jul 20, 2026cs.CV

Miles: Metric Learning with Expandable Subspace for Pre-Trained Model-Based Class-Incremental Learning

Class Incremental Learning (CIL) aims to learn new concepts consistently from a data stream without forgetting. Unlike typical CIL methods which need to learn a model from scratch, pre-trained model (PTM) can easily adapt to a new task with fine-tuning. However, existing PTM-based CIL methods fail to achieve a trade-off between performance and computational expenditure, i.e., they either adopt the same parameter space so that leading catastrophic forgetting, or expand a new branch for each task but adding more computational cost. To this end, we propose MetrIc Learning with Expandable Subspace (Miles) to harness the prior information within pre-trained knowledge, thereby orchestrating an efficient expansion of the parameter space through guided optimization. Specifically, it decouples the learnable modules with the pre-trained model, exploiting prior information from intermediate features of the backbone network to enable more flexible parameter expansion. Then, a central loss is adopted to guide the new category to cluster towards the corresponding prototype in the new task subspace while incorporating an auxiliary distance regularization term to maintain metric equilibrium across tasks. Extensive experiments on six benchmark datasets demonstrate that Miles achieves state-of-the-art performance in various CIL settings.
Kai Jiang, Zisong Lin, Hongyuan Zhang +2