TASSO, a new paradigm that efficiently preserves the latent space geometry while ensuring network plasticity, is introduced with two complementary techniques: subspace learning and geometry-aware knowledge distillation.
Abstract
Vision-Language Models (VLMs) exhibit strong zero-shot capabilities, making them an attractive solution for continual learning across diverse tasks. However, during continual adaptation, both catastrophic forgetting and zero-shot degradation occur, severely degrading performance. In this paper, we introduce TASSO, a new paradigm that efficiently preserves the latent space geometry while ensuring network plasticity. We achieve this with two complementary techniques: subspace learning and geometry-aware knowledge distillation. Specifically, we first learn a sequence of task-specific low-rank projectors, which we use to project the latent representations before optimizing cross-entropy. Secondly, we employ a geodesic-distance-based loss that distills knowledge from the previous-task model while effectively preserving the latent space geometry. These design choices not only avoid unnecessary parameter updates along the full embedding dimensions but also improve learning by focusing on task-specific manifolds. Moreover, the geometry-aware distillation provides strong regularization and significantly reduces both catastrophic forgetting and zero-shot degradation throughout the continual learning sequence. Experimental results with the CLIP vision language model in the multi-domain task incremental and class incremental learning benchmarks demonstrate clear improvements over state-of-the-art methods in mitigating forgetting and preserving zero-shot capabilities.
This work observes that pooled token embeddings from a frozen LLM embedding layer already separate task distributions throughout the learning sequence, and concludes that a Gaussian mixture model fitted on these embeddings, without any gradient-based training, is sufficient for task-agnostic adapter selection at test t...
Experiments show that FiUni can effectively infer latent batch-level task affiliations and achieve competitive performance against advanced task-aware CL methods with fewer trainable parameters.
Dezheng Han, Anlan Zhang, Zhiwu Zhu et al.· 0 citations
PRiSM is introduced, a class-prototype regularization that can be deployed as a plug and play module on top of any existing baseline method, significantly improving performances and introducing a more realistic benchmark that varies both the levels of class balance and the effective number of classes in few-shot tasks...
Ghassen Baklouti, Omprakash Chakraborty, J. Dolz et al.· arXiv.org· 0 citations
This work investigates catastrophic forgetting in continual SSL from an explicitly geometric perspective, moving beyond downstream linear probe accuracy to characterize the evolution of the representation space directly and inform the development of novel methods that specifically preserve the embedding space geometry.
This work proposes a task-specific pruning pipeline, named Cut-ViT, which first construct gram anchoring matrices from both spatial and semantic perspectives, and performs the subspace decomposition to extract the corresponding subspace bases.
Jianjian Yin, Liulei Li, Tao Chen et al.· 1 citation
Chunked Muon (CMuon) is introduced, a simple yet highly effective strategy that partitions these matrices into independent sub-components prior to orthogonalization, effectively overcoming the late-stage convergence plateaus of vanilla Muon.
Chu-Yan Chen, Peng Sun, Kun Yuan· 2 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.