The paper introduces LSA-PAST, a parameter‑efficient approach for compositional incremental learning that addresses the challenge of learning new state‑object compositions while preserving knowledge of previously seen compositions. It combines Layer‑Specific Adaptation using Low‑Rank Adaptation (LoRA) with depth‑specialized adapters for states, objects, and compositions, and employs Prototype‑Anchored Adapter‑Space Transport (PAST) to map past prototypes into the current adapter space without rehearsal. Experiments show that LSA-PAST achieves state‑of‑the‑art accuracy‑forgetting trade‑off performance in this setting.
arXiv:2511. 11421v2 Announce Type: replace-cross Abstract: Class-Incremental Learning (CIL) aims to continually learn new categories without forgetting previously acquired knowledge.
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...
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.
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...
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.
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.
arXiv:2609.36759v1 Announce Type: cross Abstract: Benefiting from transferable visual-textual alignment, CLIP has been widely adopted for class-incremental learning (CIL). However, existing learners...
The paper introduces PromptCCZSL, a framework that enables vision‑language models to continually learn new attributes, objects, and their unique compositions while avoiding forgetting. It uses a frozen VLM backbone with prompt‑based techniques, recency‑weighted multi‑teacher distillation, and several loss functions (CAL, OPL, IDL) to maintain prior knowledge and promote diverse, distinct embeddings. Experiments on UT‑Zappos and C‑GQA show significant performance gains over existing VLM‑based and non‑VLM baselines, establishing a new benchmark for continual compositional zero‑shot learning.
Dynamic expansion methods for class-incremental learning (CIL) protect task-specific knowledge by growing dedicated tokens or subnetworks, yet our analyses suggest that classification supervision alone does not sufficiently preserve task-agnostic shared backbone representations over long incremental sequences. We identify two intertwined challenges: cross-task confusion from sequential training on predominantly current-task data, which biases decision boundaries toward recent tasks; and under-optimized shared representations in the backbone that cap long-term discriminability as tasks accumulate.
arXiv:2606. 05695v1 Announce Type: new Abstract: Exemplar-free class-incremental learning (EFCIL) aims to acquire new classes over time without storing raw data.
arXiv:2607. 22994v1 Announce Type: cross Abstract: Class-incremental learning (CIL) requires models to continuously acquire new knowledge while avoiding catastrophic forgetting.
arXiv:2606. 29465v1 Announce Type: new Abstract: Class-incremental learning requires a model to learn new classes while preserving decision regions for old ones.