- Rating
- 1
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This paper proposes LUA, a unit-test selection method for reinforcement learning fine-tuning of code models. It samples a candidate test pool, scores tests with a learned selector, and favors tests whose scores are near the median. Code generation and test selection are jointly optimized using execution rewards. Experiments examine its combination with existing training methods and test-pool augmentation.
Critical strengths
Selecting tests for reward computation is a useful direction that complements problem-level curriculum learning. The paper includes random-selection and test-augmentation comparisons, which help examine the contribution of test selection.
Critical weaknesses
- The central selection mechanism is insufficiently justified and specified. It is unclear why the median of learned selection probabilities should identify uncertain tests near the model’s capability boundary. The extensive policy formalization also leaves practical details unresolved, particularly how the selector is trained under the transformed sampling distribution and how additional tests are generated and validated.
- The empirical benefits are modest and not consistent across metrics. In particular, adaptive selection provides only a small additional gain over uniform sampling from the augmented test pool. Without repeated-run uncertainty or end-to-end cost measurements, it is difficult to judge whether the learned selector offers a reliable advantage over simpler alternatives.
Questions for authors
- How are additional tests and their expected outputs produced and validated? Are tests generated during training, or are candidates refreshed from a precomputed pool? Please also specify the pool sizes and number of selected tests.
- What is the exact optimization loss for the test selector, and how does it account for the adaptive sampling distribution? What evidence links the learned scores to test difficulty or uncertainty?
- Do the gains over random selection remain across training seeds and under matched compute budgets, including test scoring and generation costs? A comparison with the fixed single-test baseline under the same problem-sampling strategy would also help.
We thank the reviewer for the careful evaluation and constructive feedback.
Q1. Question regarding the setup of unit tests
First, the datasets information we used are as follows
For each problem, the candidate pool U_small contains 16 tests sampled once from its full test set and refreshed every 5 steps.
Q2. Question regarding sampling budget
We appreciate the reviewer for this important point. Our method consists of the following three additional steps during the training.
(i) forward pass over the |U_small| tests per problem
(ii) linear head backward
For Qwen3-8B, the end-to-end training time was as follows,
resulting in additional +8.6% of overhead.
Under matched wall-clock time, LUA remains comparable to Random-K, indicating that its 8.6% overhead does not negate its consistent per-step gains.
Q3. Which generator, expected-output source, and validity checks supply the tests? Please provide pool-growth records, candidate/subset sizes, training/evaluation split and deduplication details, and total costs including generation, encoding, rollouts, execution, and updates. Which evidence establishes streaming benefits beyond resampling a pregenerated pool?
The expected outputs are the ground-truth outputs provided by the dataset, used unmodified. We will revise the manuscript to make clear that the tests are selected from the existing suite rather than generated.
To evaluate the effect of varying the number of available unit tests, Table 1 reports model performance across different test subset sizes (1, 8, 16, and the full suite). Furthermore, our algorithm periodically re-draws U_small, so tests the head has never scored entering the candidate pool are handled without retraining. Table 4 demonstrates this effect.