arXiv:2511. 11421v2 Announce Type: replace-cross Abstract: Class-Incremental Learning (CIL) aims to continually learn new categories without forgetting previously acquired knowledge.
By Lan Li, Tao Hu, Da-Wei Zhou, Jia-Qi Yang, Han-Jia Ye, De-Chuan Zhan
arXiv:2608.31096v1 Announce Type: cross
Abstract: Class-incremental learning (CIL) requires a model to incrementally learn tasks that contain new classes without accessing earlier training data while...
By Yunxiang Fu, Meng Lou, Yizhou Yu
C-LoRA introduces a continual learning approach for pre‑trained visual models that uses a single shared Low‑Rank Adaptation (LoRA) adapter. It employs a learnable routing matrix split into a stability component (R_base) and a plasticity component (R_delta) to balance preserving past knowledge and adapting to new tasks. This design eliminates the need for expanding modules or complex inference fusion while maintaining competitive performance on multiple benchmarks.
By Xin Zhang, Liang Bai, Xian Yang
arXiv:2607.01630v2 Announce Type: replace
Abstract: Dynamic expansion methods for class-incremental learning (CIL) protect task-specific knowledge by growing dedicated tokens or subnetworks, yet our...
By Bingchen Huang, Yifu Chen, Zhiling Wang, Yuanchao Du
The paper introduces HASTEN, a hierarchical semantic tree anchoring framework that enhances CLIP-based class‑incremental learning by incorporating external hierarchical knowledge into hyperbolic space. By treating classes as part of a structured hierarchy rather than isolated labels, HASTEN stabilizes visual and textual feature mappings, reduces feature drift, and mitigates catastrophic forgetting across incremental tasks. Experiments on nine benchmarks demonstrate that HASTEN consistently outperforms existing methods.
By Tao Hu, Lan Li, Zhen-Hao Xie, Da-Wei Zhou
The paper proposes a drift‑adaptive method for Domain‑Incremental Learning that tracks representation drift for each past domain‑class pair. By measuring how much a concept’s current representation deviates from a fixed anchor, the method assigns stronger preservation to high‑drift pairs and down‑weights highly drifted domains during prototype construction. Experiments on DomainNet, Office‑Home, CORe50, and CDDB‑Hard show that this approach maintains a strong accuracy‑forgetting balance while using less training memory and the smallest storage compared to other methods.
By Hyunmin Kong, Gyutae Oh, Jitae Shin