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:2606. 05675v1 Announce Type: new Abstract: Continual learning (CL) seeks models that acquire new skills without erasing prior knowledge.
The paper introduces Skill Schema Transport (SST), a post‑training framework that mitigates catastrophic forgetting in continual domain adaptation by translating new domain knowledge into a model’s existing skill space. SST abstracts each example type into a reusable skill schema, preserving essential operations while removing domain‑specific surface forms, thereby turning knowledge updates into procedural reuse rather than trajectory memorization. Experiments on two 3B instruction‑tuned backbones show that SST consistently reduces forgetting and improves generalization, achieving up to a 5.75‑point performance gain and a dramatic drop in maximum forgetting from 42.41 to 7.10 points on the Qwen‑3B MATH stream.
The paper addresses the conflict between generalization and continuous adaptation in few‑shot and continual learning. It proposes a Complementary Learning System (CLS) that separates a fast Short‑Term Memory (STM) for memorizing recent inputs from a slow Long‑Term Memory (LTM) that provides robust, generalized perceptions. Experiments on image classification show the CLS model resists forgetting in domain‑incremental continual learning and outperforms other continual learners in few‑shot settings, though overall accuracy is slightly lower than some existing methods.
arXiv:2607. 17944v1 Announce Type: cross Abstract: We introduce CMP (Cognitive Memory Primitive), an architecture that represents inputs as sparse relational codes, stores them in a two-tier competitive memory, and learns entirely through local, gradient-free updates, with no backpropagation anywhere in the network.
arXiv:2606. 02860v1 Announce Type: cross Abstract: Catastrophic forgetting is often framed as a representational problem: after sequential training, a model appears to lose the features that supported performance on earlier tasks.
arXiv:2608. 11690v1 Announce Type: new Abstract: Continual learning must absorb new tasks without erasing old ones, and replay---mixing a small buffer of past examples into current training---is among the most effective remedies for catastrophic forgetting.
arXiv:2607. 22994v1 Announce Type: cross Abstract: Class-incremental learning (CIL) requires models to continuously acquire new knowledge while avoiding catastrophic forgetting.
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...
arXiv:2603. 11201v3 Announce Type: replace-cross Abstract: The world is inherently dynamic, and continual learning aims to enable models to adapt to ever-evolving data streams.
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:2601. 22012v3 Announce Type: replace Abstract: Catastrophic forgetting in continual learning is often measured at the performance or last-layer representation level, overlooking the underlying mechanisms.
arXiv:2610.32799v1 Announce Type: new Abstract: Replay-based Continual Learning mitigates catastrophic forgetting by keeping a buffer of past samples, making buffer composition critical under a fixed...