mlsanityData to 7 Oct 2026

Teaching Networks to Solve Optimization Problems

arXiv 2202.04104 ↗First posted 8 Feb 2022cs.LGcited by 7

Not on the map. Why?

Abstract (arXiv)

Leveraging machine learning to facilitate the optimization process is an emerging field that holds the promise to bypass the fundamental computational bottleneck caused by classic iterative solvers in critical applications requiring near-real-time optimization. The majority of existing approaches focus on learning data-driven optimizers that lead to fewer iterations in solving an optimization. In this paper, we take a different approach and propose to replace the iterative solvers altogether with a trainable parametric set function, that outputs the optimal arguments/parameters of an optimization problem in a single feed forward. We denote our method as Learning to Optimize the Optimization Process (LOOP). We show the feasibility of learning such parametric (set) functions to solve various classic optimization problems including linear/nonlinear regression, principal component analysis, transport-based coreset, and quadratic programming in supply management applications. In addition, we propose two alternative approaches for learning such parametric functions, with and without a solver in the LOOP. Finally, through various numerical experiments, we show that the trained solvers could be orders of magnitude faster than the classic iterative solvers while providing near optimal solutions.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 16 of its 43 references that are in the map. First posted on arXiv 8 Feb 2022.

Builds on

16 of 43 references.

References · 16

  1. 2017Deep Setscited by 1,394
  2. 2018VoxelMorph: A Learning Framework for Deformable Medical Image Registrationcited by 657
  3. 2016CVXPY: A Python-Embedded Modeling Language for Convex Optimizationcited by 633
  4. 2016Learning to learn by gradient descent by gradient descentcited by 616
  5. 2015Gradient-based Hyperparameter Optimization through Reversible Learningcited by 357
  6. 2021Gradient Projection Memory for Continual Learningcited by 338
  7. 2013Fast Computation of Wasserstein Barycenterscited by 216
  8. 2021Learning to Optimize: A Primer and A Benchmarkcited by 206
  9. 2019Generalized Sliced Wasserstein Distancescited by 205
  10. 2016Learning to Optimizecited by 195
  11. 2017OSQP: An Operator Splitting Solver for Quadratic Programscited by 156
  12. 2017Learned Optimizers that Scale and Generalizecited by 109
4 more
  1. 2021Parameter Prediction for Unseen Deep Architecturescited by 89
  2. 2020DeepOPF: A Feasibility-Optimized Deep Neural Network Approach for AC Optimal Power Flow Problemscited by 45
  3. 2018Wasserstein Measure Coresetscited by 10
  4. 2021SLOSH: Set LOcality Sensitive Hashing via Sliced-Wasserstein Embeddingscited by 9

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 2; 2024: 0; 2025: 3; 2026: 1.

7 papers.