RECAST: Reparameterized, Compact weight Adaptation for Sequential Tasks
Not on the map. Why?
Abstract (arXiv)
Incremental learning aims to adapt to new sets of categories over time with minimal computational overhead. Prior work often addresses this task by training efficient task-specific adaptors that modify frozen layer weights or features to capture relevant information without affecting predictions on previously learned categories. While these adaptors are generally more efficient than finetuning the entire network, they still require tens to hundreds of thousands of task-specific trainable parameters even for relatively small networks, making it challenging to operate on resource-constrained environments with high communication costs like edge devices or mobile phones. Thus, we propose Reparameterized, Compact weight Adaptation for Sequential Tasks (RECAST), a novel method that dramatically reduces task-specific trainable parameters to fewer than 50 - several orders of magnitude less than competing methods like LoRA. RECAST accomplishes this efficiency by learning to decompose layer weights into a soft parameter-sharing framework consisting of shared weight templates and very few module-specific scaling factors or coefficients. This soft parameter-sharing framework allows for effective task-wise reparameterization by tuning only these coefficients while keeping templates frozen.A key innovation of RECAST is the novel weight reconstruction pipeline called Neural Mimicry, which eliminates the need for pretraining from scratch. This allows for high-fidelity emulation of existing pretrained weights within our framework and provides quick adaptability to any model scale and architecture. Extensive experiments across six datasets demonstrate RECAST outperforms the state-of-the-art by up to 3% across various scales, architectures, and parameter spaces Moreover, we show that RECAST's architecture-agnostic nature allows for seamless integration with existing methods, further boosting performance.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 49 of its 66 references that are in the map. First posted on arXiv 25 Nov 2024.
Builds on
49 of 66 references.
References · 49
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
- 2015Distilling the Knowledge in a Neural Networkcited by 10,324
- 2021Emerging Properties in Self-Supervised Vision Transformerscited by 6,968
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
- 2016Learning without Forgettingcited by 2,496
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,333
- 2017Decoupled Weight Decay Regularizationcited by 1,831
- 2013Fine-Grained Visual Classification of Aircraftcited by 1,726
- 2017Continual Learning with Deep Generative Replaycited by 1,158
- 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,105
37 more
- 2018Efficient Lifelong Learning with A-GEMcited by 1,058
- 2016HyperNetworkscited by 1,027
- 2021Learning to Prompt for Continual Learningcited by 944
- 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 911
- 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 758
- 2022AdaptFormer: Adapting Vision Transformers for Scalable Visual Recognitioncited by 719
- 2017Lifelong Learning with Dynamically Expandable Networkscited by 694
- 2018Overcoming catastrophic forgetting with hard attention to the taskcited by 681
- 2019Gradient based sample selection for online continual learningcited by 571
- 2016Weight Normalization: A Simple Reparameterization to Accelerate Training of Deep Neural Networkscited by 543
- 2019GhostNet: More Features from Cheap Operationscited by 410
- 2017Variational Continual Learningcited by 339
- 2021DyTox: Transformers for Continual Learning with DYnamic TOken eXpansioncited by 291
- 2022S-Prompts Learning with Pre-trained Transformers: An Occam's Razor for Domain Incremental Learningcited by 246
- 2021New Insights on Reducing Abrupt Representation Change in Online Continual Learningcited by 219
- 2019Compacting, Picking and Growing for Unforgetting Continual Learningcited by 207
- 2024InfLoRA: Interference-Free Low-Rank Adaptation for Continual Learningcited by 198
- 2019Class-incremental Learning via Deep Model Consolidationcited by 173
- 2020Using Hindsight to Anchor Past Knowledge in Continual Learningcited by 161
- 2023HyperDiffusion: Generating Implicit Neural Fields with Weight-Space Diffusioncited by 152
- 2019Overcoming Catastrophic Forgetting with Unlabeled Data in the Wildcited by 111
- 2020Efficient Continual Learning with Modular Networks and Task-Driven Priorscited by 88
- 2021Continual Learning via Local Module Compositioncited by 63
- 2021Efficient Feature Transformations for Discriminative and Generative Continual Learningcited by 50
- 2024RoSA: Accurate Parameter-Efficient Fine-Tuning via Robust Adaptationcited by 48
- 2023MetaDiff: Meta-Learning with Conditional Diffusion for Few-Shot Learningcited by 40
- 2020Lifelong Learning of Compositional Structurescited by 35
- 2023Avalanche: A PyTorch Library for Deep Continual Learningcited by 33
- 2023MeLo: Low-rank Adaptation is Better than Fine-tuning for Medical Image Diagnosiscited by 33
- 2019Learning Implicitly Recurrent CNNs Through Parameter Sharingcited by 27
- 2021Continual Learning on Noisy Data Streams via Self-Purified Replaycited by 27
- 2020Neural Parameter Allocation Searchcited by 15
- 2022NeRN -- Learning Neural Representations for Neural Networkscited by 14
- 2024See Further for Parameter Efficient Fine-tuning by Standing on the Shoulders of Decompositioncited by 14
- 2024DiffLoRA: Generating Personalized Low-Rank Adaptation Weights with Diffusioncited by 12
- 2018Piggyback: Adapting a Single Network to Multiple Tasks by Learning to Mask Weightscited by 11
- 2023CLR: Channel-wise Lightweight Reprogramming for Continual Learningcited by 6
Built on by
Citing papers per year: 2026: 2.
2 papers.