Dissipative residual layers for unsupervised implicit parameterization of data manifolds
Not on the map. Why?
Abstract (arXiv)
We propose an unsupervised technique for implicit parameterization of data manifolds. In our approach, the data is assumed to belong to a lower dimensional manifold in a higher dimensional space, and the data points are viewed as the endpoints of the trajectories originating outside the manifold. Under this assumption, the data manifold is an attractive manifold of a dynamical system to be estimated. We parameterize such a dynamical system with a residual neural network and propose a spectral localization technique to ensure it is locally attractive in the vicinity of data. We also present initialization and additional regularization of the proposed residual layers. % that we call dissipative bottlenecks. We mention the importance of the considered problem for the tasks of reinforcement learning and support our discussion with examples demonstrating the performance of the proposed layers in denoising and generative tasks.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 15 of its 18 references that are in the map. First posted on arXiv 13 Oct 2022.
Builds on
15 of 18 references.
References · 15
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
- 2018Neural Ordinary Differential Equationscited by 3,779
- 2016Identity Mappings in Deep Residual Networkscited by 1,965
- 2018Robustness May Be at Odds with Accuracycited by 880
- 2018A Convergence Theory for Deep Learning via Over-Parameterizationcited by 787
- 2019Augmented Neural ODEscited by 397
- 2017Safe Model-based Reinforcement Learning with Stability Guaranteescited by 366
- 2021A Universal Law of Robustness via Isoperimetrycited by 151
- 2018Constructing Unrestricted Adversarial Examples with Generative Modelscited by 135
- 2017Spurious Local Minima are Common in Two-Layer ReLU Neural Networkscited by 104
- 2018Overparameterized Nonlinear Learning: Gradient Descent Takes the Shortest Path?cited by 88
- 2018A Mean-Field Optimal Control Formulation of Deep Learningcited by 67
3 more
Built on by
Not cited yet.