- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes Self-Anchored Preference Optimization (SAPO), a two-stage framework for cold-start neural scheduling without pretrained reference policies. SAPO introduces distribution-smoothed exploration, which samples winners from a decaying top-K candidate pool to improve early training diversity, followed by self-anchored refinement, which uses the historical-best policy as a dynamic reference to stabilize later optimization. The method is evaluated on six job-shop scheduling (JSSP) benchmark families, with additional transfer experiments on flexible JSSP and TSP. Results show modest improvements over BOPO in optimality gaps, improved late-stage stability on the recorded training trajectory, and comparable inference efficiency. The authors conclude that stage-adaptive preference optimization offers a practical approach to cold-start neural scheduling.
Critical strengths
- SAPO addresses the lack of informative reference policies in neural scheduling through a stage-adaptive framework combining diversified early preference sampling with historical-best policy anchoring. The approach is compatible with existing neural schedulers and does not introduce additional inference overhead.
- The paper evaluates SAPO across six JSSP benchmark families under matched architecture and decoding settings with BOPO. The phase-wise ablations, anchor-update comparisons, and FJSP/TSP transfer checks provide meaningful evidence of the framework's practical effectiveness, although the observed improvements are modest.
Critical weaknesses
- SAPO primarily combines two established techniques (top-K winner sampling and checkpoint-based reference regularization) into a two-stage training framework. While practical, the approach offers limited conceptual or theoretical novelty beyond their integration, weakening its contribution.
- The improvement over BOPO is relatively modest (0.312 percentage points in the JSSP macro optimality gap). Moreover, the reported five-seed evaluation measures decoding variability from fixed checkpoints rather than independent training runs. Consequently, the evidence is insufficient to establish consistent improvements in training performance and stability across random initializations.
Questions for authors
- The reported five-seed JSSP results measure decoding variability rather than independent training runs. Is there any existing evidence that SAPO consistently outperforms BOPO across different training seeds? How should the claimed training stability be interpreted given this limitation?
- Phase 2 changes both the reference policy and the preference loss formulation. How can the authors distinguish the benefits of historical-best anchoring from those arising from the modified loss and its scaling?
- Given that top-K sampling and reference-policy regularization are established techniques, what is the key methodological insight that distinguishes SAPO from a straightforward combination of these components?