Universality of approximate message passing with semirandom matrices
From MaRDI portal
Publication:6142946
DOI10.1214/23-aop1628arXiv2204.04281OpenAlexW4386747131MaRDI QIDQ6142946
No author found.
Publication date: 23 January 2024
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2204.04281
Analysis of algorithms (68W40) Random matrices (probabilistic aspects) (60B20) Disordered systems (random Ising models, random Schrödinger operators, etc.) in equilibrium statistical mechanics (82B44) Statistical mechanics of random media, disordered materials (including liquid crystals and spin glasses) (82D30) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Limiting empirical singular value distribution of restrictions of discrete Fourier transform matrices
- Limit of the smallest eigenvalue of a large dimensional sample covariance matrix
- Local semicircle law and complete delocalization for Wigner random matrices
- On the distribution of the roots of certain symmetric matrices
- Necessary and sufficient conditions for almost sure convergence of the largest eigenvalue of a Wigner matrix
- The jackknife estimate of variance
- Limit laws for random matrices and free products
- Universality of approximate message passing algorithms
- Approximate message passing algorithms for rotationally invariant matrices
- Surprises in high-dimensional ridgeless least squares interpolation
- The likelihood ratio test in high-dimensional logistic regression is asymptotically a rescaled Chi-square
- Universality in polytope phase transitions and message passing algorithms
- Counting the faces of randomly-projected hypercubes and orthants, with applications
- Asymptotically liberating sequences of random unitary matrices
- Isotropic local laws for sample covariance and generalized Wigner matrices
- Universality in Sherrington-Kirkpatrick's spin glass model
- Estimation of low-rank matrices via approximate message passing
- Concentration Inequalities
- Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing
- Information, Physics, and Computation
- A Problem in Geometric Probability.
- Mean-field equations for spin models with orthogonal interaction matrices
- Replica field theory for deterministic models. II. A non-random spin glass with glassy behaviour
- Spectral Method for Phase Retrieval: An Expectation Propagation Perspective
- State evolution for approximate message passing with non-separable functions
- Householder Dice: A Matrix-Free Algorithm for Simulating Dynamics on Gaussian and Random Orthogonal Ensembles
- Approximate message passing with spectral initialization for generalized linear models*
- On the universality of noiseless linear estimation with respect to the measurement matrix
- The Generalization Error of Random Features Regression: Precise Asymptotics and the Double Descent Curve
- Analysis of Boolean Functions
- 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
- A modern maximum-likelihood theory for high-dimensional logistic regression
- Concentration Inequalities for Sums and Martingales
- Capacity-Achieving Sparse Superposition Codes via Approximate Message Passing Decoding
- Applications of the Lindeberg Principle in Communications and Statistical Learning
- The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing
- Capacity of Channels With Frequency-Selective and Time-Selective Fading
- Neural networks and physical systems with emergent collective computational abilities.
- A Dynamical Approach to Random Matrix Theory
- Several applications of the moment method in random matrix theory
- Partitions ofN-Space by Hyperplanes
- DISTRIBUTION OF EIGENVALUES FOR SOME SETS OF RANDOM MATRICES
- Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition
- A CDMA multiuser detection algorithm on the basis of belief propagation
