Preserving Foundational Capabilities in Flow-Matching VLAs through Conservative SFT
On the map: Vision-language-action models → Efficient VLA inference and adaptation
also in 1 more
Abstract (arXiv)
Unconstrained fine-tuning of flow-matching Vision-Language-Action (VLA) models drives dense parameter overwrites, degrading pre-trained capabilities. We present Conservative Supervised Fine-Tuning (ConSFT), an optimization objective that adapts to target distributions while mitigating catastrophic forgetting, requiring zero prior data or architectural overhead. By dynamically scaling learning signals based on model confidence, ConSFT suppresses excessive gradients from low-confidence samples to prevent disproportionate parameter updates, thereby bounding the intrinsic parameter disruption risk. Inspired by reinforcement learning's trust-region clipping, this formulation establishes a progressive learning dynamic to secure target convergence and prior capability retention, maintaining sparse parameter updates without relying on the parallel reference networks required by explicit regularization. We evaluate ConSFT on the LIBERO and RoboTwin benchmarks across state-of-the-art flow-matching VLAs (π0, π0.5, and GR00T-N1.6-3B). The method outperforms vanilla SFT in capability retention by an average absolute margin of over 20%, matching the efficacy of data-heavy Experience Replay in a prior-data-free regime. Real-world robotic deployments confirm that ConSFT precludes spatial overfitting during downstream adaptation, preserving pre-trained physical skills while acquiring sequential target tasks.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Placed in Efficient VLA inference and adaptation, one of 13 directions in Vision-language-action models. Builds on 32 of its 37 references that are in the map. First posted on arXiv 9 May 2026.
Builds on
32 of 37 references.
References · 32
- 2022Training language models to follow instructions with human feedbackcited by 15,971
- 2017Proximal Policy Optimization Algorithmscited by 15,215
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
- 2015Trust Region Policy Optimizationcited by 2,580
- 2016Learning without Forgettingcited by 2,496
- 2024π0: A Vision-Language-Action Flow Model for General Robot Controlcited by 2,407
- 2025π0.5: a Vision-Language-Action Model with Open-World Generalizationcited by 1,761
- 2023LIBERO: Benchmarking Knowledge Transfer for Lifelong Robot Learningcited by 1,410
- 2025GR00T N1: An Open Foundation Model for Generalist Humanoid Robotscited by 1,225
- 2018Experience Replay for Continual Learningcited by 1,095
- 2025SFT Memorizes, RL Generalizes: A Comparative Study of Foundation Model Post-trainingcited by 672
- 2023An Empirical Study of Catastrophic Forgetting in Large Language Models During Continual Fine-tuningcited by 639
20 more
- 2024LoRA Learns Less and Forgets Lesscited by 328
- 2024Continual Learning of Large Language Models: A Comprehensive Surveycited by 234
- 2025RL's Razor: Why Online Reinforcement Learning Forgets Lesscited by 176
- 2025RoboTwin: Dual-Arm Robot Benchmark with Generative Digital Twinscited by 121
- 2026A Pragmatic VLA Foundation Modelcited by 103
- 2025Flow Matching Policy Gradientscited by 99
- 2025ReinFlow: Fine-tuning Flow Matching Policy with Online Reinforcement Learningcited by 97
- 2025Soft Adaptive Policy Optimizationcited by 96
- 2025Actions as Language: Fine-Tuning VLMs into VLAs Without Catastrophic Forgettingcited by 58
- 2025Reinforcement Fine-Tuning Naturally Mitigates Forgetting in Continual Post-Trainingcited by 47
- 2026Pretrained Vision-Language-Action Models are Surprisingly Resistant to Forgetting in Continual Learningcited by 17
- 2026Simple Recipe Works: Vision-Language-Action Models are Natural Continual Learners with Reinforcement Learningcited by 17
- 2026Flow Policy Gradients for Robot Controlcited by 16
- 2025Reinforcement Learning for Flow-Matching Policiescited by 15
- 2026Mechanistic Analysis of Catastrophic Forgetting in Large Language Models During Continual Fine-tuningcited by 14
- 2026Towards Long-Lived Robots: Continual Learning VLA Models via Reinforcement Fine-Tuningcited by 13
- 2026Safety Alignment as Continual Learning: Mitigating the Alignment Tax via Orthogonal Gradient Projectioncited by 6
- 2025Beyond Reasoning Gains: Mitigating General-Capability Forgetting in Large Reasoning Modelscited by 5
- 2025A Comparative Analysis of LLM Adaptation: SFT, LoRA, and ICL in Data-Scarce Scenarioscited by 4
- 2026Robust Policy Optimization to Prevent Catastrophic Forgettingcited by 3
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2025Reinforcement Fine-Tuning of Flow-Matching Policies for Vision-Language-Action Models
- 2026FlowPRO: Reward-Free Reinforced Fine-Tuning of Flow-Matching VLAs via Proximalized Preference Optimization
- 2025π_textttRL: Online RL Fine-tuning for Flow-based Vision-Language-Action Models
- 2026Decoupled Early Exits for Task-Dependent Compute Allocation in Flow-Matching VLAs
- 2026Q-VGM: Q-Guided Value-Gradient Matching for Offline-to-Online RL of Flow-Matching VLA Policies
- 2026SnapFlow: One-Step Action Generation for Flow-Matching VLAs via Progressive Self-Distillation
- 2025Balancing Signal and Variance: Adaptive Offline RL Post-Training for VLA Flow Models
- 2026Fewer Steps, Better Actions: Rethinking Flow-Matching Inference for VLA Policies