arXiv AI By Merve Karakas, Christopher J. Williams, Emmanuel O. Balogun, Sadegh Sadeghi Tabas, Christian Brown, Nikhil Rao

Multi-ResNets for Subspace Preconditioning in Constrained Optimization

Read the original on arXiv AI →

arXiv:2606. 06300v1 Announce Type: new Abstract: We propose MResOpt, a staged residual neural network architecture for constrained optimization problems.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

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...

By Yang Zhao, Jungeun Lee, Jeong hwan Jeon, Sze Zheng Yong
arXiv Machine Learning
1d ago

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.

By Trinh Tran, Binh Nguyen, Truong X. Nghiem
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.

By Yilin Wen, Yi Guo, Bo Zhao, Wei Qi, Zechun Hu, Colin Jones, Jian Sun
arXiv AI
Jun 12

PolyFlow: Safe and Efficient Polytope-Constrained Flow Matching with Constraint Embedding and Projection-free Update

arXiv:2606. 13400v1 Announce Type: cross Abstract: While flow-based generative models have demonstrated strong performance across a wide range of domains, deploying them in safety-critical physical systems remains challenging due to strict constraint requirements.

By Jianming Ma, Qiyue Yang, Yang Zhang, Liyun Yan, Zhanxiang Cao, Yazhou Zhang, Yue Gao