Papers
arxiv:2610.18596

ACCRUE: Continual Off-Policy Reinforcement Learning for Robot Foundation Models

Published on Oct 13
ยท Submitted by
changyeon kim
on Oct 14
ยท nvidia NVIDIA
Authors:
,
,

Abstract

Reinforcement learning (RL) post-training improves robot foundation models (RFMs) beyond their demonstrations, but real-world deployment demands more: learning new tasks efficiently while retaining previously acquired behaviors. Existing continual RL methods on top of VLAs mitigate forgetting but rely on on-policy updates with limited forward transfer, whereas off-policy methods improve single-task sample efficiency without addressing learner persistence across tasks. We propose ACCRUE, a continual off-policy RL framework that carries lightweight actor and critic networks across tasks, allowing each stage to reuse behavioral and value knowledge acquired through prior RL. The inherited critic adapts only on current-task transitions and guides current-task actor learning, while prior behavior is preserved by distilling the actor toward cached targets on a small number of retained episodes. Fixed visual features keep the inherited learner and its replay compatible with base-policy updates. Across contact-rich assembly sequences in simulation and on real-robot hardware, ACCRUE accelerates subsequent-task learning with near-zero forgetting and significantly reduces real-robot training time by 31.0\% to 68.5\%.

Community

Paper author Paper submitter

๐Ÿค– ๐—ฅ๐—ฒ๐—ฎ๐—น-๐—ฟ๐—ผ๐—ฏ๐—ผ๐˜ ๐—ฅ๐—Ÿ. ๐—™๐—ฒ๐˜„ ๐—ฑ๐—ฒ๐—บ๐—ผ๐—ป๐˜€๐˜๐—ฟ๐—ฎ๐˜๐—ถ๐—ผ๐—ป๐˜€. ๐—ก๐—ฒ๐˜„ ๐˜€๐—ธ๐—ถ๐—น๐—น๐˜€ ๐—ถ๐—ป ๐—บ๐—ถ๐—ป๐˜‚๐˜๐—ฒ๐˜€.

Introducing ๐—”๐—–๐—–๐—ฅ๐—จ๐—˜: Continual Off-Policy Reinforcement Learning for Robot Foundation Models.

We improve robot foundation model behavior with RL and carry that experience across tasks, helping robots ๐—น๐—ฒ๐—ฎ๐—ฟ๐—ป ๐—ณ๐—ฎ๐˜€๐˜๐—ฒ๐—ฟ ๐˜„๐—ต๐—ถ๐—น๐—ฒ ๐—ฟ๐—ฒ๐˜๐—ฎ๐—ถ๐—ป๐—ถ๐—ป๐—ด ๐—ฒ๐—ฎ๐—ฟ๐—น๐—ถ๐—ฒ๐—ฟ ๐˜€๐—ธ๐—ถ๐—น๐—น๐˜€.

๐Ÿฆพ ๐—Ÿ๐—ฒ๐—ฎ๐—ฟ๐—ป๐—ถ๐—ป๐—ด ๐—ฑ๐—ถ๐—ฟ๐—ฒ๐—ฐ๐˜๐—น๐˜† ๐—ถ๐—ป ๐˜๐—ต๐—ฒ ๐—ฟ๐—ฒ๐—ฎ๐—น ๐˜„๐—ผ๐—ฟ๐—น๐—ฑ
For our real-world policies, all RL interaction comes from the physical robot. Each task starts with ๐—ฎ ๐˜€๐—บ๐—ฎ๐—น๐—น ๐˜€๐—ฒ๐˜ ๐—ผ๐—ณ ๐—ฑ๐—ฒ๐—บ๐—ผ๐—ป๐˜€๐˜๐—ฟ๐—ฎ๐˜๐—ถ๐—ผ๐—ป๐˜€ to fine-tune the foundation model.

๐Ÿ’ป ๐—Ÿ๐—ผ๐˜„ ๐—ฎ๐—ฑ๐—ฑ๐—ถ๐˜๐—ถ๐—ผ๐—ป๐—ฎ๐—น ๐—š๐—ฃ๐—จ ๐˜๐—ฟ๐—ฎ๐—ถ๐—ป๐—ถ๐—ป๐—ด ๐—ผ๐˜ƒ๐—ฒ๐—ฟ๐—ต๐—ฒ๐—ฎ๐—ฑ
During RL, the foundation model stays frozen. Only a compact actorโ€“critic is updated to refine its reference actions.

๐Ÿง  ๐— ๐—ฎ๐—ธ๐—ฒ ๐˜๐—ต๐—ฒ ๐—ฒ๐˜…๐—ฝ๐—ฒ๐—ฟ๐—ถ๐—ฒ๐—ป๐—ฐ๐—ฒ ๐—ฐ๐—ผ๐—ป๐˜๐—ถ๐—ป๐˜‚๐—ฎ๐—น
We inherit that actorโ€“critic for the next task and distill earlier behavior on a small fraction of prior-task replay.

โฑ๏ธ ๐—ก๐—ฒ๐˜„ ๐˜€๐—ธ๐—ถ๐—น๐—น๐˜€ ๐—ถ๐—ป ๐—บ๐—ถ๐—ป๐˜‚๐˜๐—ฒ๐˜€ ๐—ผ๐—ณ ๐—ฟ๐—ผ๐—ฏ๐—ผ๐˜ ๐—ถ๐—ป๐˜๐—ฒ๐—ฟ๐—ฎ๐—ฐ๐˜๐—ถ๐—ผ๐—ป
Using ฯ€0.5 + FastTD3, subsequent real-world tasks reach the 95% success stopping criterion in about ๐Ÿฐโ€“๐Ÿญ๐Ÿฎ ๐—บ๐—ถ๐—ป๐˜‚๐˜๐—ฒ๐˜€ ๐—ผ๐—ณ ๐—ฟ๐—ผ๐—ฏ๐—ผ๐˜ ๐—ถ๐—ป๐˜๐—ฒ๐—ฟ๐—ฎ๐—ฐ๐˜๐—ถ๐—ผ๐—ป.

Compared with single-task RL:
โ€ข AutoMate assembly: ๐Ÿฏ๐Ÿญ.๐Ÿฌโ€“๐Ÿฒ๐Ÿด.๐Ÿฑ% ๐—น๐—ฒ๐˜€๐˜€ ๐—ฟ๐—ผ๐—ฏ๐—ผ๐˜ ๐—ถ๐—ป๐˜๐—ฒ๐—ฟ๐—ฎ๐—ฐ๐˜๐—ถ๐—ผ๐—ป
โ€ข NIST assembly: ๐Ÿฏ๐Ÿด.๐Ÿณโ€“๐Ÿฐ๐Ÿฎ.๐Ÿต% ๐—น๐—ฒ๐˜€๐˜€ ๐—ฟ๐—ผ๐—ฏ๐—ผ๐˜ ๐—ถ๐—ป๐˜๐—ฒ๐—ฟ๐—ฎ๐—ฐ๐˜๐—ถ๐—ผ๐—ป

Both methods use the same stopping rule over the latest 20 episodes. These are robot interaction times, including online warmup, excluding demonstration collection and foundation-model fine-tuning.

๐Ÿ›ก๏ธ ๐—˜๐—ฎ๐—ฟ๐—น๐—ถ๐—ฒ๐—ฟ ๐˜€๐—ธ๐—ถ๐—น๐—น๐˜€ ๐—ฟ๐—ฒ๐—บ๐—ฎ๐—ถ๐—ป
After each full sequence, the final policies achieve ๐Ÿญ๐Ÿญ๐Ÿด/๐Ÿญ๐Ÿฎ๐Ÿฌ ๐˜€๐˜‚๐—ฐ๐—ฐ๐—ฒ๐˜€๐˜€๐—ฒ๐˜€ across six prior tasks (๐Ÿต๐Ÿด.๐Ÿฏ% ๐—ผ๐˜ƒ๐—ฒ๐—ฟ๐—ฎ๐—น๐—น). Each task is evaluated separately for 20 trials across the two independently trained suites.

We also evaluate ACCRUE separately in simulation using GR00T + FastSAC.

๐ŸŽฌ Watch the attached ๐Ÿฒ๐Ÿฌ-๐˜€๐—ฒ๐—ฐ๐—ผ๐—ป๐—ฑ ๐—ผ๐˜ƒ๐—ฒ๐—ฟ๐˜ƒ๐—ถ๐—ฒ๐˜„, then explore more videos and interactive results on the project page.

๐Ÿ“„ Paper: https://arxiv.org/abs/2610.18596
๐ŸŒ Project: https://accrue-rl.github.io/

Sign up or log in to comment

Get this paper in your agent:

hf papers read 2610.18596
Don't have the latest CLI?
curl -LsSf https://hf.co/cli/install.sh | bash

Models citing this paper 0

No model linking this paper

Cite arxiv.org/abs/2610.18596 in a model README.md to link it from this page.

Datasets citing this paper 0

No dataset linking this paper

Cite arxiv.org/abs/2610.18596 in a dataset README.md to link it from this page.

Spaces citing this paper 0

No Space linking this paper

Cite arxiv.org/abs/2610.18596 in a Space README.md to link it from this page.

Collections including this paper 0

No Collection including this paper

Add this paper to a collection to link it from this page.