arXiv Machine Learning
Self-Supervised Combinatorial Optimization with Constraints via Frank-Wolfe
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Jun 16
Self-Supervised Learning of Iterative Solvers for Constrained Optimization
arXiv:2409. 08066v3 Announce Type: replace Abstract: The real-time solution of parametric optimization problems is critical for applications that demand high accuracy under tight real-time constraints, such as model predictive control.
arXiv Machine Learning
Jun 2
Learning-Augmented Scalable Linear Assignment Problem Optimization via Neural Dual Warm-Starts
arXiv:2605. 09382v2 Announce Type: replace Abstract: The Linear Assignment Problem is a fundamental combinatorial optimization task where classical exact solvers ensure optimality but suffer from an $\mathcal{O}(N^{3})$ bottleneck, while recent neural approximations struggle with scalability and exactness.
arXiv AI
Aug 28
CG4AI: A Column Generation Framework for Training AI Models Under Constraints
CG4AI is a column generation framework that trains AI models while enforcing linear constraints on their outputs. It constructs a convex combination of models, using a master linear program to set mixture weights and a pricing subproblem to generate new models guided by dual variables, focusing on the most violated constraints. The method is applied to MNIST digit classification—demonstrating constraint learning, adversarial robustness, error correction, and output relabeling—and to multi‑commodity flow routing, achieving feasible predictors with higher accuracy than single‑model baselines.
arXiv Machine Learning
Jul 2
Neural Certificate Pricing for Combinatorial Optimization Problems
arXiv:2607. 01185v1 Announce Type: new Abstract: Combinatorial optimization (CO) problems are difficult because certifiable discrete structure induces exponential search.
arXiv Machine Learning
Sep 16
Learning efficient representations of complex constraints for scalable optimization
The paper introduces PolyFormer, a physics-informed machine learning framework that learns compact polytopic representations of complex constraints. By transforming constraint-induced geometry into efficient polytopic reformulations, PolyFormer reduces optimization complexity and enables the use of standard solvers. Evaluations on large‑scale resource aggregation, network‑constrained optimization, and uncertainty‑aware optimization show up to 6,400‑fold speedups and 99.87% memory savings while keeping feasibility and objective errors low.
arXiv Machine Learning
Aug 11
Input convex neural networks as surrogates in mathematical optimisation
arXiv:2608. 09707v1 Announce Type: cross Abstract: Embedding trained neural networks as surrogates within optimisation problems is an established practice in operations research.