arXiv Machine Learning
Equilibrium bias and convergence in augmented primal--dual dynamics with sampled constraints
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
Jul 13
Nonconvex Composite Functional Constraints via First-Order Augmented Lagrangian Methods under Local Regularity
arXiv:2607. 08954v1 Announce Type: cross Abstract: We study nonasymptotic convergence of primal-dual methods for a class of nonconvex constrained optimization problems with a convex-composite structure.
arXiv AI
Sep 2
Operational Regimes in Non-Convex Optimization: A Multiplier-Based Taxonomy
arXiv:2609.00471v1 Announce Type: cross Abstract: This paper introduces a structural taxonomy for constrained non-convex optimization based on the signature of Lagrange multipliers at KKT stationary...
arXiv Machine Learning
Jul 3
A Unified Lyapunov-IQC Framework for Uniform Stability of Smooth Quadratic First-Order Accelerated Optimizers
arXiv:2605. 08488v2 Announce Type: replace-cross Abstract: We develop a unified Lyapunov-integral quadratic constraint (IQC) framework for establishing uniform stability of first-order accelerated optimization algorithms in the $\beta$-smooth and $\gamma$-strongly convex regime.
arXiv Machine Learning
Jun 8
Residual-Controlled Multiplier Learning for Stochastic Constrained Decision-Making
arXiv:2606. 07088v1 Announce Type: new Abstract: Stochastic constrained decision-making requires optimizing performance objectives while enforcing statistical requirements such as safety or fairness.
arXiv Machine Learning
Jun 29
Second-Order KKT Guarantees for Bregman ADMM in Nonconvex and Non-Lipschitz Optimization
arXiv:2606. 28307v1 Announce Type: cross Abstract: We analyze Bregman ADMM for nonconvex linearly constrained problems under two-sided relative smoothness, a condition that replaces the standard Lipschitz gradient assumption with a Hessian comparison relative to a Bregman kernel.
arXiv AI
Jul 1
AI-Assisted Discovery of Convex Relaxations via Dual Agents
arXiv:2606. 31182v1 Announce Type: new Abstract: Recent work shows that LLM agents can improve sharp-constant inequalities by searching for extremal constructions, which yield upper bounds.