- Rating
- 2
- Confidence
- 3(−1)
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
The paper proposes DriftCO, a one-step heatmap generator for graph-based combinatorial optimization. It adapts drifting-model training through graph-conditioned generation, single-reference attraction, and a cosine similarity kernel. Generated heatmaps are decoded and locally improved before best-of-many selection. Experiments on Euclidean TSP and MIS report quality-runtime trade-offs and zero-shot transfer to larger instances.
Critical strengths
This work presents a practically relevant adaptation of drifting models to neural combinatorial optimization. DriftCO promotes candidate diversity without requiring multiple annotated solutions per training instance. Its same-instance formulation provides a coherent interface between continuous generative training and graph-specific decision representations.
The paper provides a comprehensive review of related work and is generally clear and well presented. But I recommend adding an overview figure to illustrate the framework and clarify the training and inference pipelines.
Critical weaknesses
-
The central claim of useful structural diversity is insufficiently established. Under single-reference supervision, the field reduces to the reference minus a kernel-weighted generated mean. Repulsion in unconstrained heatmap space can produce variation that leaves decoded solutions unchanged, including positive rescaling. Fig. 1 measures best-of-many gains, while the ablations report final quality; neither directly isolates structural diversity from candidate quality or local-search effects. This limits confidence in the mechanism underlying the paper’s main contribution.
-
The superiority claims need stronger evaluation controls and uncertainty reporting. Candidate budgets differ across methods, and matched-time comparisons are absent. The closest MIS margins are small: 10.87% vs. 10.94% gap on ER, without repeated-run uncertainty. Furthermore, the approximately 5.5% RB gap in Figure 1 at six candidates is not reconciled with the 2.63% main-table result using the same stated candidate count. These issues affect confidence in the robustness and interpretation of the reported advantages.
-
The applicability to more complex constrained CO problems remains unclear. Validation is limited to standard Euclidean TSP and MIS, while feasibility is handled through task-specific decoding. This limits the claimed generality of the approach and leaves unresolved whether its efficiency and useful candidate diversity would survive more demanding feasibility handling.
-
The experimental reporting is insufficiently precise. Table 1 neither defines “attain the reference solution quality” nor reports the achieved objectives and gaps. Since the main contribution is a training method, scale-specific IID training and evaluation on TSP-500/1000 are also needed. Following the cited baselines, consistently reporting objective values, gaps (preferably with standard deviations), and end-to-end time per instance would be better.
Questions for authors
-
Are heatmaps or drifting fields normalized, bounded, or otherwise stabilized beyond the stated equations? What prevents repulsion from primarily producing score variation that leaves decoded solutions unchanged?
-
Under identical candidate and local-search budgets, does adding repulsion increase the number of distinct decoded solutions or reduce edge/node overlap? How do candidate quality and diversity change before and after local search?
-
What explains DriftCO’s approximately 5.5% RB gap in Figure 1 with six candidates versus 2.63% in Table 3? Please specify the decoding, refinement, and local-search settings used in each experiment.
-
What is the intended scope of DriftCO beyond TSP and MIS? e.g. for problems with capacity, time-window, or precedence constraints. What evidence or argument supports retaining the reported efficiency and diversity benefits once the required feasibility handling is included?
-
What precisely constitutes “attaining the reference solution quality” in Table 1? Please report the achieved objective values and gaps alongside the timings. Further, how does DriftCO compare with the baselines under scale-specific IID training on TSP-500 and TSP-1000, using comparable training and evaluation settings? Please report objective, gap, variability, and end-to-end time per instance to establish the effectiveness of the proposed training method at these scales. Additional suggestion: Models trained at these larger scales could also be evaluated on still larger instances to complement the current cross-scale generalization study.