Universality of approximate message passing algorithms and tensor networks
From MaRDI portal
Recommendations
- Universality of approximate message passing algorithms
- Universality of approximate message passing with semirandom matrices
- Approximate message passing algorithms for rotationally invariant matrices
- State evolution for general approximate message passing algorithms, with applications to spatial coupling
- A Unifying Tutorial on Approximate Message Passing
Cites work
- A CDMA multiuser detection algorithm on the basis of belief propagation
- A CLT for a band matrix model
- A dynamical mean-field theory for learning in restricted Boltzmann machines
- A Morita type proof of the replica-symmetric formula for SK
- A theory of solving TAP equations for Ising models with general invariant random matrices
- A Unifying Tutorial on Approximate Message Passing
- Algorithmic Analysis and Statistical Estimation of SLOPE via Approximate Message Passing
- An iterative construction of solutions of the TAP equations for the Sherrington-Kirkpatrick model
- Approximate message passing algorithms for rotationally invariant matrices
- Asymptotic mutual information for the balanced binary stochastic block model
- Asymptotically liberating sequences of random unitary matrices
- Bayes-Optimal Convolutional AMP
- Biwhitening Reveals the Rank of a Count Matrix
- Bulk universality for generalized Wigner matrices
- Capacity lower bound for the Ising perceptron
- Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices
- Estimation of low-rank matrices via approximate message passing
- Finite Sample Analysis of Approximate Message Passing Algorithms
- Free Random Variables
- Freeness over the diagonal for large random matrices
- Graph-based Approximate Message Passing Iterations
- High dimensional robust M-estimation: asymptotic variance via approximate message passing
- scientific article; zbMATH DE number 765034 (Why is no real title available?)
- Information-Theoretically Optimal Compressed Sensing via Spatial Coupling and Approximate Message Passing
- Integration with respect to the Haar measure on unitary, orthogonal and symplectic group
- Lectures on the Combinatorics of Free Probability
- Maxima of entries of Haar distributed matrices
- Metrics on spaces of finite trees
- Multidimensional scaling of measures of distance between partitions
- Neighborliness of randomly projected simplices in high dimensions
- Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing
- Optimal Transport
- Rigidity of eigenvalues of generalized Wigner matrices
- Sharp bounds for sums associated to graphs of matrices
- Spectral radii of sparse random matrices
- State evolution for approximate message passing with non-separable functions
- State evolution for general approximate message passing algorithms, with applications to spatial coupling
- The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing
- The likelihood ratio test in high-dimensional logistic regression is asymptotically a rescaled Chi-square
- Traffic distributions and independence: permutation invariant random matrices and the three notions of independence
- Universality in polytope phase transitions and message passing algorithms
- Universality of approximate message passing algorithms
- Universality of Linearized Message Passing for Phase Retrieval With Structured Sensing Matrices
- Vector Approximate Message Passing
Cited in
(13)- Universality of approximate message passing with semirandom matrices
- Matrix denoising: Bayes-optimal estimators via low-degree polynomials
- Optimality of approximate message passing for spiked matrix models with rotationally invariant noise
- Fundamental limits of community detection from multi-view data: multi-layer, dynamic and partially labeled block models
- Causal effect estimation under network interference with mean-field methods
- Elliptic approximate message passing and an application to theoretical ecology
- Spectral estimators for structured generalized linear models via approximate message passing
- Entrywise dynamics and universality of general first order methods
- A leave-one-out approach to approximate message passing
- Spectrum-aware debiasing: a modern inference framework with applications to principal components regression
- Differentially private learning beyond the classical dimensionality regime
- Universality of estimators for high-dimensional linear models with block dependency
- A nonasymptotic distributional theory of approximate message passing for sparse and robust regression
This page was built for publication: Universality of approximate message passing algorithms and tensor networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6616879)
