- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes Geometry-Guided Decision-Focused Fine-Tuning (GG-DFF) for decision-focused learning (DFL) in linear and mixed-integer linear optimization problems. Its key innovation is to construct a convex correction region (CCR) around a frozen pretrained predictor using differences between feasible solutions, thereby explicitly controlling which decision regions corrected predictions can reach; an almost-everywhere differentiable parameterization enables end-to-end fine-tuning with the standard SPO+ loss. Theoretically, the paper characterizes the relationship between correction boundaries and decision-region reachability, establishes sufficient conditions for excluding certain decision regions, and derives conditional regret bounds relative to the pretrained predictor. Experiments on four benchmarks—shortest path, knapsack, and two energy-scheduling tasks—show that GG-DFF consistently outperforms the DFF baseline in mean normalized decision regret.
Critical strengths
- The paper introduces a convex correction region (CCR) that uses feasible-solution differences to constrain prediction corrections according to the optimization problem's geometry, offering a principled alternative to unconstrained or box-constrained corrections.
- The authors establish theoretical results on decision-region reachability and conditional regret bounds. Experiments on four benchmarks show consistent improvements over the DFF baseline in mean normalized decision regret.
Critical weaknesses
-
Limited empirical gains on some benchmarks: Improvements are modest on knapsack and energy-scheduling tasks (approximately 1.0%–2.9%), and the paper does not establish that the gains are statistically significant.
-
The theoretical guarantees rely on specific conditions, including comparison coverage, while the effectiveness of the correction region may depend on how well the constructed boundaries capture the relevant decision geometry. The generality of the approach beyond the evaluated problem settings remains unclear.
Questions for authors
-
How sensitive is GG-DFF to the quality and coverage of the collected feasible-solution comparisons? How does its performance change when comparison coverage is incomplete or the number of collected feasible solutions is limited?
-
Are the improvements over DFF statistically significant? Given the relatively modest gains on knapsack and energy-scheduling benchmarks, could the authors provide statistical tests or confidence intervals across random seeds?
-
How does GG-DFF scale to larger or more complex optimization problems? In particular, what is the computational cost of constructing and parameterizing the convex correction region as the number of feasible-solution comparisons increases?