Universality of approximate message passing algorithms (Q2042851)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Universality of approximate message passing algorithms

scientific article; zbMATH DE number 7373517

Language	Label	Description	Also known as
default for all languages	No label defined
English	Universality of approximate message passing algorithms	scientific article; zbMATH DE number 7373517

Statements

instance of

scholarly article

0 references

title

Universality of approximate message passing algorithms (English)

0 references

0 references

0 references

Electronic Journal of Probability

0 references

publication date

21 July 2021

0 references

full work available at URL

https://arxiv.org/abs/2003.10431

0 references

zbMATH Keywords

message passing

0 references

spike recovery

0 references

spiked random matrix

0 references

universality

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Phase transition of the largest eigenvalue for nonnull complex sample covariance matrices

0 references

Eigenvalues of large sample covariance matrices of spiked population models

0 references

Universality in polytope phase transitions and message passing algorithms

0 references

The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing

0 references

The eigenvalues and eigenvectors of finite, low rank perturbations of large random matrices

0 references

The singular values and vectors of low rank perturbations of large rectangular random matrices

0 references

The largest eigenvalues of finite rank deformation of large Wigner matrices: Convergence and nonuniversality of the fluctuations

0 references

Asymptotic mutual information for the balanced binary stochastic block model

0 references

Finding hidden cliques of size \(\sqrt{N/e}\) in nearly linear time

0 references

Information-Theoretically Optimal Compressed Sensing via Spatial Coupling and Approximate Message Passing

0 references

Accurate Prediction of Phase Transitions in Compressed Sensing via a Connection to Minimax Denoising

0 references

The largest eigenvalue of rank one deformation of large Wigner matrices

0 references

State evolution for general approximate message passing algorithms, with applications to spatial coupling

0 references

On the distribution of the largest eigenvalue in principal components analysis

0 references

Phase Transitions and Sample Complexity in Bayes-Optimal Matrix Factorization

0 references

The isotropic semicircle law and deformation of Wigner matrices

0 references

Constrained low-rank matrix estimation: phase transitions, approximate message passing and applications

0 references

Non-Negative Principal Component Analysis: Message Passing Algorithms and Sharp Asymptotics

0 references

Estimation of low-rank matrices via approximate message passing

0 references

Bilinear Generalized Approximate Message Passing—Part I: Derivation

0 references

Bilinear Generalized Approximate Message Passing—Part II: Applications

0 references

Asymptotics of sample eigenstructure for a large dimensional spiked covariance model

0 references

The largest eigenvalue of small rank perturbations of Hermitian random matrices

0 references

High-dimensional probability. An introduction with applications in data science

0 references

Identifiers

zbMATH Open document ID

1483.60007

0 references

DOI

10.1214/21-EJP604

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Universality of approximate message passing algorithms