ArXiv

Learning Process Rewards via Success Visitation Matching for Efficient RL

Authors
Raymond Tsao, Andrew Wagenmaker, Sergey Levine
Categories
cs.LG, cs.AI, cs.RO, stat.ML
arXiv
https://arxiv.org/abs/2606.23640v1
PDF
https://arxiv.org/pdf/2606.23640v1

Brief

Learning Process Rewards via Success Visitation Matching addresses sparse outcome rewards by training a discriminator to separate past successful and unsuccessful episodes, then shaping a dense reward that incentives matching state-action visitations of successes. The approach provably preserves the original optimal policy and yields substantially faster finetuning of robotic control policies in both simulation and real-world manipulation. Full text was not available (abstract source).

Why it matters

Proposes a 'success visitation matching' method: train a discriminator to distinguish successful vs unsuccessful episodes and use it to reward an RL policy for matching the state-action visitation distribution of successful episodes while avoiding unsuccessful ones; authors prove this dense process reward does not change the optimal policy.

Key details

  • Evaluated on finetuning robotic control policies (both simulated and real-world manipulation) and reported significantly faster RL finetuning than directly maximizing the sparse outcome (+1 on success) reward; paper by Raymond Tsao, Andrew Wagenmaker, and Sergey Levine (arXiv:2606.23640v1), published 2026-06-22.
Source evidence

Abstract

In many modern applications of reinforcement learning (RL), the natural reward for a task of interest is inherently sparse: a reward of 0 is given everywhere except when the task is completed, when a reward of +1 is given. Training a policy to maximize such a sparse reward requires solving a challenging credit assignment problem, leading to slow or ineffective RL improvement. We propose a simple approach to transform a sparse outcome reward into a dense process reward. Our approach relies on training a discriminator to distinguish between previous successful and unsuccessful episodes, and using this discriminator to incentivize the RL-learned policy to match the state-action visitations of successful episodes, while avoiding those of unsuccessful episodes. By incentivizing the policy to match the visitations over all states, not just those that correspond to task success, this reward provides dense feedback on whether progress is being made towards task completion, and, we show, provably achieves this without changing the optimal policy. Focusing on finetuning of robotic control policies, we demonstrate that our approach leads to significantly faster RL finetuning performance on both simulated and real-world manipulation tasks, as compared to simply maximizing the sparse outcome reward.