From NeurODEs to AutoencODEs: a mean-field control framework for width-varying Neural Networks
Not on the map. Why?
Abstract (arXiv)
The connection between Residual Neural Networks (ResNets) and continuous-time control systems (known as NeurODEs) has led to a mathematical analysis of neural networks which has provided interesting results of both theoretical and practical significance. However, by construction, NeurODEs have been limited to describing constant-width layers, making them unsuitable for modeling deep learning architectures with layers of variable width. In this paper, we propose a continuous-time Autoencoder, which we call AutoencODE, based on a modification of the controlled field that drives the dynamics. This adaptation enables the extension of the mean-field control framework originally devised for conventional NeurODEs. In this setting, we tackle the case of low Tikhonov regularization, resulting in potentially non-convex cost landscapes. While the global results obtained for high Tikhonov regularization may not hold globally, we show that many of them can be recovered in regions where the loss function is locally convex. Inspired by our theoretical findings, we develop a training method tailored to this specific type of Autoencoders with residual connections, and we validate our approach through numerical experiments conducted on various examples.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 25 of its 49 references that are in the map. First posted on arXiv 5 Jul 2023.
Builds on
25 of 49 references.
References · 25
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2015U-Net: Convolutional Networks for Biomedical Image Segmentationcited by 19,604
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2018Neural Ordinary Differential Equationscited by 3,733
- 2017Stable Architectures for Deep Neural Networkscited by 340
- 2019Mean-field theory of two-layers neural networks: dimension-free bounds and kernel limitcited by 187
- 2014Convolutional Neural Networks at Constrained Time Costcited by 81
- 2017Maximum Principle Based Algorithms for Deep Learningcited by 77
- 2017Reversible Architectures for Arbitrarily Deep Residual Neural Networkscited by 69
- 2018A Mean-Field Optimal Control Formulation of Deep Learningcited by 67
- 2019Deep learning as optimal control problems: models and numerical methodscited by 33
- 2021More is Less: Inducing Sparsity via Overparameterizationcited by 22
13 more
- 2023Learning Manifold Dimensions with Conditional Variational Autoencoderscited by 20
- 2020Large-time asymptotics in deep learningcited by 14
- 2021A Measure Theoretical Approach to the Mean-field Maximum Principle for Training NeurODEscited by 11
- 2022Turnpike in optimal control of PDEs, ResNets, and beyondcited by 10
- 2023Designing Stable Neural Networks using Convex Analysis and ODEscited by 10
- 2021Deep Learning Approximation of Diffeomorphisms via Linear-Control Systemscited by 7
- 2019Selection dynamics for deep neural networkscited by 6
- 2021A gradient flow equation for optimal control problems with end-point costcited by 6
- 2021Neural Architecture Search via Bregman Iterationscited by 5
- 2022Optimal Control of ensembles of dynamical systemscited by 5
- 2022Intrinsic dimension estimation for discrete metricscited by 4
- 2022Viability and Exponentially Stable Trajectories for Differential Inclusions in Wasserstein Spacescited by 1
- 2023On the Viability and Invariance of Proper Sets under Continuity Inclusions in Wasserstein Spacescited by 1
Built on by
Citing papers per year: 2023: 2; 2024: 0; 2025: 0; 2026: 1.
3 papers.