- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
This paper presents FOVEA, which formulates the destroy step of Large Neighborhood Search as dense segmentation over a fixed-resolution canvas. Problem-specific layouts map optimization entities to the canvas, a U-Net predicts candidate regions, and the selected cells are decoded into variables for repair. The method is evaluated across several combinatorial optimization problems, with a focus on scalability, and is accompanied by theoretical analyses of spatial locality and constraint coupling.
Critical strengths
- The paper targets an important scalability issue in learned LNS and provides a simple fixed-size representation that remains usable at very large problem scales.
- The experiments are well-designed with proper controls.
Critical weaknesses
- This paper does not include AI Statement, which is mandatory. And the title in the submission system is inconsistent with the title in the PDF.
- Actual variable decoding relies on family-specific heuristics, so the learned contribution is not fully isolated.
- The comparison with only shows that a simple scale-dependent resolution is not beneficial. It remains unclear whether a more adaptive canvas strategy based on instance density or local complexity could better preserve fine-grained information while retaining scalability.
Questions for authors
- Why use U-Net? Will it be better to use other larger networks? More ablation studies about architecture should be included.