arXiv:2606. 10682v1 Announce Type: new Abstract: While physics-informed neural networks (PINNs) have shown strong potential for process modeling, physical equations are only enforced as soft constraints during training, and thus, they do not guarantee constraint satisfaction at inference.
By Fateme Mohammad Mohammadi, Hector Budman, Joshua L. Pulsipher
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.
By Shraman Pal, Can Li
arXiv:2605.18618v3 Announce Type: replace-cross
Abstract: Constrained Machine Learning (CML) enables fairness-aware training, physics-informed neural networks, and integration of symbolic domain know...
By Adam Bos\'ak, Andrii Kliachkin, Gilles Bareilles, Allen Gehret, Allahkaram Shafiei, Jana Lep\v{s}ov\'a, Jakub Mare\v{c}ek
The paper presents a scalable learned iterative solver for nonlinear model predictive control (NMPC) that removes dependence on the prediction horizon by exploiting temporal decomposition in the network architecture. It introduces a closed‑loop resampling strategy to align training with deployment, achieving up to four‑fold speedups over IPOPT while maintaining comparable control performance and avoiding constraint violations. The method outperforms the previous monolithic LISCO approach on a CSTR cascade benchmark, scaling to larger problems without increasing network size.
By Lukas L\"uken, Sergio Lucia
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.
By Lukas L\"uken, Sergio Lucia
arXiv:2609.07437v1 Announce Type: cross
Abstract: Physics-informed neural networks (PINNs) represent a growing frontier in using artificial intelligence to solve partial differential equations (PDEs)...
By Xing Guo, Hongwei Tang, Zewei Meng, Yidong Zhang, Shaoqiu Xiao, Feng Liu
arXiv:2607. 00095v1 Announce Type: cross Abstract: Generative models have emerged as scalable surrogates for physical simulation, yet they offer no guarantee that their outputs respect the conservation laws, boundary conditions, and nonlinear invariants that govern the underlying physics.
By Alaina Kolli, Theodoros Xenakis, Utkarsh Utkarsh, Pengfei Cai, Rafael Gomez-Bombarelli, Alan Edelman, Christopher Vincent Rackauckas
arXiv:2601. 10222v2 Announce Type: replace-cross Abstract: Optimization is central to both modern machine learning (ML) and scientific machine learning (SciML), yet the structure of the underlying optimization problems differs substantially across these domains.
By Alena Kopani\v{c}\'akov\'a, Elisa Riccietti
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: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
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
Second-order cone programs (SOCPs) are a fundamental class of convex optimization problems widely applied across engineering domains. Classical interior-point methods are robust and accurate, but thei...