- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper addresses a limitation of behavior cloning: an action decoder may not learn or use the local purpose of a demonstrated behavior. INDI uses a frozen vision-language teacher to extract features from executed action segments and their outcomes. The student predicts these features from current inputs. Context routing and mismatch training encourage the action decoder to use the resulting intermediate state. The main strength is the combination of execution-based supervision and explicit training for downstream use. The teacher is removed at deployment. However, training stability and one ablation's mismatch-update schedule remain unclear. The performance is good enough, for GR00T-N1.7, success rises from 64.3% to 84.7% on Bridge and from 64.1% to 70.3% on RoboCasa. Results on π0.5 and real robots provide additional support. Overall, the evidence supports practical gains, while the contribution of each training mechanism needs firmer validation.
Critical strengths
-
Useful gains across settings. Matched backbone comparisons cover two policies, simulation, and real robots. A future-supervision control helps distinguish INDI from outcome prediction alone. The performance is good.
-
Relevant mechanism controls. Separate routing, mismatch, and alignment ablations directly test whether the decoder benefits from learning and using the intermediate state.
-
Informative target analysis. Prompt and feature-source comparisons support the target design. The paper also acknowledges that these features contain scene and motion information, beyond intent alone.
Critical weaknesses
-
Training stability is unclear. Reported evaluation repetitions do not measure independent training variation. The full model and no-mismatch variant need focused training repeats to strengthen the mechanism claim.
-
The no-bottleneck schedule is ambiguous. Direct context remains open in this variant, but the mismatch-update frequency is unspecified. This makes it harder to isolate the effect of routing.
-
Total training cost is incomplete. Policy costs are reported, but one-time teacher-target generation time and cache storage are missing. These costs matter when applying INDI to a new dataset.
Questions for authors
It is a good paper, but I still have three questions:
-
How stable is the full model's gain over the no-mismatch variant across independent training seeds?
-
Is the mismatch-update frequency matched between the full model and the no-bottleneck variant?
3.What are the teacher-target generation time and cache storage requirements for each dataset?
If the authors can address my concerns well, I will raise my score.
2 comments
A Gentle Reminder
Dear Reviewer jR8m,
Thank you again for your focused review, which pinpointed the evidence needed to validate each training mechanism.
Since the discussion period is about to end, we wanted to follow up on our rebuttal. We retrained the full model, the no-mismatch variant, and the baseline with two additional seeds, stated the mismatch-update schedule and reran the no-bottleneck variant with a matched frequency, and reported the target-generation time and storage for each dataset.
We would appreciate any feedback on whether our response addresses your concerns, and would be happy to clarify any remaining points.
Best, Authors
We thank Reviewer jR8m for the focused review, which pinpoints the evidence needed to validate each training mechanism. We also appreciate the recognition of INDI’s consistent gains across backbones and real robots, the targeted mechanism controls, and the informative target analysis. We address the three concerns directly with training-seed repeats (W1), a frequency-matched rerun of the no-bottleneck variant (W2), and per-dataset target-generation time and storage (W3). We uploaded a revised version of the paper, with all changes highlighted in blue.
[W1, Q1] Training Stability
The full model’s gain over the no-mismatch variant is stable across independent training seeds. We trained the full model, the no-mismatch variant, and the baseline with two additional seeds each and evaluated all runs with a fixed evaluation seed (GR00T-N1.7, Bridge).
The full model outperforms the no-mismatch variant for every seed (85.5%, 80.0%, and 84.0% vs. 74.0%, 71.5%, and 77.5%), and its lowest-scoring seed still exceeds the best no-mismatch seed.
We added the seed results to Appendix B.2 and clarified the evaluation protocol in Appendix A.2.
[W2, Q2] Mismatch-Update Frequency
The mismatch-update frequency was not matched in the original no-bottleneck variant, but the routing effect does not depend on it. In the full model, mismatch training is applied only to context-blocked updates (about half of all updates), because a mismatched intent can be ignored when the decoder has direct access to the VLA context. The no-bottleneck variant, which keeps direct access open, applied mismatch training to every update. We stated this schedule in Appendix B.2 and separated the two factors in two ways.
Comparison without mismatch training. Comparing the two variants without mismatch training removes the frequency difference altogether. Routing alone raises success from 65.5% to 74.0% (Table 10).
Frequency-matched rerun. We retrained the no-bottleneck variant with mismatch training applied to a random half of the updates, matching the full model. It reaches 68.0%, close to the original no-bottleneck variant (70.0%), so routing still adds 17.5 pp (85.5% vs. 68.0%).
[W3, Q3] Total Training Cost
The total training cost stays moderate: target generation is a one-time cost per dataset, and the stored targets are smaller than the decoded training frames. We measured the generation time and storage for each dataset.
Most of the time goes to generating the purpose statement (47 to 84 ms per sample), while feature extraction takes 15 to 35 ms. Storage is 128 KiB per sample for teacher targets and 64 KiB per endpoint frame and camera for visual targets, so the cost for a new dataset can be estimated directly. End to end, the first run, including target generation, takes about 85 GPU-h on Bridge and 75 GPU-h on RoboCasa Kitchen with GR00T-N1.7, compared with 51 GPU-h for the baseline (17 h on three GPUs, Table 7). The targets are reused by later runs with the same teacher, prompt, and target settings, so each additional run takes 57 GPU-h, 1.12x the baseline, and the teacher is not used at deployment. We added these measurements to Table 7 and Appendix A.7.