mlsanityData to 7 Oct 2026

Dual Certified White-Box Inference for Input Convex Neural Networks

arXiv 2605.04722 ↗First posted 6 May 2026cs.LG cs.AI math.OCcited by 0

Not on the map. Why?

Abstract (arXiv)

Input convex neural networks (ICNNs) are used to learn convex objectives whose minimizers define decisions, making efficient and reliable optimization central to inference. At nonsmooth inputs, automatic differentiation returns a single derivative rather than the full subdifferential governing optimality and descent. Second-order cone ICNNs (SOC-ICNNs) admit an exact representation as value functions of parametric second-order cone programs, providing a white-box approach to recovering their full subdifferentials from optimal dual multipliers and deriving explicit Hessians on smooth regions. Building on this representation, we develop dual-certified inference (DCI), which combines the network and feasible set geometries to obtain exact stationarity certificates and tangent common descent directions. DCI uses local curvature for Newton acceleration and an exact proximal safeguard. We establish global convergence and, under standard regularity conditions, local quadratic convergence near structurally nondegenerate interior minimizers. Numerical experiments validate the recovered geometry and demonstrate the reliability and efficiency of DCI. Code is avaliable at https://anonymous.4open.science/r/DCI-ICNN-507D/

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 16 of its 30 references that are in the map. First posted on arXiv 6 May 2026.

Builds on

16 of 30 references.

References · 16

  1. 2021Convex optimizationcited by 2,479
  2. 2016Input Convex Neural Networkscited by 407
  3. 2019Optimal transport mapping via input convex neural networkscited by 202
  4. 2014From Predictive to Prescriptive Analyticscited by 142
  5. 2021Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 Benchmarkcited by 95
  6. 2020Convex Potential Flows: Universal Probability Distributions with Optimal Transport and Convex Optimizationcited by 89
  7. 2020A mathematical model for automatic differentiation in machine learningcited by 44
  8. 2021Nonsmooth Implicit Differentiation for Machine Learning and Optimizationcited by 43
  9. 2020Input Convex Neural Networks for Building MPCcited by 17
  10. 2017A Semismooth Newton Method for Fast, Generic Convex Programmingcited by 5
  11. 2022A Semismooth Newton Stochastic Proximal Point Algorithm with Variance Reductioncited by 5
  12. 2022On the complexity of nonsmooth automatic differentiationcited by 4
4 more
  1. 2023On the Correctness of Automatic Differentiation for Neural Networks with Machine-Representable Parameterscited by 3
  2. 2023A Specialized Semismooth Newton Method for Kernel-Based Optimal Transportcited by 1
  3. 2024A quadratically convergent semismooth Newton method for nonlinear semidefinite programming without generalized Jacobian regularitycited by 1
  4. 2026SOC-ICNN: From Polyhedral to Conic Geometry for Learning Convex Surrogate Functionscited by 1

Built on by

Not cited yet.