Why are deep nets reversible: A simple theory, with implications for training
Not on the map. Why?
Abstract (arXiv)
Generative models for deep learning are promising both to improve understanding of the model, and yield training methods requiring fewer labeled samples. Recent works use generative model approaches to produce the deep net's input given the value of a hidden layer several levels above. However, there is no accompanying "proof of correctness" for the generative model, showing that the feedforward deep net is the correct inference method for recovering the hidden layer given the input. Furthermore, these models are complicated. The current paper takes a more theoretical tack. It presents a very simple generative model for RELU deep nets, with the following characteristics: (i) The generative model is just the reverse of the feedforward net: if the forward transformation at a layer is A then the reverse transformation is AT. (This can be seen as an explanation of the old weight tying idea for denoising autoencoders.) (ii) Its correctness can be proven under a clean theoretical assumption: the edge weights in real-life deep nets behave like random numbers. Under this assumption ---which is experimentally tested on real-life nets like AlexNet--- it is formally proved that feed forward net is a correct inference method for recovering the hidden layer. The generative model suggests a simple modification for training: use the generative model to produce synthetic data with labels and include it in the training set. Experiments are shown to support this theory of random-like deep nets; and that it helps the training.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 18 Nov 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 2.
5 papers.
- 2021Privacy Vulnerability of Split Computing to Data-Free Model Inversion Attackscited by 8
- 2023Combining Explicit and Implicit Regularization for Efficient Learning in Deep Networkscited by 4
- 2021Achieving Explainability for Plant Disease Classification with Disentangled Variational Autoencoderscited by 1
- 2022Learning to Censor by Noisy Samplingcited by 0
- 2023Manifold-Preserving Transformers are Effective for Short-Long Range Encodingcited by 0
- 2023Manifold-Preserving Transformers are Effective for Short-Long Range Encoding22 Oct 2023
- 2023Combining Explicit and Implicit Regularization for Efficient Learning in Deep Networks1 Jun 2023
- 2022Learning to Censor by Noisy Sampling23 Mar 2022
- 2021Privacy Vulnerability of Split Computing to Data-Free Model Inversion Attacks13 Jul 2021
- 2021Achieving Explainability for Plant Disease Classification with Disentangled Variational Autoencoders5 Feb 2021