A Unifying Tutorial on Approximate Message Passing (Q5863992)

scientific article; zbMATH DE number 7537004

Language	Label	Description	Also known as
English	A Unifying Tutorial on Approximate Message Passing	scientific article; zbMATH DE number 7537004

Statements

instance of

scholarly article

0 references

title

A Unifying Tutorial on Approximate Message Passing (English)

0 references

0 references

0 references

0 references

0 references

Foundations and Trends® in Machine Learning

0 references

publication date

3 June 2022

0 references

full work available at URL

https://arxiv.org/abs/2105.02180

0 references

zbMATH Keywords

design and analysis of algorithms

0 references

information theory

0 references

randomized algorithms

0 references

statistical machine learning

0 references

statistical signal processing: estimation

0 references

regression

0 references

describes a project that uses

TheCommitteeMachine

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

High-dimensional dynamics of generalization error in neural networks

0 references

Q4983382

0 references

On the existence of maximum likelihood estimates in logistic regression models

0 references

Q4256640

0 references

Q4705344

0 references

An Introduction to Random Matrices

0 references

The Spiked Matrix Model With Generative Priors

0 references

The committee machine: computational to statistical gaps in learning a two-layers neural network

0 references

Spectral analysis of large dimensional random matrices

0 references

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

Approximate Message-Passing Decoder and Capacity Achieving Sparse Superposition Codes

0 references

Optimal errors and phase transitions in high-dimensional generalized linear models

0 references

Benign overfitting in linear regression

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 LASSO Risk for Gaussian Matrices

0 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

Reconciling modern machine-learning practice and the classical bias–variance trade-off

0 references

Two Models of Double Descent for Weak Features

0 references

Slope meets Lasso: improved oracle bounds and optimality

0 references

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

0 references

State evolution for approximate message passing with non-separable functions

0 references

10.1162/jmlr.2003.3.4-5.993

0 references

SLOPE-adaptive variable selection via convex optimization

0 references

An iterative construction of solutions of the TAP equations for the Sherrington-Kirkpatrick model

0 references

Q4907706

0 references

Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers

0 references

Measurable selections of extrema

0 references

Algorithmic Analysis and Statistical Estimation of SLOPE via Approximate Message Passing

0 references

Statistics for high-dimensional data. Methods, theory and applications.

0 references

Exact matrix completion via convex optimization

0 references

The phase transition for the existence of the maximum likelihood estimate in high-dimensional logistic regression

0 references

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

0 references

Fundamental barriers to high-dimensional regression with convex penalties

0 references

Universality of approximate message passing algorithms

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

Minimax risk over $l_ p$-balls for $l_ q$-error

0 references

Minimax estimation via wavelet shrinkage

0 references

High dimensional robust M-estimation: asymptotic variance via approximate message passing

0 references

Real Analysis and Probability

0 references

Bounding distributional errors via density ratios

0 references

Approximation by log-concave distributions, with applications to regression

0 references

Tweedie’s Formula and Selection Bias

0 references

Decoding From Pooled Data: Phase Transitions of Message Passing

0 references

Approximate message passing algorithms for rotationally invariant matrices

0 references

Geometric measure theory.

0 references

The largest eigenvalue of rank one deformation of large Wigner matrices

0 references

Shrinkage estimation

0 references

Sparse Principal Component Analysis via Axis-Aligned Random Projections

0 references

A Stochastic Approach to the Gamma Function

0 references

Randomly Spread CDMA: Asymptotics Via Statistical Physics

0 references

Surprises in high-dimensional ridgeless least squares interpolation

0 references

Complete Convergence and the Law of Large Numbers

0 references

Robust Estimation of a Location Parameter

0 references

Robust regression: Asymptotics, conjectures and Monte Carlo

0 references

Robust Statistics

0 references

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

0 references

Q5421705

0 references

On Consistency and Sparsity for Principal Components Analysis in High Dimensions

0 references

Phase Transitions and Sample Complexity in Bayes-Optimal Matrix Factorization

0 references

Foundations of Modern Probability

0 references

The Isotropic Semicircle Law and Deformation of Wigner Matrices

0 references

Q3655273

0 references

Fundamental limits of symmetric low-rank matrix estimation

0 references

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

0 references

Just interpolate: kernel ``ridgeless'' regression can generalize

0 references

A precise high-dimensional asymptotic theory for boosting and minimum-$\ell_1$-norm interpolated classifiers

0 references

Optimization-Based AMP for Phase Retrieval: The Impact of Initialization and $\ell_{2}$ Regularization

0 references

Analysis of Approximate Message Passing With Non-Separable Denoisers and Markov Random Field Priors

0 references

Computational barriers in minimax submatrix detection

0 references

Q3998435

0 references

Q4681935

0 references

The Generalization Error of Random Features Regression: Precise Asymptotics and the Double Descent Curve

0 references

Information, Physics, and Computation

0 references

Q4237477

0 references

The distribution of the Lasso: uniform control over sparse balls and adaptive parameter tuning

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

Consistent parameter estimation for Lasso and approximate message passing

0 references

Deep double descent: where bigger models and more data hurt*

0 references

A theory of solving TAP equations for Ising models with general invariant random matrices

0 references

Q3093334

0 references

Q4379507

0 references

An Invitation to Statistics in Wasserstein Space

0 references

Bilinear Generalized Approximate Message Passing—Part I: Derivation

0 references

Bilinear Generalized Approximate Message Passing—Part II: Applications

0 references

Q5449216

0 references

Optimality and sub-optimality of PCA. I: Spiked random matrix models

0 references

Asymptotic behavior of M-estimators of p regression parameters when $p^ 2/n$ is large. I. Consistency

0 references

Asymptotic behavior of M estimators of p regression parameters when $p^ 2/n$ is large. II: Normal approximation

0 references

Asymptotic behavior of likelihood methods for exponential families when the number of parameters tends to infinity

0 references

Q3910308

0 references

Vector Approximate Message Passing

0 references

On the Convergence of Approximate Message Passing With Arbitrary Matrices

0 references

Fixed Points of Generalized Approximate Message Passing With Arbitrary Matrices

0 references

The Replica-Symmetric Prediction for Random Linear Estimation With Gaussian Matrices Is Exact

0 references

Q3239675

0 references

Q4235027

0 references

Capacity-Achieving Sparse Superposition Codes via Approximate Message Passing Decoding

0 references

Finite Sample Analysis of Approximate Message Passing Algorithms

0 references

A Simple Derivation of AMP and its State Evolution via First-Order Cancellation

0 references

Compressive Phase Retrieval via Generalized Approximate Message Passing

0 references

Approximation Theorems of Mathematical Statistics

0 references

False discoveries occur early on the Lasso path

0 references

SLOPE is adaptive to unknown sparsity and asymptotically minimax

0 references

A modern maximum-likelihood theory for high-dimensional logistic regression

0 references

The likelihood ratio test in high-dimensional logistic regression is asymptotically a rescaled Chi-square

0 references

Bayes-Optimal Convolutional AMP

0 references

Rigorous Dynamics of Expectation-Propagation-Based Signal Recovery from Unitarily Invariant Measurements

0 references

Mean Field Models for Spin Glasses

0 references

A statistical-mechanics approach to large-system analysis of CDMA multiuser detectors

0 references

Precise Error Analysis of Regularized <inline-formula> <tex-math notation="LaTeX">$M$ </tex-math> </inline-formula>-Estimators in High Dimensions

0 references

Q4864293

0 references

Q4805362

0 references

Optimal Transport

0 references

Minimax sparse principal subspace estimation in high dimensions

0 references

Statistical and computational trade-offs in estimation of sparse principal components

0 references

Identifiers

zbMATH Open document ID

1491.68152

0 references

DOI

10.1561/2200000092

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5863992