Principled Weight Initialisation for Input-Convex Neural Networks
Not on the map. Why?
Abstract (arXiv)
Input-Convex Neural Networks (ICNNs) are networks that guarantee convexity in their input-output mapping. These networks have been successfully applied for energy-based modelling, optimal transport problems and learning invariances. The convexity of ICNNs is achieved by using non-decreasing convex activation functions and non-negative weights. Because of these peculiarities, previous initialisation strategies, which implicitly assume centred weights, are not effective for ICNNs. By studying signal propagation through layers with non-negative weights, we are able to derive a principled weight initialisation for ICNNs. Concretely, we generalise signal propagation theory by removing the assumption that weights are sampled from a centred distribution. In a set of experiments, we demonstrate that our principled initialisation effectively accelerates learning in ICNNs and leads to better generalisation. Moreover, we find that, in contrast to common belief, ICNNs can be trained without skip-connections when initialised correctly. Finally, we apply ICNNs to a real-world drug discovery task and show that they allow for more effective molecular latent space exploration.
Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 21 of its 41 references that are in the map. First posted on arXiv 19 Dec 2023.
Builds on
21 of 41 references.
References · 21
- 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,590
- 2015Fast and Accurate Deep Network Learning by Exponential Linear Units (ELUs)cited by 1,061
- 2013Exact solutions to the nonlinear dynamics of learning in deep linear neural networkscited by 748
- 2013An Empirical Investigation of Catastrophic Forgetting in Gradient-Based Neural Networkscited by 711
- 2017Self-Normalizing Neural Networkscited by 591
- 2016Input Convex Neural Networkscited by 407
- 2014Breaking the Curse of Dimensionality with Convex Neural Networkscited by 329
- 2016Exponential expressivity in deep neural networks through transient chaoscited by 260
- 2019Optimal transport mapping via input convex neural networkscited by 202
- 2016Deep Information Propagationcited by 194
- 2018Dynamical Isometry and a Mean Field Theory of CNNs: How to Train 10,000-Layer Vanilla Convolutional Neural Networkscited by 176
- 2016Toward Deeper Understanding of Neural Networks: The Power of Initialization and a Dual View on Expressivitycited by 138
9 more
- 2015All you need is a good initcited by 124
- 2021Characterizing signal propagation to close the performance gap in unnormalized ResNetscited by 87
- 2017Mean Field Residual Networks: On the Edge of Chaoscited by 83
- 2021Rapid training of deep neural networks without skip connections or normalization layers using Deep Kernel Shapingcited by 51
- 2022Deep Learning without Shortcuts: Shaping the Kernel with Tailored Rectifierscited by 28
- 2023Principled Weight Initialization for Hypernetworkscited by 19
- 2020The Curious Case of Convex Neural Networkscited by 16
- 2021CDiNN -Convex Difference Neural Networkscited by 6
- 2022Learning Invariances with Generalised Input-Convex Neural Networkscited by 3
Built on by
Citing papers per year: 2024: 4; 2025: 2; 2026: 6.
12 papers.
- 2024Optimal Flow Matching: Learning Straight Trajectories in Just One Stepcited by 74
- 2024GNN-VPA: A Variance-Preserving Aggregation Strategy for Graph Neural Networkscited by 5
- 2024DilateQuant: Accurate and Efficient Diffusion Quantization via Weight Dilationcited by 1
- 2026Amortized Maximum Inner Product Search with Learned Support Functionscited by 1
- 2026SOC-ICNN: From Polyhedral to Conic Geometry for Learning Convex Surrogate Functionscited by 1
- 2026Monotonic Kolmogorov-Arnold Networks: A Theoretical and Empirical Study of Monotonicity as an Inductive Biascited by 1
- 2024Gradient Networkscited by 0
- 2025Revisiting Residual Connections: Orthogonal Updates for Stable and Efficient Deep Networkscited by 0
- 2025Beyond Gaussian Initializations: Signal Preserving Weight Initialization for Odd-Sigmoid Activationscited by 0
- 2026A lift for input-convex neural net trainingcited by 0
- 2026Neural Slack Variables for Shape Constraintscited by 0
- 2026Brenier Meets Adversarial Training: Optimal Transport Geometry for Robust Learningcited by 0
- 2026Brenier Meets Adversarial Training: Optimal Transport Geometry for Robust Learning25 Sep 2026
- 2026Monotonic Kolmogorov-Arnold Networks: A Theoretical and Empirical Study of Monotonicity as an Inductive Bias16 Jun 2026
- 2026Neural Slack Variables for Shape Constraints11 Jun 2026
- 2026A lift for input-convex neural net training22 May 2026
- 2026SOC-ICNN: From Polyhedral to Conic Geometry for Learning Convex Surrogate Functions24 Apr 2026
- 2026Amortized Maximum Inner Product Search with Learned Support Functions9 Mar 2026
- 2025Beyond Gaussian Initializations: Signal Preserving Weight Initialization for Odd-Sigmoid Activations27 Sep 2025
- 2025Revisiting Residual Connections: Orthogonal Updates for Stable and Efficient Deep Networks17 May 2025
- 2024DilateQuant: Accurate and Efficient Diffusion Quantization via Weight Dilation22 Sep 2024
- 2024Gradient Networks10 Apr 2024
- 2024Optimal Flow Matching: Learning Straight Trajectories in Just One Step19 Mar 2024
- 2024GNN-VPA: A Variance-Preserving Aggregation Strategy for Graph Neural Networks7 Mar 2024