- Rating
- 2
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper studies whether post-training checkpoints with similar or even worse aggregate performance can still provide complementary coverage over different initial states. It keeps the base VLA policy and several post-training checkpoints. Then, it uses an online per-state contextual bandit to select one policy for each episode. The router uses the initial-state index as context and updates a simple score table from episode success. Experiments on LIBERO show that this routing strategy can improve success on tasks where policy outcomes are stable and repeatable for the same initial states.
Critical strengths
I do not see a strong contribution here. The main positive aspect is that the paper makes a useful empirical observation that checkpoints with similar aggregate performance can still cover different initial states. And the paper also evaluates several routing baselines and alternatives and includes additional analyses on state-level stability and cross-process repeatability.
Critical weaknesses
My main concern is that the setting is quite narrow. The router directly uses the initial-state ID and assumes that the same states will be revisited and behave consistently. This is a strong assumption, and the paper itself shows that the state-level outcomes can change substantially across processes and even GPU types. I also find the methodological contribution too limited for a full ICLR paper. Despite the "Mixture-of-Checkpoints" framing, the actual method is basically a per-state lookup table with standard epsilon-greedy routing. The observation is interesting, but the method itself feels too lightweight.
Questions for authors
See above weaknesses.