Long-tail class incremental learning (LT CIL) remains highly challenging because the scarcity of samples in tail classes not only hampers their learning but also exacerbates catastrophic forgetting under continuously evolving and imbalanced data distributions. To tackle these issues, we exploit the informativeness and scalability of language knowledge. Specifically, we analyze the LT CIL data distribution to guide large language models (LLMs) in generating a stratified language tree that hierarchically organizes semantic information from coarse to fine grained granularity. Building upon this structure, we introduce stratified adaptive language guidance, which leverages learnable weights to merge multi-scale semantic representations, thereby enabling dynamic supervisory adjustment for tail classes and alleviating the impact of data imbalance. Furthermore, we introduce stratified alignment language guidance, which exploits the structural stability of the language tree to constrain optimization and reinforce semantic visual alignment, thereby alleviating catastrophic forgetting. Extensive experiments on multiple benchmarks demonstrate that our method achieves state of the art performance.
Figures & tables
Fig. 1: Experiments were conducted on CIFAR100, imbalance rate ρ=0.01 and 10 tasks. We evaluated accuracy across head classes, tail classes, and the complete dataset to assess the influence of semantic information on LT-CIL.
Fig. 2: The overall framework of our method. A is the stratified language tree generation, B is the stratified adaptive language guidance, and C is the stratified alignment language guidance.
Fig. 3: Illustration of Prompt Template 2 and SL-Tree.
Method
CIFAR100
ImageNet-R
CUB200
ρ=0.1
ρ=0.01
ρ=0.1
ρ=0.01
ρ=0.1
Baseline
62.1
62.1
68.2
68.2
45.6
+ SL-Tree
62.5
62.5
69.0
69.0
47.9
+ Lcls
19.8
17.4
23.8
22.4
20.1
+ Lkd
64.7
60.9
69.5
65.8
46.4
+ Lalg
67.4
62.4
72.9
69.4
48.7
TABLE IV: Ablation study on different dataset with 10 tasks. + SL-Tree denotes taking the mean of all text features, while + updated α denotes using adaptive weights.
Fig. 4: Tail classes accuracy of different tasks on ImageNet-R, ρ=0.01 after 10 tasks.
Fig. 5: a) shows robustness of different LLMs and b) shows robustness of different prompt templates. All experiments were conducted on ImageNet-R with ρ=0.01 after 10 tasks.
Tasks
Method
Upper Bound
CLIP Zero-Shot
Adapter Fine-tuning
Ours
20
75.6
63.1
19.6
68.2
50
75.6
63.1
17.4
66.7
TABLE V: Experiments on ImageNet-LT.
Fig. 6: Density map of weights center. Experiments conducted on Imagenet-R, ρ=0.01 , and 10 tasks.
Fig. 7: Performance difference between two adjacent layers. Experiments conducted on Imagenet-R, ρ=0.01 , and 10 tasks.
Fig. 8: Effects on Tail Classes. Experiments conducted on Imagenet-R, ρ=0.01 , and 10 tasks.
Fig. 9: t-SNE visualization of different classes. Experiments conducted on ImageNet-R, ρ=0.01 , and 10 tasks. a) zero-shot; b) fine-tuned adapter; c) fine-tuned adapter with knowledge distillation (KD); d) fine-tuned adapter with KD and the proposed stratified alignment language guidance.
Fig. 10: Similarity heatmap of text featuress. Experiments conducted on ImageNet-R, ρ=0.01 , and 10 tasks, a) is the fixed text; b) duplicating the fixed text; c) is the mean of text from different layers of SL-Tree; d) is the linearly weighted text from different layers of SL-Tree.
Fig. 11: Experimental consumption. Experiments conducted on Imagenet-R, ρ=0.01 , and 10 tasks.
Fig. 12: Sensitivity analysis of hyperparameters. Experiments conducted on ImageNet-R, ρ=0.01 , and 10 tasks.
The task of Long-tailed Class Incremental Learning (LT-CIL) addresses the sequential learning of new classes from datasets with imbalanced class distributions. This scenario intensifies the fundamental problem of catastrophic forgetting, inherent to continual learning, with the dual challenges of under-learning minority classes and overfitting majority classes. To tackle these combined issues, this paper proposes two main techniques. First, we introduce gradient consistency regularization, which leverages the moving average of gradients to suppress abrupt fluctuations and stabilize the training process. Second, we dynamically adjust the weight of the distillation loss by measuring the degree of class imbalance with normalized entropy. This adaptive weighting establishes an optimal balance between retaining old knowledge and acquiring new information. Experiments on the CIFAR-100-LT, ImageNetSubset-LT, and Food101-LT benchmarks show that our method achieves consistent accuracy improvements of up to 5.0%. Furthermore, we demonstrate dramatic gains in the challenging 'In-ordered' setting, where tasks progress from majority to minority classes, highlighting our method's robustness in mitigating forgetting under unfavorable learning dynamics. This enhanced performance is achieved without a significant increase in computational overhead, demonstrating the practicality of our framework.
Taigo Sakai, Kazuhiro Hotta
Meijo University, 1-501 Shiogamaguchi, Tempaku-ku, Nagoya 468-8502, Japan
Prompt learning has emerged as an efficient alternative to fine-tuning pre-trained vision-language models (VLMs). Despite its promise, current methods still struggle to maintain tail-class discriminability when adapting to class-imbalanced datasets. In this work, we propose cluster-aware neural collapse prompt tuning (CPT), which enhances the discriminability of tail classes in prompt-tuned VLMs without sacrificing their overall generalization. First, we design a cluster-invariant space by mining semantic assignments from the pre-trained VLM and mapping them to prompt-tuned features. This computes cluster-level boundaries and restricts the constraints to local neighborhoods, which reduces interference with the global semantic structure of the pre-trained VLM. Second, we introduce neural-collapse-driven discriminability optimization with three losses: textual Equiangular Tight Frame (ETF) separation loss, class-wise convergence loss, and rotation stabilization loss. These losses work together to shape intra-cluster geometry for better inter-class separation and intra-class alignment. Extensive experiments on 11 diverse datasets demonstrate that CPT outperforms SOTA methods, with stronger performance on long-tail classes and good generalization to unseen classes.
Boyang Guo, Liang Li, Lin Peng +3
Hangzhou Dianzi University, Hangzhou, China · Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China · The Hong Kong Polytechnic University, Hong Kong, China +2
Class-Incremental Learning (CIL) enables models to learn new classes continually while preserving past knowledge. Recently, vision-language models like CLIP offer transferable features via multimodal pre-training, making them well-suited for CIL. However, real-world visual and linguistic concepts are inherently hierarchical: a textual concept like "dog" subsumes fine-grained categories such as "Labrador" and "Golden Retriever," and each category is associated with corresponding images. Nevertheless, existing CLIP-based CIL methods fail to explicitly capture this inherent hierarchy, leading to feature drift of fine-grained classes during incremental updates and ultimately to catastrophic forgetting. To address this challenge, we propose HASTEN (Hierarchical Semantic Tree Anchoring), a hierarchy-aware framework that uses semantic structure to stabilize CLIP-based CIL. Rather than treating classes as isolated labels, HASTEN leverages external hierarchical knowledge as structured supervision to organize visual and textual features in hyperbolic space, helping maintain parent--child relations as new tasks arrive and mitigating feature drift. Since the shared hyperbolic mapper is updated across tasks, we further stabilize it by constraining its updates to a null space induced by prior-task features, reducing interference with previous mappings while retaining adaptability to new classes. Extensive experiments on nine benchmarks show that HASTEN consistently outperforms existing methods while reducing feature drift and catastrophic forgetting. Code is available at: https://github.com/LAMDA-CL/NeurIPS2026-HASTEN.
Tao Hu, Lan Li, Zhen-Hao Xie +1
School of Artificial Intelligence, Nanjing University · State Key Laboratory for Novel Software Technology, Nanjing University