A success can contain regression.
Uniform SFT can clone pauses, detours, and unstable corrections hidden inside a successful episode.
2026
Find the action chunks that actually move the task forward — even when the data includes detours, failures, and human recoveries.
A successful trajectory is rarely a straight line. Open the collection, follow four real-world rollouts from three synchronized cameras, and unfold the details of every setback.
Loading the trajectory observatory…
Reading the signal. Graph progress is a graph-derived estimate, not human-annotated ground truth. The default curve uses a centered 15-frame moving average; select Raw trace to inspect the original values. Dip values follow the selected curve. Transition weights use their own 0–1.5 scale. Pale orange marks recorded human-intervention frames; the rose-tinted dip windows follow the supplied event annotations. Captions describe visible motion and possible interpretations, rather than verified causes of the progress change.
A two-minute view of precise manipulation, backbone generalization, iterative training, and robustness evaluations.
Mixed-quality experience becomes useful supervision, without learning another model.
Long-horizon manipulation data is rarely clean. Even successful demonstrations can contain hesitations, overshoots, failed attempts, and imperfect recoveries. Intervention-assisted rollouts mix autonomous mistakes with delayed expert corrections, while failed episodes can still contain short segments that reconnect the system to a viable path.
GR-BC builds a task-conditioned goal-reachability graph over this mixed-quality data. Reverse graph search estimates the minimal remaining steps to success inside the dataset support, and each physically executed action chunk is weighted by how much it reduces that state potential. New rollouts are appended to the graph and reused in the next offline training round.
Whether an action is worth imitating depends on what it causes from the current state — not whether the overall episode eventually succeeded or failed.
Uniform SFT can clone pauses, detours, and unstable corrections hidden inside a successful episode.
Discarding the whole rollout wastes valid, task-advancing chunks that reconnect to successful regions.
GR-BC leaves the VLA architecture and supervised objective intact. The graph only decides how strongly each observed action chunk should contribute to training.
Multi-view MCR embeddings retrieve candidate neighbors. Mutual-view agreement, a gripper-state hard filter, and locally normalized similarity edges keep connections conservative.
Reverse Dijkstra search to a virtual success sink yields the dataset-supported remaining-step potential Rrec(s), then interpolation makes it dense.
Net progress Δt rewards forward consequence; regression depth filters unstable chunks. Unreachable states receive zero training weight.
Four tasks cover object search, visual alignment, contact-rich execution, and recovery from external disturbances or previous mistakes.
GRP follows task completion while dropping at detours, reorientation, and slip-outs — the local failures that a monotonic trajectory score can miss.
| Method | ΔSF ↑ | ρdev ↑ | Failure data | Progress labels |
|---|---|---|---|---|
| ReWiND | 0.003 | 0.00 | — | — |
| SARM | 0.24 | 0.48 | — | Required |
| Robo-Dopamine | 0.29 | 0.59 | — | Required |
| RoboMeter | 0.159 | 0.69 | Used | Required |
| GRP (ours) | 0.97 | 0.92 | Used | None |
In the iterative X-VLA evaluation, GR-BC reaches the highest final success rate on all four tasks and improves more consistently than DAgger, AWR, and reward-aware BC.
Cross-trajectory edges recover goal-reachable states from failed rollouts. The gripper-state constraint removes incompatible visual shortcuts while preserving useful recovery connections.
Incorrect visual neighbors can create shortcut paths; conservative filters can also miss valid recovery bridges. Multi-view agreement and gripper consistency reduce common errors, but they do not certify physical reachability.
GR-BC is intentionally dataset-supported and has limited generalization to states far outside the collected experience. Stronger reachability tests and broader embodiments remain future work.
Use the BibTeX below to cite this work.
@inproceedings{li2026grbc,
title = {Graph-Reweighted Behavior Cloning with Human Interventions
for Precise Robotic Manipulation},
author = {Li, Xiaoman and Yang, Zhiqiang and Hu, Jiayu and Kong, Jipeng and
Zhang, Yang and Zhang, Jingwei and Yan, Fangzheng and
Shen, Chunhua and Bai, Chenjia},
booktitle = {Conference on Robot Learning},
year = {2026}
}