Convexity in ReLU Neural Networks: beyond ICNNs?
Not on the map. Why?
Abstract (arXiv)
Convex functions and their gradients play a critical role in mathematical imaging, from proximal optimization to Optimal Transport. The successes of deep learning has led many to use learning-based methods, where fixed functions or operators are replaced by learned neural networks. Regardless of their empirical superiority, establishing rigorous guarantees for these methods often requires to impose structural constraints on neural architectures, in particular convexity. The most popular way to do so is to use so-called Input Convex Neural Networks (ICNNs). In order to explore the expressivity of ICNNs, we provide necessary and sufficient conditions for a ReLU neural network to be convex. Such characterizations are based on product of weights and activations, and write nicely for any architecture in the path-lifting framework. As particular applications, we study our characterizations in depth for 1 and 2-hidden-layer neural networks: we show that every convex function implemented by a 1-hidden-layer ReLU network can be also expressed by an ICNN with the same architecture; however this property no longer holds with more layers. Finally, we provide a numerical procedure that allows an exact check of convexity for ReLU neural networks with a large number of affine regions.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 31 of its 49 references that are in the map. First posted on arXiv 6 Jan 2025.
Builds on
31 of 49 references.
References · 31
- 2021Convex optimizationcited by 2,479
- 2016Beyond a Gaussian Denoiser: Residual Learning of Deep CNN for Image Denoisingcited by 1,352
- 2020Plug-and-Play Image Restoration with Deep Denoiser Priorcited by 467
- 2016Input Convex Neural Networkscited by 407
- 2016Understanding Deep Neural Networks with Rectified Linear Unitscited by 253
- 2019Optimal transport mapping via input convex neural networkscited by 202
- 2019Deep ReLU Networks Have Surprisingly Few Activation Patternscited by 160
- 2022Neural Optimal Transportcited by 123
- 2017Learning Proximal Operators: Using Denoising Networks for Regularizing Inverse Imaging Problemscited by 107
- 2019Wasserstein-2 Generative Networkscited by 96
- 2021Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 Benchmarkcited by 95
- 2018Optimal Control Via Neural Networks: A Convex Approachcited by 82
19 more
- 2019Reverse-Engineering Deep ReLU Networkscited by 81
- 2020Learning Maximally Monotone Operators for Image Recoverycited by 62
- 2021Towards Lower Bounds on the Depth of ReLU Neural Networkscited by 55
- 2020On transversality of bent hyperplane arrangements and the topological expressiveness of ReLU neural networkscited by 34
- 2018A characterization of proximity operatorscited by 32
- 2023SplineCam: Exact Visualization and Characterization of Deep Network Geometry and Decision Boundariescited by 31
- 2022On amortizing convex conjugates for optimal transportcited by 30
- 2023What's in a Prior? Learned Proximal Networks for Inverse Problemscited by 24
- 2022On the Number of Regions of Piecewise Linear Neural Networkscited by 21
- 2022Algorithmic Determination of the Combinatorial Structure of the Linear Regions of ReLU Neural Networkscited by 21
- 2021An Embedding of ReLU Networks and an Analysis of their Identifiabilitycited by 20
- 2019On approximating nabla f with neural networkscited by 18
- 2023Polyhedral Complex Extraction from ReLU Networks using Edge Subdivisioncited by 14
- 2024On Minimal Depth in Neural Networkscited by 11
- 2023A path-norm toolkit for modern networks: consequences, promises and challengescited by 10
- 2022Approximation speed of quantized vs. unquantized ReLU neural networks and beyondcited by 7
- 2023Learning Gradients of Convex Functions with Monotone Gradient Networkscited by 7
- 2024On a Neural Implementation of Brenier's Polar Factorizationcited by 3
- 2014On the convexity of piecewise-defined functionscited by 2
Built on by
Citing papers per year: 2025: 2; 2026: 4.
6 papers.
- 2025On the Depth of Monotone ReLU Neural Networks and ICNNscited by 11
- 2025Arithmetic Circuits and Neural Networks for Regular Matroidscited by 1
- 2026SOC-ICNN: From Polyhedral to Conic Geometry for Learning Convex Surrogate Functionscited by 1
- 2026Tropical Circuits with Scalar Multiplication Gatescited by 0
- 2026Input convex neural networks as surrogates in mathematical optimisationcited by 0
- 2026Plug-and-Play Methods Provably Converge Even with Improperly Trained Denoisers: Convergence by Architectural Designcited by 0
- 2026Plug-and-Play Methods Provably Converge Even with Improperly Trained Denoisers: Convergence by Architectural Design27 Sep 2026
- 2026Input convex neural networks as surrogates in mathematical optimisation10 Aug 2026
- 2026Tropical Circuits with Scalar Multiplication Gates13 Jul 2026
- 2026SOC-ICNN: From Polyhedral to Conic Geometry for Learning Convex Surrogate Functions24 Apr 2026
- 2025Arithmetic Circuits and Neural Networks for Regular Matroids4 Nov 2025
- 2025On the Depth of Monotone ReLU Neural Networks and ICNNs9 May 2025