Cheap Thrills: Effective Amortized Optimization Using Inexpensive Labels
Authors: Khai Nguyen, Petros Ellinas, Anvita Bhagavathula, Priya Donti arXiv: 2603.05495 PDF: https://arxiv.org/pdf/2603.05495.pdf Categories: cs.LG, math.OC
Abstract (from the paper)
> To scale the solution of optimization and simulation problems, prior work has explored machine-learning surrogates that inexpensively map problem parameters to corresponding solutions. Commonly used approaches, including supervised and self-supervised learning with either soft or hard feasibility enforcement, face inherent challenges such as reliance on expensive, high-quality labels or difficult optimization landscapes. To address their trade-offs, we propose a novel framework that first collects "cheap" imperfect labels, then performs supervised pretraining, and finally refines the model through self-supervised learning to improve overall performance. Our theoretical analysis and merit-based criterion show that labeled data need only place the model within a basin of attraction, confirming...
Key points
- Field: Machine learning (ML), with relevance to optimization (math.OC).
- Problem: ML surrogates for optimization/simulation face a trade-off — supervised methods need expensive high-quality labels; self-supervised methods can have hard-to-navigate optimization landscapes.
- Proposed method: A three-stage framework: 1. Collect "cheap" imperfect labels, 2. Perform supervised pretraining, 3. Refine the model via self-supervised learning.
- Theory: The authors' theoretical analysis and merit-based criterion show that labeled data only need to place the model within a basin of attraction — inexpensive labels are sufficient.
- Abstract: https://arxiv.org/abs/2603.05495
- PDF: https://arxiv.org/pdf/2603.05495.pdf