- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper studies decision-focused learning for strongly convex quadratic programs in which both objective coefficients and constraint right-hand sides are predicted. It introduces sensitivity-informed geometric and nullspace-aware learning (SIGNAL), which combines an objective-induced Bregman divergence, a true-feasibility loss, and a signed primal–dual margin to supervise constraint activity. The analysis characterizes how prediction errors affect the represented optimizer, including constraint directions that are locally invisible to the decision, and derives finite-sample bounds on operational regret, true constraint violations, and dormant-bound prediction error. The method is evaluated on IEEE 14-bus and 57-bus power-grid benchmarks under constraint shifts and observation noise.
Critical strengths
The paper treats errors in objective prediction separately from errors in constraint prediction, since the latter can change the feasible set and make regret hard to interpret for infeasible decisions. Its signed primal–dual margin gives a learning signal for constraints that are inactive at the current solution but may become active after a shift. The analysis relates these signals to changes in the optimizer, feasibility, and constraint activity. The ablation compares three loss configurations: Dec-Only uses the decision-divergence loss, Dec-Feas adds the feasibility loss, and SIGNAL adds the signed-margin loss. The paper also compares these methods with other learning-based optimization methods on IEEE systems.
Critical weaknesses
-
No comparison with direct constraint-parameter prediction. The ablation adds feasibility and regime losses in stages, but does not compare regime supervision with directly predicting the true constraint right-hand sides using normalized MSE. It is unclear whether the margin loss helps beyond fitting those values.
-
The role of dual multipliers is unclear. The signed margin uses slack for inactive constraints and multipliers for active constraints. The experiments do not separate the multiplier signal from the slack signal or compare the full margin with activity-label supervision.
-
The experiments do not show what the theory explains. The paper derives sensitivity relations, finite-sample bounds, and a condition for active-set recovery. The experiments report regret and constraint violations under shifts and noise, but do not show whether the bounds are informative, whether the recovery condition predicts active-set errors, or whether the sensitivity analysis explains the ablation results.
-
The analysis assumes fixed problem matrices. It considers changes in the objective’s linear coefficients and the constraint right-hand sides, while keeping the Hessian and constraint left-hand-side matrices fixed. It therefore does not show how the method handles changes in objective curvature or constraint coefficients.
-
The experiments do not test how performance changes with problem size. The two power-grid benchmarks use reduced problems with only two and six decision variables. The paper reports no results on larger problems, so it is unclear how solution quality and computational cost change as dimension grows.
Questions for authors
-
How does SIGNAL compare with a scale-normalized MSE baseline that predicts all uncertain objective coefficients and constraint right-hand sides? Reporting results for uncertain inequality bounds separately would help isolate the effect of regime supervision.
-
Which part of the signed-margin loss contributes to the results? Comparisons with slack-only, multiplier-only, and activity-label variants would help answer this.
-
Can the theoretical bounds and active-set recovery condition help explain the experimental results? For example, are the bounds informative on the tested cases, and does the sensitivity analysis account for the ablation results?
-
How would SIGNAL behave if the Hessian or constraint left-hand-side matrices were uncertain? If these cases are outside the paper’s scope, could the authors state this limitation and narrow the claims?
-
How does performance change as the problem size grows? Results on larger QPs, with solution quality and computational cost reported against problem dimension, would help assess this.
4 comments
We thank the reviewer for their question regarding empirical diagnostics of the theoretical results. In the revised version, we addressed this issue. In particular, to directly connect our theoretical analysis with empirical behaviour, we have added empirical diagnostics in Appendix J6, covering the IEEE 57-bus experiment. First, the active-set certificate is verified across all evaluated instances, with zero active-set mismatches among certified ID and certified OOD instances; the deterministic downstream bounds associated with the finite-sample mean loss are also satisfied, albeit conservatively, consistent with their role as analytical controls. Second, the tangent-normal sensitivity decomposition is confirmed to numerical precision, showing that the relative contributions of objective and active-constraint errors differ markedly between ID and OOD conditions: objective-induced tangent motion accounts for of eligible ID decision loss, whereas active-constraint RHS errors account for of eligible OOD decision loss through normal motion. Third, we directly verify the dormant-bound blind spot: of ID and of OOD physical-rating coordinates are locally decision-null, with vanishing decision and feasibility gradients, while regime supervision provides nonzero gradients on all evaluated such coordinates. Together, these findings establish an empirical connection between the proposed geometric analysis, constraint-activity supervision, and the distinct learning signals available under joint objective-constraint uncertainty.
We thank the reviewer for stating their concern about the scope of the proposed framework. In the revised version, we have addressed this issue by providing a discussion about the scope beyond strongly convex QPs. we clarify that true-feasibility shaping extends naturally by evaluating predicted decisions against true constraints, while signed-margin supervision and its active-set certificate follow from primal-dual complementarity, provided corresponding constraints, compatible positive scales, and well-defined KKT-pair selections are available. In contrast, the fixed objective-curvature metric, canonical normalisation, and exact regional affine sensitivity structure rely on the strongly convex QP formulation with fixed problem matrices. We then discuss the extension challenges for different constrained optimisation problems. In particular, we highlight that, for a locally regular active set, perturbations in and in the active-constraint matrix modify the KKT differential to \begin{align} \begin{bmatrix} H&J^\top \newline J&0 \end{bmatrix} \begin{bmatrix} dz \newline dy \end{bmatrix} =\begin{bmatrix} -(dH)z-dc-(dJ)^\top y\newline dr-(dJ)z \end{bmatrix}. \end{align} The terms , , and are absent from the fixed-geometry analysis. If the Hessian varies, positive definiteness must be maintained for the strongly convex solution setting and the true-objective divergence uses the true sample-specific curvature. If constraint coefficients vary, active manifold orientations and normalisations change; compatible correspondence and scaling are needed for true/represented margin comparisons. Although local implicit differentiation remains possible under a nonsingular KKT system, the exact fixed-region affine map, fixed -orthogonality statements across parameter changes, and regionally affine gradients require further analysis.
We thank the reviewer for stating their concern about training-cost measurements and transferability of the proposed framework. In the revised version, we have addressed these issues by providing a training time comparison of the compared methods and adding a higher-dimensional EV-charging experiment. In particular, in Appendix J5, we report training wall-clock time on the IEEE 57-bus benchmark across training sample sizes. For example, at , SIGNAL takes seconds, versus seconds for Dec-Feas and seconds for dQP-DFL. Thus, the regime supervision incurs additional training time over Dec-Feas, while SIGNAL is faster than dQP-DFL, as the main comparator capable of handling joint uncertainty by default. Furthermore, in Appendix J9, we provide a network-constrained EV-charging experiment. It schedules controlled chargers over eight periods, producing decision variables, polyhedral electrical-network inequalities, and energy-limit inequalities. We compare SIGNAL against the two principal comparators applicable directly to joint objective-constraint uncertainty: MSE-PtO and dQP-DFL. Across the reported conditions, SIGNAL attains lower mean operational regret and violation measures than MSE-PtO and dQP-DFL. This is evidence of transfer to a higher-dimensional problem with a different constraint structure.
We are grateful to the reviewer for their constructive feedback. We hope that the additional theoretical analysis, experimental evidence, and clarifications in the revised manuscript satisfactorily address their concerns and strengthen their assessment of our work.
Thanks for the response. The new baseline and the margin ablations do address my main concern about what the proposed supervision adds. Compared with slack-only, the full margin consistently reduces the share of test instances with a constraint violation, though the gains are modest and regret remains close in several settings. The larger EV experiment also broadens the evaluation of SIGNAL. What still limits the evidence is that the added value of the multipliers is directly supported by only one power-grid benchmark. Even so, the new evidence addresses my main concerns, and I am raising my score.
We sincerely thank the reviewer for their insightful comments and questions. Our revision incorporates a structural and empirical auxiliary-loss study (Appendices F, G, J8), empirical diagnostics (Appendix J6), a matrix-uncertainty scope discussion (Appendix H), training-cost measurements (J5), and a higher-dimensional EV-charging experiment (Appendix J9).
Response to Q1 and Q2. We thank the reviewer for pointing to the need for the adoption of normalised bound-prediction and various versions of complementarity-aware supervision within the same decision and feasibility framework. In the revised version, we have addressed this issue comprehensively by defining normalised-bound prediction, slack-only supervision, multiplier-only supervision, and sign-only supervision. In particular, in Appendices F and G, we analyse this distinction structurally for the four possible constraint-activity configurations. When a row is inactive in both true and represented problems, Lreg reduces exactly to slack-only supervision; if Giδz is negligible, normalised-bound prediction provides an approximate parameter-space proxy. When a row is active in both problems, Lreg reduces exactly to multiplier-only supervision. In these stable one-sided regimes, the simpler continuous losses can therefore provide appropriate surrogates. The full signed margin is particularly distinctive when activity statuses differ. On a missed-active row, it combines the represented positive primal slack with the true dual multiplier; on a falsely active row, it combines the true positive primal slack with the represented dual multiplier. In both cases the two quantities enter with the same sign after taking the signed-margin difference. Sign-only supervision captures a different, coarser aspect of this structure. It assigns zero loss whenever the activity labels agree and a fixed loss of 1/k whenever they disagree. Thus, it detects activity misclassification but discards continuous information about distance to activation, binding strength, and the severity of margin disagreement. Apart from this analysis, it is important to note that, for an inactive inequality, the primal slack si>0 measures its distance to binding, equivalently the bound tightening required to reach activation. However, for a strictly active inequality, the dual multiplier μi>0 quantifies its binding strength through the marginal objective-value improvement from bound relaxation; in the isolated-inequality setting, the relaxation required to release the constraint is di2μi. Building on this observation, we show in Proposition 3 through a bound perturbation analysis that the signed primal-dual margin matters in all four constraint-activity configurations. Proposition 4 further establishes a deterministic certificate linking sufficiently small regime-supervision loss to exact active-set recovery on the supervised constraints. Finally, in Appendix J8, we compare the resulting variants (Dec-Feas-NMSE, Dec-Feas-Slack, Dec-Feas-Mult, and Dec-Feas-Sign) with SIGNAL, using the same predictor class, differentiable backend, componentwise clipping procedure, calibration protocol, and paired evaluation settings. This study evaluates five conditions: the OOD baseline, +2%/+4% relaxation of two training-exposed physical line ratings, and −2%/−4% tightening of two training-dormant physical line ratings. SIGNAL attains the lowest mean operational regret and violation magnitude in each condition. Dec-Feas-NMSE has a slightly lower mean violation frequency in the baseline and two relaxation conditions, but exhibits higher mean violation magnitude in all conditions. These metrics should be interpreted jointly, as lower violation frequency does not necessarily imply better overall performance. Dec-Feas-Slack regret is close to SIGNAL in several conditions. Nevertheless, the results suggest that combining slack and multiplier information in the full signed-margin formulation can be beneficial, as SIGNAL achieves lower violation frequency and magnitude than Dec-Feas-Slack across all evaluated conditions.