arXiv:2606. 05247v1 Announce Type: new Abstract: Enforcing nonlinear inequality constraints in neural networks remains challenging, especially when the output is subject to many coupled constraints.
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:2512.20270v2 Announce Type: replace-cross Abstract: Many engineering tasks require solving families of nonlinear constrained optimization problems, parametrized in setting-specific variables. T...
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.
arXiv:2606. 19652v1 Announce Type: new Abstract: In this work, we introduce a training procedure for shallow neural networks that promotes robustness against adversarial attacks.
arXiv:2609.34628v2 Announce Type: replace-cross Abstract: Neural network verification (NNV) formally verifies that a network satisfies a specified property for all inputs within a defined region. Mod...
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.
The article "Constraint Learning by Optimizing over Trained Neural Networks: A Pragmatic Tutorial" discusses the emerging paradigm of embedding trained machine learning models, particularly neural networks, into optimization problems. It explains how constraints can be learned from data or objectives approximated to simplify models, while addressing challenges of size and speed. The tutorial offers practical guidance and demonstrates benefits through a case study that shows smaller, sparser networks can improve efficiency.
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.
The paper introduces the Directional Influence Function (DIF), a new estimator for measuring how training samples affect the solution of constrained learning problems. DIF incorporates constraints directly by formulating optimality conditions as a variational inequality, thereby avoiding the bias seen in classical influence functions. Experiments on constrained linear regression and fairness‑constrained CNNs show that DIF accurately predicts changes in test loss and aligns closely with actual retraining results.
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: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.