LGFeb 8, 2022

Teaching Networks to Solve Optimization Problems

arXiv:2202.04104v214 citations
AI Analysis

This addresses the need for near-real-time optimization in critical applications by offering a faster alternative to iterative methods, though it is incremental as it builds on existing machine learning approaches to optimization.

The paper tackles the computational bottleneck of classic iterative optimization solvers by proposing LOOP, a method that replaces them with a trainable parametric set function to output optimal solutions in a single feed-forward pass. The result shows that trained solvers can be orders of magnitude faster while providing near-optimal solutions across various optimization problems.

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.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes