Value as Memory: Online Value-Guided Post-training for General Robot Policies
summary
The gist
The gist The Value as Memory (VaM) framework addresses challenges in real-world post-training for generalist robot policies by using value caching and online reinforcement learning to mitigate
In short
Value as Memory (VaM) is a framework for improving generalist robot policies post-training by using value caching and online reinforcement learning. It solves two problems: action ambiguity due to partial observability and slow feedback from offline training. VaM uses recent value predictions as task memory to guide actions, enabling faster, more sample-efficient adaptation in the real world.
Key concepts
- Value Prediction
- The system learns a function that estimates the expected total reward for a given situation. This prediction is used to calculate an advantage estimate, which helps determine how much better a current action is compared to the expected outcome, guiding policy improvements.
- Value Caching
- This technique uses recent value predictions as 'task-progress memory' to condition actions. By incorporating this memory into the policy input, the system can better distinguish between visually similar states that require different behaviors, reducing ambiguity caused by partial observability.
- Online RL Framework
- VaM employs a hybrid training scheme combining offline data, off-policy trajectories, and on-policy rollouts. This allows the policy and value models to adapt jointly and quickly in the real world. The training progresses from offline warmup to autonomous learning using sparse rewards.
- Sample Efficiency Enhancement
- VaM significantly improves learning speed by running data collection, value training, and action training concurrently. This concurrent approach reduces the experimental time per gradient step by over 57%, making the online policy updates much more sample-efficient than traditional offline RL methods.
Terminology used across episodes
This episode discusses
- Value as Memory: Online Value-Guided Post-training for General Robot Policies · Paper Radio
- pi 0.5: a Vision-Language-Action Model with Open-World Generalization
- pi RL: Online RL Fine-tuning for Flow-based Vision-Language-Action Models
- Diffusion Guidance Is a Controllable Policy Improvement Operator
- GigaBrain-0.5M*: a VLA That Learns From World Model-Based Reinforcement Learning
- Classifier-Free Diffusion Guidance
- GR-RL: Going Dexterous and Precise for Long-Horizon Robotic Manipulation
- STEAM: Self-Supervised Temporal Ensemble Advantage Modeling for Real-World Robot Learning · Paper Radio
- AWAC: Accelerating Online Reinforcement Learning with Offline Datasets
- SOP: A Scalable Online Post-Training System for Vision-Language-Action Models
- Advantage-Weighted Regression: Simple and Scalable Off-Policy Reinforcement Learning
- pi* 0.6: a VLA That Learns From Experience
- MEM: Multi-Scale Embodied Memory for Vision Language Action Models
- Learning While Deploying: Fleet-Scale Reinforcement Learning for Generalist Robot Policies · Paper Radio
- chi 0: Resource-Aware Robust Manipulation via Taming Distributional Inconsistencies
The paper
Value as Memory: Online Value-Guided Post-training for General Robot Policies · Read on arXiv
Wenye Yu, Yijin Chen, Kaiyi Xiong, Wenbo Han, Wendi Chen, Yang Jin Han Xue Jun Lv Cewu Lu Chuan Wen
Shanghai Jiao Tong University · Shanghai Innovation Institute 3 Noematrix Ltd.
Transcript
Introduction to the show: ident: Robotics Radio. Generated commentary on the latest robotics and control papers.
Rosa: Today's paper: "Value as Memory".
Dev: The gist The Value as Memory (VaM) framework addresses challenges in real-world post-training for generalist robot policies by using value caching and online reinforcement learning to mitigate partial observability and…
Rosa: First, who's behind it and why it matters.
Title and authors: Rosa: So we're looking at this paper called "Value as Memory: Online Value-Guided Post-training for General Robot Policies." It sounds like it tackles the problem of training robots in the real world after they've been trained in simulation or offline data.
Dev: Yeah, and the authors are Yu, Chen, Xiong, Han, Chen again. The title really tells you what it’s about: using value as memory to guide online learning for general robot policies.
Rosa: Basically, it’s tackling those two big headaches in real-world post-training: partial observability makes picking actions ambiguous and offline methods delay getting feedback from actual deployment experience.
Dev: Exactly. And this paper proposes Value as Memory, which uses value caching and online reinforcement learning to fix both of those issues by combining offline demonstrations, off-policy data, and on-policy rollouts for sample-efficient adaptation.
The paper's summary: Rosa: So the summary says that VaM introduces value caching where actions are conditioned on recent value predictions as task progress memory. This is supposed to help the system distinguish between states that need different actions, even if they look visually similar because it tells you whether estimated progress improves, stalls, or declines.
Dev: It's like giving the robot a kind of short-term memory about how well it’s actually doing on the task. And then they use this to calculate an advantage estimate using that cached value function to help improve the policy in real time.
Rosa: The system moves from just offline RL warmup into online autonomous learning with sparse rewards, which is a big deal because it means the robot can actually learn complex, long-horizon tasks without needing a ton of dense reward signals.
Dev: The core idea is this hybrid training data scheme—combining offline demonstrations, off-policy trajectories, and current on-policy rollouts—which lets them jointly adapt the policy and value models with high sample efficiency.
The paper's improvements: Rosa: The paper highlights a few key improvements for VaM. First, it shows that value caching helps reduce the representation-induced lower bound on policy prediction error by defining a difference between action distributions as epsilon p, which suggests because epsilon p is greater than or equal to epsilon obs, the value cache can weaken that aliasing lower bound by making two states easier to separate.
Dev: That means it makes distinguishing those tricky states much more effective. Then they show that across long-horizon tasks involving deformable objects and contact-rich manipulation, VaM gets a mean absolute success-rate gain of twenty-nine point four percent with value caching, and a thirty-two point eight percent gain with online autonomous learning over matched offline training <ref:2610.22368#pg1,across long-horizon tasks involving deformable objects and contact-rich manipulation, VaM>.
Rosa: And the speed is impressive too; the evaluated online schedule performs eight times as many policy iterations under the same gradient-step budget, and they recorded more than two times lower time per gradient step when data collection and training were happening at the same time.
Dev: It’s about making real-time adaptation much faster, which is crucial for safety in deployment scenarios. But they also have a limitation to mention: this framework depends on a value function that closely tracks actual task progress, so they need that offline RL warmup phase to keep things stable before the online learning starts.
Conclusion: Rosa: So, to wrap up, the paper on "Value as Memory: Online Value-Guided Post-training for General Robot Policies" shows how value caching can support progress-aware recovery by showing more progress-ordered PCA trajectories and recovering from stuck states in qualitative comparisons on tasks like Laundry Folding and Magnetic Bus Assembly.
Dev: It’s about using that memory to give the robot a better sense of where it is on the task, which leads to more robust behavior under partial observability. The results show a significant improvement in success rates over long-horizon manipulation tasks compared to just offline training alone.
Rosa: And they show that when you run data collection, value training, and action training concurrently, you cut down the mean experimental time per gradient step by fifty-seven point eight percent across all tasks. It’s about making closed-loop policy updates much more efficient in practice.
Dev: So for someone listening who just cares about the practical application, this paper means we can transition from a slow offline training process directly into online learning with sparse rewards, and it does that faster than before.
Taro: From my side, I’m interested in how it handles the world misbehaving scenarios when it's already in deployment; specifically how that value caching helps with progress-aware recovery when things get stuck.
Rosa: That’s a good point, Taro, because those qualitative results on stuck states are really important for real-world reliability.
Dev: And from a control loop standpoint, the speed gains you mentioned—the eight times more policy iterations—means we have much lower latency in getting corrections applied to the robot's actions.
Taro: I just want to make sure that this reliance on a value function closely tracking actual progress doesn't introduce instability when the robot encounters something completely unexpected during those online updates.
More episodes
- 2610.21999-VP-EVT: Active Visibility Preservation for Embodied Visual Tracking
- 2610.22092-Onboard Lightweight LLM Reasoning for Human-Aware Safe UAV Navigation
- 2610.20900-Co-designing a Layered Control Architecture
- 2610.21621-SPEAR: Selective Preference Elicitation with Adaptive Rewards for VLM-Guided Robotic Manipulation
- 2610.21741-Comfortably Stuck: Evaluation Pitfalls in Bench2Drive's Closed-Loop Protocol
- 2610.21686-MAIA: Anticipating Interaction Anomalies in Contact-Rich Manipulation via Multimodal World Models
- 2610.20787-Electrical Power Grid Reliability Assessment Exposed to Straight Line Winds
- 2610.21823-Time-Optimal Ergodic Retrieval
- 2610.21915-What Should Robot Policies Learn to Predict? Rethinking Supervision Targets in Vision-Language-Action Learning
- 2610.21939-De-Risking Robotic Welding for In-Space Metal Joining Through Physics-Grounded Digital Twins