A lift for input-convex neural net training
Not on the map. Why?
Abstract (arXiv)
Input-convex neural nets parametrize the convex potentials of density models and transport maps, and their convexity requires the inter-layer weights to be non-negative. Projected gradient descent enforces this by projecting after each step, and due to mini-batch noise the boundary is re-crossed indefinitely, which leads to an active set the projection never identifies. The differentiable alternative, direct softplus, optimizes a free latent weight through a softplus positivity map whose derivative attenuates the gradient exponentially where the weight is negative---the shoulder---so a coordinate that reaches it stays for an exponentially long time. To keep this unconstrained parametrization without its slow escape, we propose the lift, which replaces the free latent weight by a learnable slack plus an unconstrained network---the body---that takes a permutation-invariant summary of the training batch as input. The latent weight thus varies with the batch before the positivity map, and couples to the gradient formed on it. We show that this coupling enters the variance of the update to the latent weight at first order in the fluctuation, and that the slack, the batch dependence and the shared batch are each needed for it to act. Where the coupling aligns positively with the loss curvature, that variance is larger under the lift than under direct softplus, and a coordinate leaves the shoulder sooner. We compare the lift with the two existing methods on several applications. Where a constrained weight of direct softplus reaches the shoulder and does not leave, the lift fits the target more closely and reaches the same reconstruction about three times sooner. Where almost none reaches it, the methods agree.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 33 of its 50 references that are in the map. First posted on arXiv 22 May 2026.
Builds on
33 of 50 references.
References · 33
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
- 2018A Style-Based Generator Architecture for Generative Adversarial Networkscited by 6,013
- 2017Deep Setscited by 1,421
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,130
- 2016HyperNetworkscited by 1,027
- 2017Masked Autoregressive Flow for Density Estimationcited by 684
- 2016Input Convex Neural Networkscited by 414
- 2019Optimal transport mapping via input convex neural networkscited by 206
- 2015Adding Gradient Noise Improves Learning for Very Deep Networkscited by 145
- 2015Stochastic modified equations and adaptive stochastic gradient algorithmscited by 142
- 2018Adversarial Regularizers in Inverse Problemscited by 103
- 2021Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 Benchmarkcited by 96
21 more
- 2020Convex Potential Flows: Universal Probability Distributions with Optimal Transport and Convex Optimizationcited by 90
- 2022Supervised Training of Conditional Monge Mapscited by 61
- 2020On the representation and learning of monotone triangular transport mapscited by 41
- 2016Asymptotic Optimality in Stochastic Optimizationcited by 38
- 2023Conditional score-based diffusion models for Bayesian inference in infinite dimensionscited by 38
- 2016Parameterized Machine Learning for High-Energy Physicscited by 34
- 2019HINT: Hierarchical Invertible Neural Transport for Density Estimation and Bayesian Inferencecited by 31
- 2022On amortizing convex conjugates for optimal transportcited by 31
- 2022Incremental Learning in Diagonal Linear Networkscited by 28
- 2023Efficient Neural Network Approaches for Conditional Optimal Transport with Applications in Bayesian Inferencecited by 20
- 2022Multivariate Quantile Function Forecastercited by 19
- 2023Principled Weight Initialisation for Input-Convex Neural Networkscited by 12
- 2022An Optimal Transport Formulation of Bayes' Law for Nonlinear Filtering Algorithmscited by 11
- 2022Invertible Monotone Operators for Normalizing Flowscited by 6
- 2022Deep unfolding as iterative regularization for imaging inverse problemscited by 5
- 2024Improving Fairness and Mitigating MADness in Generative Modelscited by 4
- 2024A primal-dual algorithm for image reconstruction with input-convex neural network regularizerscited by 3
- 2025Sample and Map from a Single Convex Potential: Generation using Conjugate Moment Measurescited by 2
- 2026Dual-space posterior sampling for Bayesian inference in constrained inverse problemscited by 2
- 2026Hyper Input Convex Neural Networks for Shape Constrained Learning and Optimal Transportcited by 2
- 2026Hypernetwork-based approach for grid-independent functional data clusteringcited by 1
Built on by
Not cited yet.