Universality of approximate message passing algorithms and tensor networks

Analysis of algorithms (68W40) Random matrices (probabilistic aspects) (60B20) Random matrices (algebraic aspects) (15B52) Information theory (general) (94A15)

Cites Work

Unnamed Item
High dimensional robust M-estimation: asymptotic variance via approximate message passing
An iterative construction of solutions of the TAP equations for the Sherrington-Kirkpatrick model
Free probability and random matrices
Rigidity of eigenvalues of generalized Wigner matrices
Metrics on spaces of finite trees
Sharp bounds for sums associated to graphs of matrices
A CLT for a band matrix model
Integration with respect to the Haar measure on unitary, orthogonal and symplectic group
Maxima of entries of Haar distributed matrices
Bulk universality for generalized Wigner matrices
Universality of approximate message passing algorithms
Approximate message passing algorithms for rotationally invariant matrices
Spectral radii of sparse random matrices
Freeness over the diagonal for large random matrices
The likelihood ratio test in high-dimensional logistic regression is asymptotically a rescaled Chi-square
Universality in polytope phase transitions and message passing algorithms
Asymptotically liberating sequences of random unitary matrices
Multidimensional scaling of measures of distance between partitions
Estimation of low-rank matrices via approximate message passing
A theory of solving TAP equations for Ising models with general invariant random matrices
Free Random Variables
A Morita Type Proof of the Replica-Symmetric Formula for SK
Lectures on the Combinatorics of Free Probability
Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing
Finite Sample Analysis of Approximate Message Passing Algorithms
Asymptotic mutual information for the balanced binary stochastic block model
Traffic Distributions and Independence: Permutation Invariant Random Matrices and the Three Notions of Independence
Bayes-Optimal Convolutional AMP
State evolution for approximate message passing with non-separable functions
Algorithmic Analysis and Statistical Estimation of SLOPE via Approximate Message Passing
Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices
State evolution for general approximate message passing algorithms, with applications to spatial coupling
Vector Approximate Message Passing
Capacity lower bound for the Ising perceptron
The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing
Information-Theoretically Optimal Compressed Sensing via Spatial Coupling and Approximate Message Passing
Neighborliness of randomly projected simplices in high dimensions
A CDMA multiuser detection algorithm on the basis of belief propagation
A dynamical mean-field theory for learning in restricted Boltzmann machines
A Unifying Tutorial on Approximate Message Passing
Biwhitening Reveals the Rank of a Count Matrix
Optimal Transport
Universality of Linearized Message Passing for Phase Retrieval With Structured Sensing Matrices
Graph-based Approximate Message Passing Iterations