REVIEW 5 cited by
Learning Constrained Optimization with Deep Augmented Lagrangian Methods
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Learning to Optimize (LtO) is a problem setting in which a machine learning (ML) model is trained to emulate a constrained optimization solver. Learning to produce optimal and feasible solutions subject to complex constraints is a difficult task, but is often made possible by restricting the input space to a limited distribution of related problems. Most LtO methods focus on directly learning solutions to the primal problem, and applying correction schemes or loss function penalties to encourage feasibility. This paper proposes an alternative approach, in which the ML model is trained instead to predict dual solution estimates directly, from which primal estimates are constructed to form dual-feasible solution pairs. This enables an end-to-end training scheme is which the dual objective is maximized as a loss function, and solution estimates iterate toward primal feasibility, emulating a Dual Ascent method. First it is shown that the poor convergence properties of classical Dual Ascent are reflected in poor convergence of the proposed training scheme. Then, by incorporating techniques from practical Augmented Lagrangian methods, we show how the training scheme can be improved to learn highly accurate constrained optimization solvers, for both convex and nonconvex problems.
Forward citations
Cited by 5 Pith papers
-
Training with Hard Constraints: Learning Neural Certificates and Controllers for SDEs
Neural reach-avoid certificates for SDEs can be trained with hard guarantees via a bound-based loss, or with PAC guarantees via scenario optimization on the last layer.
-
PGLearn -- An Open-Source Learning Toolkit for Optimal Power Flow
PGLearn provides a large open-source dataset collection and toolkit with AC, DC, and SOC-OPF primal and dual solutions, time-series data for large grids, and benchmarking tools for ML-based OPF methods.
-
Large-scale portfolio optimization with variational neural annealing
VNA produces Sharpe-ratio-competitive portfolios on indices up to 2,008 assets, but the claimed speed advantage and universal finite-size scaling are not robustly supported.
-
Deep Uzawa for Kinetic Transport with Lagrange-Enforced Boundaries
A Lagrange-multiplier Uzawa iteration with neural-network trial functions is developed for stationary transport, with continuum convergence proofs and five qualitative numerical examples.
-
Learning to Optimize by Differentiable Programming
A tutorial survey of differentiable-programming-based first-order optimization, with dual-based PyTorch case studies and no new results.
Discussion (0). Sign in to comment.