REVIEW 12 cited by
End-to-End Constrained Optimization Learning: A Survey
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
Signed reviews
read the original abstract
This paper surveys the recent attempts at leveraging machine learning to solve constrained optimization problems. It focuses on surveying the work on integrating combinatorial solvers and optimization methods with machine learning architectures. These approaches hold the promise to develop new hybrid machine learning and optimization methods to predict fast, approximate, solutions to combinatorial problems and to enable structural logical inference. This paper presents a conceptual review of the recent advancements in this emerging area.
Forward citations
Cited by 12 Pith papers
-
How much data is sufficient to learn high-performing algorithms? Generalization guarantees for data-driven algorithm design
A single pseudo-dimension theorem covers any parameterized algorithm whose performance is piecewise constant, linear, or piecewise structured in its parameters, recovering prior bounds and yielding new ones for comput...
-
Optimization with Dynamic Constraint Learning (DCL)
DCL replaces a single global surrogate of an unqueryable constraint with a sequence of locally fitted surrogates and data-hull trust regions, matching global-model solutions on three examples with simpler subproblems.
-
Improving Access to Essential Medicines via Decision-Aware Machine Learning
A decision-aware ML system for allocating essential medicines, evaluated in a staggered nationwide deployment in Sierra Leone, increased measured consumption of allocated products by roughly 19% in treated districts.
-
Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints
RA-SQP achieves optimal O(epsilon^-4) gradient and O(epsilon^-2) linear-system complexity for equality-constrained stochastic optimization, and handles general nonlinear constraints via robust subproblems.
-
A General Approach of Automated Environment Design for Learning the Optimal Power Flow
Automated multi-objective HPO over 15 environment design choices produces RL-OPF environments that dominate a manual baseline, with objective differencing, action autoscaling, and mixed real/random training data as th...
-
mPOLICE: Provable Enforcement of Multi-Region Affine Constraints in Deep Neural Networks
mPOLICE generalizes POLICE to enforce exact affine output constraints inside multiple disjoint convex regions of a ReLU network's input by giving each region its own activation pattern.
-
DFF: Decision-Focused Fine-tuning for Smarter Predict-then-Optimize with Limited Data
Decision-Focused Fine-tuning corrects any backbone predictor's outputs within a bounded trust region using a residual scaling layer, improving decision regret on predict-then-optimize tasks.
-
Soft-Constrained Optimization of Latent Space in Variational Autoencoders
An entropy soft-constraint raises VAE latent capacity and a weight filter prunes unused dimensions, improving activation and FactorVAE scores on dSprites and cutting MNIST latent dim from 10 to 2.
-
Decision-Focused Learning Enhanced by Automated Feature Engineering for Energy Storage Optimisation
On 55 days of UK household data, SPO+ decision-focused learning with automated features gave the lowest battery-scheduling regret, though gains over no-AFE were not statistically robust.
-
ASTER: Adaptive Spatio-Temporal Early Decision Model for Dynamic Resource Allocation
ASTER couples a resource-aware spatio-temporal encoder with a multi-objective reinforcement learning agent to jointly predict incidents and dispatch emergency resources, claiming better outcomes than decoupled predict...
-
Flow-Through Tensors: A Unified Computational Graph Architecture for Multi-Layer Transportation Network Optimization
A tensor computational graph that chains OD flows, path flows, link flows, and travel times, plus a two-route rotation theorem showing Pareto gains from alternating route assignments.
-
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). Continue with ORCID to comment.