Learning More from Less:
Reinforcement Learning from Hindsight

1Massachusetts Institute of Technology  ·  2MIT-IBM Computing Research Lab
3Stanford University  ·  4University of California, San Diego
A real-robot rollout that fails the commanded instruction “put the container in the bowl” is read by a VLM and relabeled as “move the container”; standard RL gets no learning signal from the failure, while Learning from Hindsight turns it into signal for meaningful skills.

LfH uses a VLM to relabel failed rollouts with the tasks they actually achieved, turning failures into training signal for VLA fine-tuning.

Abstract

Reinforcement learning (RL) is increasingly used to post-train vision-language-action (VLA) models, but every update consumes robot rollouts that are slow and costly to collect, making sample efficiency a central concern. Manipulation tasks typically provide only sparse rewards, so a weak policy fails almost every rollout early in training and has little to learn from, even when those failures execute coherent behavior. Such a failure, however, is a success at a different task. We present Learning from Hindsight (LfH), which brings hindsight relabeling to RL post-training of VLAs by scoring failed rollouts against the tasks they actually achieved. A single vision-language model relabels both the instruction and the reward, proposing a hindsight instruction for a group of failed rollouts and scoring how well each satisfies it, and the policy trains on the relabeled and original rollouts jointly. Because VLAs generalize across language, relabeling in language lets the policy learn more from the same trajectories. On out-of-distribution LIBERO-PRO tasks, where standard RL improves only slowly, LfH achieves 5× improvement in sample efficiency, and outperforms a dense progress-reward baseline. The gains hold across VLA backbones and on a physical Franka robot.

How LfH works

Under sparse rewards, a weak policy fails nearly every rollout, so most GRPO groups have no reward variance and are discarded. LfH recovers this signal: a VLM reads an anchor failure and proposes a hindsight instruction \(g'\) describing what the robot actually did, then scores every trajectory in the group against it, and the policy trains on the relabeled and original groups jointly.

The walkthrough advances automatically; click a step to pin it.

  1. Roll out. Sample an instruction \(g \sim P_g\) and collect a group of \(K\) trajectories \(G = \{(\tau_i, g, R_i)\}\), where each rollout receives a sparse success reward \(R_i = R(\tau_i, g)\). Under sparse rewards nearly every rollout fails, so the group has no reward variance and GRPO learns nothing from it.
  2. Relabel the instruction. The VLM watches an anchor failure \(\tau_{i^\star}\) and writes a hindsight instruction \(g'\) for the task the robot actually performed.
  3. Relabel the reward. The VLM scores every trajectory against \(g'\), assigning a hindsight reward based on how well it satisfies the relabeled instruction and forming a hindsight group \(\tilde{G} = \{(\tau_i, g', \tilde{R}_i)\}\).
  4. Update. Train on original and hindsight groups jointly, \(\mathcal{L}_\text{GRPO} + \lambda\,\mathcal{L}_\text{H-GRPO}\), with an importance correction for actions that were sampled under \(g\) but are optimized under \(g'\).
  5. Repeat until convergence.
Commanded instruction “close the microwave” g ∼ Pg VLA policy πθ K rollouts Rollout group G R(τi, g) τ₁ τ₂ τ₃ τ₄ × × × × original groups B anchor failure τi* VLM Mψ describe the behavior Hindsight instruction “pick up the cup” g′ ∼ Mψ(· | τi*) score every τi under g′ Hindsight group G~ VLM-assigned rewards i, g′, R̃i) B~ Update θ LGRPO(B) + λ · LH-GRPO(B̃) signal for meaningful skills update θ

Simulation results

On out-of-distribution LIBERO-PRO tasks, LfH matches GRPO's final performance in roughly a fifth of the training steps — a 5× gain in sample efficiency — and outperforms a dense progress-reward baseline. The benefit transfers to GR00T and OpenVLA-OFT backbones.

Average gain vs. training steps: +LfH climbs to about 2.1 by step 40 while GRPO plateaus below 1.0.

Sample efficiency. Normalized gain over the initial \(\pi_{0.5}\) policy, mean over 4 seeds and the same rollout budget for all methods.

Fraction of trajectory groups kept for training: 0.27 for GRPO versus 0.74 for LfH.

Groups kept for training. GRPO discards groups with no reward variance; LfH recovers most of them through relabeling.

Three panels: (a) average gain vs. training steps for GRPO, GRPO+RoboMETER, and LfH; (b) group kept ratio over training; (c) final-step gain for GR00T and OpenVLA-OFT backbones.

Main comparison. (a) LfH reaches higher gain with fewer training steps than GRPO and GRPO+RoboMETER. (b) LfH keeps a larger fraction of trajectory groups usable for training. (c) The benefit transfers beyond \(\pi_{0.5}\) to GR00T and OpenVLA-OFT.

Real-world results

We fine-tune a \(\pi_{0.5}\) policy on a Franka FR3 on the held-out task “put the green container into the bowl.” Both methods start from zero success; at 160 rollouts LfH reaches 56% success while GRPO plateaus at 22%. The overlays report the training iteration and measured success rate.

GRPO. Failed attempts count only as failures of the commanded task; success plateaus at 22%.

GRPO + LfH. Relabeled failures become supervision; success reaches 56%.

Success rate vs. number of rollouts: at 160 rollouts LfH reaches 56% success while GRPO plateaus at 22%.

Success rate vs. rollouts collected. LfH improves real-world sample efficiency across rollout budgets.

BibTeX

@misc{xu2026learning,
  title         = {Learning More from Less: Reinforcement Learning from Hindsight},
  author        = {Iris Xu and Sunshine Jiang and John Marangola and Nitish Dashora and Richard Li
                   and Thomas Liu and Zexue He and Yuheng Zhi and Alex Pentland and Pulkit Agrawal
                   and Zhang-Wei Hong},
  year          = {2026},
  eprint        = {XXXX.XXXXX},
  archivePrefix = {arXiv},
  primaryClass  = {cs.RO}
}