- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
MANIFEST is a neural framework for parametric constrained optimization. It trains a primal network using a Gauss–Newton-based geometric distance loss, a first-order loss on changes in equality residuals with respect to problem parameters, and a primal–dual objective; differentiable Gauss–Newton steps are also incorporated during training. The method is evaluated on parametric QCQPs, convex NLPs, and the IEEE 57-bus AC-OPF problem. Compared with DC3, FSNet, and NLPOpt-Net, MANIFEST achieves lower mean equality violations across the benchmarks. Its raw optimality gap is lower on the nonlinear NLP and AC-OPF tasks, but higher than those of FSNet and NLPOpt-Net on QCQP.
Critical strengths
The distance loss uses the equality-constraint Jacobian to measure the distance between a prediction and the feasible set, instead of penalizing the residual alone without accounting for constraint geometry. In its unregularized form, it is invariant to nonsingular reparameterizations of the equality constraints. The first-order loss penalizes changes in equality residuals as problem parameters vary, encouraging the solution map to track the feasible manifold across instances. With the primal–dual objective and differentiable Gauss–Newton updates, these terms allow MANIFEST to train from problem data without solver-generated solution labels.
Critical weaknesses
-
The paper does not isolate the contributions of the geometric distance loss, the first-order parameter-variation loss, the primal–dual loss, or the differentiable Gauss–Newton steps. Nor does it provide a direct comparison between the geometric distance loss and a conventional equality-residual penalty.
-
The QCQP results expose a trade-off between feasibility and optimality. MANIFEST achieves lower raw equality violations, but its raw relative optimality gap is substantially larger than those of FSNet and NLPOpt-Net. After correction, the baselines’ gaps decrease further, whereas MANIFEST’s remains unchanged. The paper notes that the baselines perform additional objective optimization during correction, so the corrected results are not directly comparable.
-
Inference-time comparisons are not reported. Although MANIFEST can return the raw network prediction, it also permits Gauss–Newton restoration at inference to meet an equality-feasibility tolerance. Consequently, the cost of obtaining a feasible output remains unclear.
-
The paper does not adequately clarify how MANIFEST relates to sensitivity-informed AC-OPF methods, particularly SI-DNN (Singh, Kekatos, and Giannakis, “Learning to Solve the AC-OPF Using Sensitivity-Informed Deep Neural Networks,” IEEE Transactions on Power Systems, 2022), which leverages solution sensitivities with respect to loads during training.
Questions for authors
-
The authors should clarify the extent to which each training component contributes to feasibility and optimality, and in particular to compare the geometric distance loss with a standard equality-residual penalty under the same training setup.
-
It would also be helpful to explain the apparent tension on QCQP, where MANIFEST achieves lower equality violation but a substantially larger raw optimality gap, and to provide a comparison that accounts for the additional objective optimization used when correcting the baselines.
-
The paper should report wall-clock inference times for both the raw network prediction and the restored prediction, alongside the baselines under the same hardware and stopping criteria, and indicate how many Gauss–Newton iterations are typically required.
-
Finally, the authors should clarify how MANIFEST’s local feasible-manifold analysis relates to the use of solution sensitivities in SI-DNN, what guarantees it offers beyond penalizing parameter-dependent residual changes, and what advantage follows from not requiring sensitivity labels.
3 comments
Thank you for the additional experiments. In Weakness 1, I also asked about the contribution of the differentiable Gauss–Newton steps used during training. Table 3 does not test this component. If you have added a comparison without enabling the differentiable Gauss–Newton, keeping the other losses and training settings the same, could you also report the raw constraint violations and objective gaps? Also, does the conventional-residual baseline include the first-order loss? The reported 36.8% improvement comes from comparing the first two rows, so their first-order-loss settings need to be the same to attribute the difference to the geometric distance loss.
We thank the reviewer for the follow-up. We have conducted the additional differentiable Gauss–Newton ablation and updated Table 3 and the corresponding discussion in the revised manuscript to report the contributions of the geometric distance loss, first-order loss, and differentiable Gauss–Newton training.
1. Contribution of differentiable Gauss–Newton training. We evaluate MANIFEST with the differentiable Gauss–Newton steps disabled during training (), while retaining the first-order loss and all other training settings. The updated Table 3 reports the results.
| Method | Eq. MAE | Eq. Max | Opt. Gap (%) |
|---|---|---|---|
| Conventional equality residual (without FO term) | 1.17e-4 | 2.33e-2 | 1.91e-2 |
| Geometric distance (without FO term) | 7.42e-5 | 6.16e-3 | 7.63e-3 |
| MANIFEST without differentiable GN (, with FO term) | 1.63e-5 | 1.73e-4 | 6.52e-3 |
| Full MANIFEST | 7.46e-6 | 4.47e-5 | 6.56e-3 |
Table 3: IEEE 57-bus AC-OPF raw-prediction ablations. All metrics are evaluated without inference-time restoration.
Including differentiable GN reduces raw equality MAE by 54.2% and maximum equality violation by 74.2%, while maintaining the same reported optimality gap. Importantly, these improvements are measured on raw neural predictions without inference-time restoration, demonstrating that differentiating through the Gauss–Newton iterations during training improves the learned solution map itself, rather than merely correcting its outputs afterward.
2. Geometric distance versus conventional residual. We confirm that both the conventional equality-residual baseline and the geometric-distance baseline exclude the first-order loss, i.e.,
Thus, the reported 36.8% reduction in equality MAE and 73.5% reduction in maximum equality violation are obtained under the same first-order-loss setting. These improvements therefore cannot be attributed to first-order regularization and demonstrate the benefit of the geometric-distance construction in the tested configurations. Furthermore, including the first-order term in full MANIFEST yields additional improvements in raw feasibility.
Together, these results demonstrate the complementary contributions of the geometric-distance loss, first-order regularization, and differentiable Gauss–Newton training to MANIFEST's raw-prediction feasibility. We have incorporated the expanded ablation table and these clarifications into the revised manuscript.
In summary, these experiments demonstrate the importance and critical role of each component in the MANIFEST framework.
We hope that this addresses your remaining concerns.
Thanks for your time and feedback.
Ablation studies:
We have added ablation experiments in Appendix D on the AC-OPF case to demonstrate the contributions of the geometric loss components. Specifically, we examine
(i) the manifold-aware geometric distance loss LD by replacing it with a conventional equality-residual penalty ∣∣g(x,Fθ(x))∣∣22;
(ii) the first-order loss LFO by removing this term and comparing against the full MANIFEST algorithm.
The geometry-aware distance loss reduces equality MAE by approximately 36.8%, maximum equality violation by 73.5%, and optimality gap by 60% compared with the conventional residual loss. Including the first-order loss further substantially improves raw-prediction feasibility and optimality.
QCQP Experiment:
The QCQP is a relatively simpler convex problem, where the additional objective optimization performed by competing methods during inference-time can effectively solve a substantial portion of the QCQP. Their improved post-correction optimality gaps therefore reflect additional optimization beyond the neural prediction, whereas MANIFEST's Gauss–Newton restoration targets only equality feasibility.
Importantly, both baselines' raw predictions and solution after restoration have substantially higher equality violations, so their smaller raw objective gaps do not necessarily indicate better solutions to the constrained problem. MANIFEST achieves over an order of magnitude lower raw equality violations while maintaining a small optimality gap of 0.52%, without further objective optimization.
Further, on the more challenging NLP and nonconvex AC-OPF benchmarks, MANIFEST achieves substantially better raw feasibility and optimality than the baselines (Table 1).
Inference times:
We have updated the manuscript with wall-clock inference comparisons (Table 1), including each method's native correction procedure.
MANIFEST achieves >5× faster total inference than DC3 on QCQP and NLP, and takes less than 0.016 s on the challenging AC-OPF benchmark, including restoration. The measured restoration uses only 3 Gauss–Newton iterations for QCQP/NLP and 11 for AC-OPF. This efficiency stems from shifting geometric feasibility enforcement to offline training, enabling the primal network to produce near-feasible raw predictions that require minimal inference-time correction, unlike competing methods that rely more heavily on post-prediction optimization.
SI-DNN Comparison:
The key distinction is that SI-DNN is a supervised learning approach for AC-OPF that requires optimal solution labels and their sensitivities with respect to problem parameters, obtained by solving the underlying optimization problems and computing the corresponding sensitivities. In contrast, MANIFEST is entirely unsupervised, requiring neither optimal solutions nor sensitivity labels. Further, we provide a feasibility-oriented framework applicable to general nonlinear optimization problems beyond AC-OPF, without the computational burden of generating optimal solution and sensitivity labels.
Our first-order loss (Eq. 13) directly penalizes the parameter-dependent variation of equality-constraint residuals, using Jacobian–vector products computed from the learned network and known constraints. Rather than learning the sensitivity of an optimal solution map, MANIFEST directly learns to preserve feasibility as problem parameters vary, based on the local geometry of the equality-feasible manifold.