Inference in Deep Networks in High Dimensions
Not on the map. Why?
Abstract (arXiv)
Deep generative networks provide a powerful tool for modeling complex data in a wide range of applications. In inverse problems that use these networks as generative priors on data, one must often perform inference of the inputs of the networks from the outputs. Inference is also required for sampling during stochastic training on these generative models. This paper considers inference in a deep stochastic neural network where the parameters (e.g., weights, biases and activation functions) are known and the problem is to estimate the values of the input and hidden units from the output. While several approximate algorithms have been proposed for this task, there are few analytic tools that can provide rigorous guarantees in the reconstruction error. This work presents a novel and computationally tractable output-to-input inference method called Multi-Layer Vector Approximate Message Passing (ML-VAMP). The proposed algorithm, derived from expectation propagation, extends earlier AMP methods that are known to achieve the replica predictions for optimality in simple linear inverse problems. Our main contribution shows that the mean-squared error (MSE) of ML-VAMP can be exactly predicted in a certain large system limit (LSL) where the numbers of layers is fixed and weight matrices are random and orthogonally-invariant with dimensions that grow to infinity. ML-VAMP is thus a principled method for output-to-input inference in deep networks with a rigorous and precise performance achievability result in high dimensions.
Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). First posted on arXiv 20 Jun 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 5; 2022: 4; 2023: 1; 2024: 2.
12 papers.
- 2021Robust Compressed Sensing MRI with Deep Generative Priorscited by 284
- 2021Instance-Optimal Compressed Sensing via Posterior Samplingcited by 43
- 2021Graph-based Approximate Message Passing Iterationscited by 35
- 2022Bringing Your Own View: Graph Contrastive Learning without Prefabricated Data Augmentationscited by 28
- 2022Theoretical Perspectives on Deep Learning Methods in Inverse Problemscited by 22
- 2021Deep learning via message passing algorithms based on belief propagationcited by 12
- 2024Injectivity capacity of ReLU gatescited by 4
- 2022Fundamental Limits of Two-layer Autoencoders, and Achieving Them with Gradient Methodscited by 3
- 2024Unifying AMP Algorithms for Rotationally-Invariant Modelscited by 3
- 2022Analysis of Random Sequential Message Passing Algorithms for Approximate Inferencecited by 1
- 2021Towards Designing Optimal Sensing Matrices for Generalized Linear Inverse Problemscited by 0
- 2023Estimation of embedding vectors in high dimensionscited by 0
- 2024Unifying AMP Algorithms for Rotationally-Invariant Models2 Dec 2024
- 2024Injectivity capacity of ReLU gates28 Oct 2024
- 2023Estimation of embedding vectors in high dimensions12 Dec 2023
- 2022Fundamental Limits of Two-layer Autoencoders, and Achieving Them with Gradient Methods27 Dec 2022
- 2022Theoretical Perspectives on Deep Learning Methods in Inverse Problems29 Jun 2022
- 2022Analysis of Random Sequential Message Passing Algorithms for Approximate Inference16 Feb 2022
- 2022Bringing Your Own View: Graph Contrastive Learning without Prefabricated Data Augmentations4 Jan 2022
- 2021Towards Designing Optimal Sensing Matrices for Generalized Linear Inverse Problems5 Nov 2021
- 2021Deep learning via message passing algorithms based on belief propagation27 Oct 2021
- 2021Graph-based Approximate Message Passing Iterations24 Sep 2021
- 2021Robust Compressed Sensing MRI with Deep Generative Priors3 Aug 2021
- 2021Instance-Optimal Compressed Sensing via Posterior Sampling21 Jun 2021