arXiv Machine Learning
Jun 9
LEAF: A Learning-Enabled ADMM Framework for Accelerated Convex Optimization
arXiv:2606. 08993v1 Announce Type: new Abstract: We propose LEAF, a learning-enabled ADMM framework for accelerated convex optimization.
HUANet: Hard-Constrained Unrolled ADMM for Constrained Convex Optimization
HUANet is a deep neural network architecture that unrolls the Alternating Direction Method of Multipliers (ADMM) into a trainable model for accelerating parametric constrained convex optimization. It embeds a hard‑constrained neural network in each ADMM iteration, using a differentiable correction stage to enforce affine equalities of the primal subproblem. The method also incorporates first‑order optimality conditions into a self‑supervised training loss, and numerical experiments on benchmark problems and a control application demonstrate its effectiveness in speeding up constrained convex optimization.
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 15
Neural Slack Variables for Shape Constraints
arXiv:2606. 13803v1 Announce Type: new Abstract: Enforcing functional inequality constraints such as monotonicity and convexity in neural networks is a fundamental challenge in many industrial and scientific applications.
arXiv Machine Learning
Sep 23
CAffNet: Hard Constraint-Affine Neural Networks
arXiv:2605.24437v2 Announce Type: replace Abstract: We present a novel framework for embedding hard constraint satisfaction into neural network (NN) architectures, specifically feedforward neural net...
arXiv Machine Learning
Jun 2
Towards Simple and Provable Parameter-Free Adaptive Gradient Methods
arXiv:2412. 19444v2 Announce Type: replace Abstract: Optimization algorithms such as AdaGrad and Adam have significantly advanced the training of deep models by dynamically adjusting the learning rate during the optimization process.
arXiv Machine Learning
Jun 5
Learning to optimize with guarantees: a complete characterization of linearly convergent algorithms
arXiv:2508. 00775v2 Announce Type: replace-cross Abstract: The design of many classical optimization algorithms is driven by the certification of linear convergence rates over classes of optimization problems.
arXiv Machine Learning
Jun 19
Deep-Unfolded Coordination
arXiv:2606. 19920v1 Announce Type: cross Abstract: Distributed optimization is a highly scalable and structurally transparent technique to solve multi-agent robotics problems; however, such methods often suffer from the need for highly-specialized, problem-specific hyperparameter tunings.
arXiv Machine Learning
Jun 19
DisjunctiveNet: Neural Symbolic Learning via Differentiable Convexified Optimization Layers
arXiv:2605. 30456v2 Announce Type: replace Abstract: Many learning tasks in science and engineering are characterized by sparse datasets, which limits the effectiveness of purely data-driven approaches.
arXiv Machine Learning
Aug 4
Simplified Quadratic Gradient: A Unified Framework Bridging Gradient Descent and Newton-Type Methods by Synthesizing Hessians and Gradients
arXiv:2209. 03282v5 Announce Type: replace-cross Abstract: Accelerating the convergence of second-order optimization, particularly Newton-type methods, remains a pivotal challenge in algorithmic research.
arXiv Machine Learning
Aug 11
Generalized Convexity and Smoothness via Conjugate Duality: Optimization Theory for Deep Neural Networks
arXiv:2608. 09523v1 Announce Type: new Abstract: Deep neural network (DNN) training with stochastic gradient descent (SGD) and its variants achieves strong empirical performance, yet classical optimization theory does not fully explain this success.
arXiv Machine Learning
Jun 30
Not All Objectives Are Born Equal: Priority-Constrained Descent for Hierarchical Multi-Objective Optimization
arXiv:2606. 29521v1 Announce Type: new Abstract: Deep learning problems rarely involve objectives that are equal in importance.
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.