SPREAD: Subspace Representation Distillation for Lifelong Imitation Learning

• URL: http://arxiv.org/abs/2603.08763v1
• Date: Mon, 09 Mar 2026 03:38:42 GMT
• Title: SPREAD: Subspace Representation Distillation for Lifelong Imitation Learning
• Abstract summary: Key challenge in lifelong imitation learning is enabling agents to acquire new skills from expert demonstrations while retaining prior knowledge.<n>Existing distillation methods, which rely on L2-norm feature matching in raw feature space, are sensitive to noise and high-dimensional variability.<n>We introduce SPREAD, a geometry-preserving framework that employs singular value decomposition to align policy representations across tasks within low-rank subspaces.
• Score: 11.023696977257883
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A key challenge in lifelong imitation learning (LIL) is enabling agents to acquire new skills from expert demonstrations while retaining prior knowledge. This requires preserving the low-dimensional manifolds and geometric structures that underlie task representations across sequential learning. Existing distillation methods, which rely on L2-norm feature matching in raw feature space, are sensitive to noise and high-dimensional variability, often failing to preserve intrinsic task manifolds. To address this, we introduce SPREAD, a geometry-preserving framework that employs singular value decomposition (SVD) to align policy representations across tasks within low-rank subspaces. This alignment maintains the underlying geometry of multimodal features, facilitating stable transfer, robustness, and generalization. Additionally, we propose a confidence-guided distillation strategy that applies a Kullback-Leibler divergence loss restricted to the top-M most confident action samples, emphasizing reliable modes and improving optimization stability. Experiments on the LIBERO, lifelong imitation learning benchmark, show that SPREAD substantially improves knowledge transfer, mitigates catastrophic forgetting, and achieves state-of-the-art performance.

Related papers

• TASSO: TAsk-Specific Subspace Optimization for Continual Learning of Vision-Language Models [16.338978271294973]
  We introduce TASSO, a new paradigm that efficiently preserves the latent space geometry while ensuring network plasticity.<n>We achieve this with two complementary techniques: subspace learning and geometry-aware knowledge distillation.<n>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.
  arXiv  Detail & Related papers  (2026-08-21T12:18:14Z)
• MIITA: Memory-Induced Inference-Time Adaptation for Continual Learning with Small Language Models [64.2820121997882]
  MIITA is a Memory-Induced Inference-Time Adaptation framework for supervised CL under constrained storage.<n>It stores supervised experiences as compact correction-direction prototypes with semantic anchors, and retrieves them at inference time using semantic and uncertainty-based cues.<n>Experiments show that MIITA consistently improves final performance and mitigates forgetting under fixed memory budgets.
  arXiv  Detail & Related papers  (2026-05-20T03:03:04Z)
• Modular Continual Learning via Zero-Leakage Reconstruction Routing and Autonomous Task Discovery [0.9137554315375919]
  Catastrophic forgetting remains a primary hurdle in sequential task learning for artificial neural networks.<n>We propose a silicon-native modular architecture that achieves structural parameter isolation using Task-Specific Experts and a distributed, outlier-based Gatekeeper.
  arXiv  Detail & Related papers  (2026-04-15T19:48:40Z)
• Lifelong Imitation Learning with Multimodal Latent Replay and Incremental Adjustment [13.225857657465992]
  We introduce a lifelong imitation learning framework that enables continual policy refinement across sequential tasks.<n>Our approach departs from conventional experience replay by operating entirely in a multimodal latent space.<n>Our method achieves 10-17 point gains in AUC and up to 65% less forgetting compared to previous leading methods.
  arXiv  Detail & Related papers  (2026-03-11T16:13:19Z)
• Self-Consolidation for Self-Evolving Agents [51.94826934403236]
  Large language model (LLM) agents operate as static systems, lacking the ability to evolve through lifelong interaction.<n>We propose a novel self-evolving framework for LLM agents that introduces a complementary evolution mechanism.
  arXiv  Detail & Related papers  (2026-02-02T11:16:07Z)
• Beyond Retention: Orchestrating Structural Safety and Plasticity in Continual Learning for LLMs [2.5202137607634407]
  Experience Replay (ER) is a standard countermeasure against catastrophic forgetting.<n>ER causes negative transfer on fragile, structured domains like code generation.<n>We proposeOrthogonal Subspace Wake-up (OSW) as a mathematically grounded "safety guarantee" for established knowledge structures.
  arXiv  Detail & Related papers  (2026-01-26T08:28:02Z)
• Steering Vision-Language Pre-trained Models for Incremental Face Presentation Attack Detection [62.89126207012712]
  Face Presentation Attack Detection (PAD) demands incremental learning to combat spoofing tactics and domains.<n>Privacy regulations forbid retaining past data, necessitating rehearsal-free learning (RF-IL)
  arXiv  Detail & Related papers  (2025-12-22T04:30:11Z)
• Semi-Supervised Contrastive Learning with Orthonormal Prototypes [1.478364697333309]
  dimensional collapse, where embeddings converge into a lower-dimensional space, poses a significant challenge.<n>We propose CLOP, a novel semi-supervised loss function designed to prevent dimensional collapse by promoting the formation of linear subspaces among class embeddings.<n>We show that CLOP improves performance in image classification and object detection tasks while also exhibiting greater stability across different learning rates and batch sizes.
  arXiv  Detail & Related papers  (2025-11-27T13:26:59Z)
• SplitLoRA: Balancing Stability and Plasticity in Continual Learning Through Gradient Space Splitting [68.00007494819798]
  Continual learning requires a model to learn multiple tasks in sequence while maintaining both stability:preserving knowledge from previously learned tasks, and plasticity:effectively learning new tasks.<n> Gradient projection has emerged as an effective and popular paradigm in CL, where it partitions the gradient space of previously learned tasks into two subspaces.<n>New tasks are learned effectively within the minor subspace, thereby reducing interference with previously acquired knowledge.<n>Existing Gradient Projection methods struggle to achieve an optimal balance between plasticity and stability, as it is hard to appropriately partition the gradient space.
  arXiv  Detail & Related papers  (2025-05-28T13:57:56Z)
• SEFE: Superficial and Essential Forgetting Eliminator for Multimodal Continual Instruction Tuning [62.18315467642528]
  Multimodal Continual Instruction Tuning (MCIT) aims to enable Multimodal Large Language Models (MLLMs) to incrementally learn new tasks without catastrophic forgetting.<n>Superficial forgetting refers to cases where the model's knowledge may not be genuinely lost, but its responses to previous tasks deviate from expected formats.<n>By contrast, essential forgetting refers to situations where the model provides correctly formatted but factually inaccurate answers, indicating a true loss of knowledge.
  arXiv  Detail & Related papers  (2025-05-05T09:09:41Z)
• Enhancing Robustness of Vision-Language Models through Orthogonality Learning and Self-Regularization [77.62516752323207]
  We introduce an orthogonal fine-tuning method for efficiently fine-tuning pretrained weights and enabling enhanced robustness and generalization. A self-regularization strategy is further exploited to maintain the stability in terms of zero-shot generalization of VLMs, dubbed OrthSR. For the first time, we revisit the CLIP and CoOp with our method to effectively improve the model on few-shot image classficiation scenario.
  arXiv  Detail & Related papers  (2024-07-11T10:35:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.