- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes multi-repacking by jointly redistributing residual trajectories across multiple replicas to release workers earlier. It further proves that multi-repacking has a strictly smaller leading-order expected tail occupancy than hierarchical pairwise repacking, with a uniform asymptotic gap.
Critical strengths
The finite-system results demonstrate multi-repacking’s occupied-time benefit on both exponential and non-exponential workloads.
The theoretical analysis and proof are strong in this paper.
Critical weaknesses
-
The experimental evaluation in this paper is relatively weak, as it does not provide any results in the main text. It only gives a deterministic comparison.
-
The conclusion that "These finite-system results demonstrate multi-repacking’s occupied-time benefit on both exponential and non-exponential workloads", however, in the experiments, only exponential workloads and supplied lengths are evaluated, and the validity of non-exponential workloads still lacks interpretable distributional conditions.
-
This paper is not well concluded, and the section of conclusion is also missing.
-
Setting II utilizes data from only 15,806 forward-pass output lengths, all derived from a single internal software engineering RL workload, referred to as "SWE-bench Multilingual." Each sampling iteration generates 1600 × 12,800 = 20,480,000 simulated trajectories, obtained by repeatedly sampling from the aforementioned 15,806 observed forward-pass output lengths. This approach neither creates new, independent "real-world" tasks nor produces extreme outcomes that exceed the maximum values found in the original sample set.
-
Theorem 2, Theorem 3 and Proposition 4 compare strategies with the same-level matching, whole-block membership, the switch certificate, and terminal fallback. Appendix D.2 shows that the hierarchical variant after removing these restrictions reflects stronger empirical gains. As a result, "strategies with strict guarantees" and "strategies with more practical appeal" are still two sets of results.
-
There is no reproducibility statement, and the code is not available. The code and the run records can be released anonymously.
-
The end-to-end reinforcement learning (RL) throughput has not yet been evaluated in this paper.
Questions for authors
-
There are so many assumptions in this paper. The authors should make it clear why such assumptions make sense.
-
Why are the request dependence, input-token effects, and migration costs omitted in length resampling?