- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper formulates selecting among LLM-generated candidates as a contextual bandit problem. RSCB partitions context–candidate pairs into regions via k-means on semantic features and maintains a separate LinUCB in each region, with a regret bound under correct routing and an evaluation on bug localization.
Critical strengths
- The reward is computed from ground-truth patches rather than an LLM judge.
Critical weaknesses
- The motivation is not supported. The premise that LLMs increasingly generate multiple candidates is given without references or evidence, and the reasons for dismissing existing practice (inconsistent self-ranking, expensive validation) are not justified. Existing approaches for selecting among LLM candidates, such as best-of-N with verifiers or reward models, self-consistency, and rerankers, are neither discussed nor compared. The claimed applicability to tool selection and code repair is also not evaluated.
- The bandit formulation is not realistic. The reward requires the ground-truth patch, which is unavailable when a candidate must be selected. Since rewards for all training candidates can be computed offline, a supervised reranker is the natural baseline but is missing.
- The technical contribution is limited. The method is k-means clustering followed by one LinUCB per cluster, and the theory sums standard OFUL bounds under assumed correct routing, plus standard lower-bound and Lipschitz arguments.
- The empirical evidence is weak. The only significant gain over SC-LinUCB is on a private dataset; on both public benchmarks, the improvement is not significant. There is no comparison with a random partition of the same size, and several baselines perform close to random.
Questions for authors
see above