- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
To address an important issue in perturbation-based decision-focused learning (DFL), this paper proposes a shrinkage approach that rescales the predicted coefficients. Experiments demonstrate that the proposed method improves regret across existing perturbation-based DFL approaches.
Critical strengths
- The paper addresses a key challenge in perturbation-based decision-focused learning: the perturbation scale is fixed, whereas the scale of the predicted costs is not, which harms the performance of erturbation-based DFL approaches. The paper develops a natural approach to this issue by shrinking the predicted coefficients.
- The motivation is well-founded, and the theoretical analysis is sufficient to support the proposed approach.
Critical weaknesses
- The paper does not clearly state the research scope in the begining part of the paper. In the introduction, the authors state that "the map from costs to decisions is piecewise constant." However, this property holds only for combinatorial optimization problems rather than the general optimization problems. The paper's title and abstract also do not explicitly specify this setting, although it is clarified in the later text.
- The introduction states that the primary focus is "the problem of estimating objective function costs in combinatorial optimization problems." However, I do not think this accurately captures the broader scope of decision-focused learning. First, DFL is not restricted to combinatorial optimization problems. Second, estimating objective function costs is one approach to handling uncertainty in optimization problems (e.g., uncertain coefficients) and achive better decision quality. However, estimating objective function costs is not the only way for DFL. The paper should better clarify how its problem setting relates to the broader DFL literature.
- The introduction lacks clarity, especially for readers who are not already familiar with this research area, they may struggle to understand the underlying challenge and the motivation for the method.
- Some notation appears to be missing or insufficiently defined. For example, the notation in Equation (6) needs clarification.
Questions for authors
- How is selected? In practice, does achieving good performance require an exhaustive hyperparameter search over ? If so, how sensitive is the method to this choice?
- The evaluation appears to be limited to a three-vertex toy problem. How does the proposed regularization perform on larger-scale mixed-integer linear programming (MILP) problems or graph optimization tasks? Furthermore, does the optimal value of change systematically as the number of vertices increases?
- The proposed regularization applies a forward mapping that directly transforms , rather than introducing a penalty term into the objective function (e.g., an regularization term). What is the motivation for choosing this transformation over a conventional penalty such as ? Could the authors clarify the theoretical or empirical advantages of the proposed approach over standard regularization?
2 comments
Dear Reviewer, as the discussion period ends on November 18, we would be grateful if you could let us know whether our response addresses your concerns. In particular, we clarified the scope of the paper and mpared our approach with an explicit L2 penalty as you suggested. We also note that, beyond the three-vertex problem, the paper now evaluates the approach on new realistic experiments to demonstrate its relevance, namely the standard shortest-path and knapsack benchmarks (Section 6.2). We are happy to clarify any remaining point.
Answers to Reviewer 3.
We thank the reviewer for their comments and questions.
W1. We broadened the definition of decision-focused learning in the abstract, and we specified that our study focuses on cost estimation for combinatorial optimization.
W2. We broadened the definition of decision-focused learning in the introduction, and we specify that our study is restricted to cost prediction for Mixed-Integer Linear Programs. Additionally, a paragraph was added at the beginning of the literature review to present the broader scope of DFL applications.
W3. Beyond the specific changes mentioned above, the introductory sections have been revised for clarity.
W4. We clarified the notation. In particular, there was a typo in Equation 6: f~ was replaced by f (f~ denotes a perturbed decision mapping, required by another version of the Fenchel-Young loss). Moreover, we now introduce the loss LFY before it appears in Equation 6.
Q1. κ is selected on validation during hyperparameter optimization, so no exhaustive search is required. As mentioned in Section 5, κ balances flexibility and regularization: larger values yield looser bounds on the stability radius. Its best value is therefore problem-specific, a compromise between flexibility during training and ensuring that perturbations and cost estimates remain on the same scale. Regarding sensitivity, the extremes of κ are known methods: as κ→∞ the shrinkage falls back to the standard method, and as κ→0 it approaches normalization, so a poor choice drifts towards one of these baselines rather than causing a collapse (see also our answer to Reviewer 2).
Q2. Beyond the three-vertex problem, we now evaluate our approach on two standard benchmarks of the PyEPO library: shortest path on a 5×5 grid (40 edges) and a 32-item knapsack, with five degrees of nonlinearity of the feature-to-cost mapping (Section 6.2, Appendix E). We sshow that the cost regularizations outperform standard learning in the cases expected to exhibit instability.
Q3. Our new experiments now compare the L2 penalty to the standard and regularized methods. Although the L2 penalty outperforms other approaches in a few cases (DPO in c1 and c2 of the three-vertex problem), it is inconsistent: it is worse than the standard method for DBB on every benchmark and for SPO in c3, and it falls far behind clipping for DPO in c3, where instability is strongest. Overall, cost regularization is the more reliable alternative: it guarantees a bound on the norm of the cost fed to the perturbation, whereas the L2 penalty may require much more use-case-specific tuning to reach comparable results.