Task Vector Descent: Learning from Non-IID Batches
Not on the map. Why?
Abstract (arXiv)
A central challenge in continual learning is to acquire new knowledge without forgetting what the model has already learned. This challenge appears in language model training when training data comes from various domain-, user-, or task-specific distributions that are encountered unevenly over time. In such settings, successive minibatches are temporally clustered by distribution instead of being sampled i.i.d. from the overall data mixture. Training on temporally clustered data induces a stability-plasticity tradeoff. Adapting the model to the active distribution can improve the model on the active distribution but may lead to a performance degradation on data it previously trained on. We find that this tradeoff intensifies with longer exposure to the same distribution. We therefore ask if the parameter displacement produced by such a sequence (the task vector) should be fully retained or applied partially. We compare applying the full displacement (λ=1) with partial integration, which scales the task vector by λ before applying it to the continuing model and scales the optimizer state by the same coefficient. Across continual pretraining, pretraining from random initialization, supervised post-training, and reinforcement post-training, we find that intermediate values of λ often improve average continuing-model performance relative to full integration, particularly after longer same-distribution sequences. In continual-pretraining experiments with both controlled streams and naturally defined adaptation sequences, task-vector scaling outperforms full integration at the matched learning rate, showing that its benefits are not reproduced by learning-rate scaling alone.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 54 of its 67 references that are in the map. First posted on arXiv 4 Oct 2026.
Builds on
54 of 67 references.
References · 54
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,379
- 2025Qwen3 Technical Reportcited by 8,820
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
- 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,944
- 2024Qwen2.5 Technical Reportcited by 4,942
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,897
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2021Program Synthesis with Large Language Modelscited by 3,637
- 2025DAPO: An Open-Source LLM Reinforcement Learning System at Scalecited by 2,810
38 more
- 2020The Pile: An 800GB Dataset of Diverse Text for Language Modelingcited by 2,411
- 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,396
- 2018Continual Lifelong Learning with Neural Networks: A Reviewcited by 1,330
- 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,209
- 2024Qwen2.5-Coder Technical Reportcited by 1,203
- 2022Editing Models with Task Arithmeticcited by 1,120
- 2018On First-Order Meta-Learning Algorithmscited by 1,018
- 2023TIES-Merging: Resolving Interference When Merging Modelscited by 818
- 2019Introduction to Online Convex Optimizationcited by 803
- 2021Robust fine-tuning of zero-shot modelscited by 797
- 2023MetaMath: Bootstrap Your Own Mathematical Questions for Large Language Modelscited by 735
- 2019Compressive Transformers for Long-Range Sequence Modellingcited by 726
- 2013An Empirical Investigation of Catastrophic Forgetting in Gradient-Based Neural Networkscited by 722
- 2023Language Models are Super Mario: Absorbing Abilities from Homologous Models as a Free Lunchcited by 694
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 637
- 2021Merging Models with Fisher-Weighted Averagingcited by 621
- 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 588
- 2022Git Re-Basin: Merging Models modulo Permutation Symmetriescited by 471
- 2019Lookahead Optimizer: k steps forward, 1 step backcited by 336
- 2026Reinforcement Learning via Self-Distillationcited by 332
- 2018Essentially No Barriers in Neural Network Energy Landscapecited by 330
- 2021The Role of Permutation Invariance in Linear Mode Connectivity of Neural Networkscited by 291
- 2020Understanding the Role of Training Regimes in Continual Learningcited by 180
- 2025RL's Razor: Why Online Reinforcement Learning Forgets Lesscited by 176
- 2022Fine-tuned Language Models are Continual Learnerscited by 156
- 2023HelpSteer: Multi-attribute Helpfulness Dataset for SteerLMcited by 142
- 2025REASONING GYM: Reasoning Environments for Reinforcement Learning with Verifiable Rewardscited by 130
- 2020A Theoretical Analysis of Catastrophic Forgetting through the NTK Overlap Matrixcited by 103
- 2024Revisiting Catastrophic Forgetting in Large Language Model Tuningcited by 99
- 2021Continual Learning in the Teacher-Student Setup: Impact of Task Similaritycited by 88
- 2021Online Continual Learning with Natural Distribution Shifts: An Empirical Study with Visual Datacited by 69
- 2022Two-stage LLM Fine-tuning with Less Specialization and More Generalizationcited by 41
- 2021What can linear interpolation of neural network loss landscapes tell us?cited by 28
- 2026Aligning Language Models from User Interactionscited by 28
- 2020Drinking from a Firehose: Continual Learning with Web-scale Natural Languagecited by 25
- 2023Investigating Forgetting in Pre-Trained Representations Through Continual Learningcited by 21
- 2025Forget About It: Mitigating Forgetting Without Replay or Auxiliary Objectivescited by 14
- 2025Learning on the Job: Test-Time Curricula for Targeted Reinforcement Learningcited by 9
50 most cited of 54 All 54 (JSON)
Built on by
Not cited yet.