Learning, Fast and Slow: Towards LLMs That Adapt Continually
summary
The gist
The gist Large language models (LLMs) can be adapted continually by introducing a fast-slow learning framework that separates task-specific information into fast weights and persistent general
In short
The paper introduces Fast-Slow Training (FST) to adapt Large Language Models continually. It separates task-specific information into 'fast' weights (optimized context/prompts) and 'slow' weights (persistent model parameters). FST is more sample-efficient, preserves plasticity against forgetting, and allows the model to learn new tasks on the fly while maintaining its general reasoning abilities.
Key concepts
- Slow Weights ($ heta$)
- These are the core parameters of the LLM that are expensive to update. They represent long-lived behaviors and general reasoning capabilities. In FST, these weights remain relatively stable, ensuring the model doesn't forget its foundational knowledge when adapting to new tasks.
- Fast Weights ($ ext{context/prompts}$ $\phi$)
- These are the lightweight components, such as prompts or context, that can be changed cheaply and rapidly. They absorb task-specific information and feedback immediately, allowing the model to adapt quickly without permanently altering the main model parameters.
- Fast-Slow Training (FST)
- This is a joint optimization method where slow weights are updated via reinforcement learning, while fast weights are optimized through reflective prompt evolution. This interleaving allows for rapid task adaptation while keeping the core model stable and preserving its general performance.
Terminology used across episodes
This episode discusses
- Learning, Fast and Slow: Towards LLMs That Adapt Continually · Paper Radio
- PromptWizard: Task-Aware Prompt Optimization Framework
- GEPA: Reflective Prompt Evolution Can Outperform Reinforcement Learning
- Prediction and Control in Continual Reinforcement Learning
- Using Fast Weights to Attend to the Recent Past
- Language Models are Few-Shot Learners
- Trace is the Next AutoDiff: Generative Optimization with Rich Feedback, Execution Traces, and LLMs
- The Entropy Mechanism of Reinforcement Learning for Reasoning Language Models
- RLPrompt: Optimizing Discrete Text Prompts with Reinforcement Learning
- Nemotron-Math: Efficient Long-Context Distillation of Mathematical Reasoning from Multi-Mode Supervision
- Scaling Laws for Reward Model Overoptimization
- EvoPrompt: Connecting LLMs with Evolutionary Algorithms Yields Powerful Prompt Optimizers
- Reinforcement Learning via Self-Distillation
- HoVer: A Dataset for Many-Hop Fact Extraction And Claim Verification
- Scaling Laws for Forgetting When Fine-Tuning Large Language Models
- The Art of Scaling Reinforcement Learning Compute for LLMs
- DSPy: Compiling Declarative Language Model Calls into Self-Improving Pipelines
- Tulu 3: Pushing Frontiers in Open Language Model Post-Training
- LANPO: Bootstrapping Language and Numerical Feedback for Reinforcement Learning in LLMs
- CodeI/O: Condensing Reasoning Patterns via Code Input-Output Prediction
- Mitigating the Alignment Tax of RLHF
The paper
Learning, Fast and Slow: Towards LLMs That Adapt Continually · Read on arXiv
Rishabh Tiwari, Kusha Sareen, Lakshya A Agrawal
UC Berkeley · Mila Montreal University · UT Austin
Large language models (LLMs) are trained for downstream tasks by updating their parameters (e.g., via RL). However, updating model parameters forces them to absorb task-specific information, which can result in catastrophic forgetting and loss of plasticity. In contrast, in-context learning with fixed LLM parameters can cheaply and rapidly adapt to task-specific requirements (e.g., prompt optimization), but cannot by itself typically match the performance gains available through updating LLM parameters. Inspired by how human learning works at multiple time scales (e.g., System 1 vs 2), we propose a fast-slow learning framework for LLMs, instantiated with model parameters as "slow" weights and optimized context as "fast" weights. These fast "weights" can learn from textual feedback to absorb the task-specific information, while allowing slow weights to stay closer to the base model and persist general reasoning behaviors. Fast-Slow Training (FST) is up to 3x more sample-efficient than only slow learning (RL) across reasoning tasks, while consistently reaching a higher performance asymptote. Moreover, FST-trained models remain closer to the base LLM (up to 70% less KL divergence), resulting in less catastrophic forgetting than RL-training. This reduced drift also preserves plasticity: after training on one task, FST trained models adapt more effectively to a subsequent task. In continual learning scenarios, where task domains change on the fly, FST continues to acquire each new task while RL stalls.
Transcript
Introduction to the show: ident: AI Radio. Generated commentary on the latest Artificial Intelligence papers.
Tom: I'm Tom.
Jane: And I'm Jane, here with Lu, Meng and our in-house large language model, Lalam.
Tom: Today's paper: "Learning, Fast and Slow: Towards LLMs That Adapt Continually".
Jane: The gist Large language models (LLMs) can be adapted continually by introducing a fast-slow learning framework that separates task-specific information into fast weights and persistent general behaviors into slow weights…
Tom: First, who's behind it and why it matters.
Title and authors: Tom: So, we're looking at this paper today, titled "Learning, Fast and Slow: Towards LLMs That Adapt Continually." It basically tackles the problem that when you train an AI model to do a new task using reinforcement learning, those parameters get permanently changed to absorb that task-specific information.
Jane: That's the core issue we've been talking about—parameter updates force them to absorb things, which leads to forgetting what they knew before and losing their general ability to learn new things. So this paper proposes separating those weights into two parts: slow weights and fast weights.
Lu: Exactly. They treat the model parameters as "slow" weights that are expensive to update, but they treat the context or prompts as "fast" weights that you can change cheaply and frequently without permanently altering the main model structure.
Meng: So if I understand correctly, this means we keep the core brain of the AI stable and general, but we have a separate mechanism to handle all the quick task-specific tweaks? That sounds like it could be useful for deployment where we don't want constant retraining of massive models.
Lalam: It seems they're suggesting that instead of just updating everything, we can distribute the learning signal across both types of weights so the model stays flexible.
The paper's summary: Tom: The paper introduces a fast-slow learning framework called Fast-Slow Training or FST, which jointly optimizes those slow weights through reinforcement learning and fast weights through something called reflective prompt evolution. It’s like they have two different training loops running at the same time.
Jane: They set up a system where the slow parametric component, which is the model weights denoted by theta, represents that expensive part of the model that usually encodes long-lived behavior and persists across tasks.
Lu: And then there's this fast textual component represented by phi, which are prompts and context. These can be changed cheaply and frequently to capture task-level adaptation without permanently modifying the model itself.
Meng: So the training mechanism involves cycles of slow-weight updates where they use reinforcement learning, while simultaneously optimizing the fast weights using this reflective optimization process on a pool of prompts. That sounds like a lot of coordination for what is supposed to be efficient.
Lalam: It’s structured in interleaved updates where the slow loop updates theta from just the scalar reward, and then the fast loop updates phi using that rollout's full text, including thoughts and errors. This allows both components to co-evolve during training.
The paper's improvements: Tom: Now for what they claim is better. They show that this approach is more sample efficient than just training with slow weights alone across reasoning tasks, reaching performance with substantially fewer samples and consistently hitting a higher performance ceiling.
Jane: That's a big deal because it means you get better results without needing massive amounts of data to force the slow weights to learn everything they need. They reach RL’s peak accuracy with fewer training samples.
Lu: And they also found that this method induces smaller slow-weight displacement, which means the model stays much closer to its original base policy, with up to seventy percent lower KL divergence compared to parameter-only trained models at the same reward level.
Meng: Smaller displacement sounds good for stability on production. Less drift away from the general knowledge base is definitely something you want when you're trying to maintain a stable model in use.
Lalam: The paper also shows that this fast-slow training preserves plasticity, meaning it adapts more effectively to subsequent tasks than models trained with only parameters, which prevents catastrophic forgetting.
Conclusion: Tom: So to wrap up on "Learning, Fast and Slow: Towards LLMs That Adapt Continually," FST suggests that post-training should be viewed as optimizing these two different adaptation channels together to get rapid task-specific gains while keeping the model general.
Jane: It essentially gives us a path toward methods that are more data efficient, less destructive, and better suited for continual learning because it lets the fast textual weights handle the immediate changes while the slow parametric weights maintain generality.
Lu: The mechanism is interesting because they show that the fast channel can extract task structure from just a handful of rollouts and inject it immediately through phi without needing many slow weight updates to start moving signal.
Meng: From an engineering standpoint, I'm interested in how this distributes the adaptation. They found that sometimes the fast weights dominate on some tasks, like HoVer-hard and CodeIO, but the slow weights carry most of the gain on math problems like Polaris.
Lalam: Overall, Fast-Slow Training is a way to get rapid task-specific improvements while preserving what we already have in terms of generality and plasticity. It's a way to handle adaptation that I think makes a lot more sense for real-world use cases.
More episodes
- 2604.03925-AdaptFuse: Training-Free Sequential Preference Inference via Externalized Bayesian Computation
- 2604.18344-DiffTSP: A Conditional Discrete Diffusion Model for Knowledge Graph Triple Set Prediction
- 2512.13399-Dual-Evolving Reinforcement Learning for Automated Reward Design
- 2512.22174-BitFlipScope: Scalable Fault Localization and Recovery for Bit-Flip Corruptions in LLMs
- 2601.07939-SECite: Analyzing and Summarizing Citations in Software Engineering Literature
- 2605.10337-CORTEG: Foundation Models Enable Cross-Modality Representation Transfer from Scalp to Intracranial Brain Recordings
- 2601.22449-Emergence of Physical Intelligence via Controllable Information Production
- 2602.01779-LingLanMedBench: A Unified Benchmark for Evaluating Large Language Models in Traditional Chinese Medicine
- 2602.08353-TKGB: A Comprehensive Benchmark for Temporal Knowledge Graph Forecasting
- 2603.00578-Draft-Thinking: Learning Efficient Reasoning in Long Chain-of-Thought LLMs