English
Related papers

Related papers: Approximate Survey Propagation for Statistical Inf…

200 papers

We propose and analyze an approximate message passing (AMP) algorithm for the matrix tensor product model, which is a generalization of the standard spiked matrix models that allows for multiple types of pairwise observations over a…

Machine Learning · Statistics 2023-06-28 Riccardo Rossetti , Galen Reeves

Approximate Message Passing (AMP), originally designed to solve high-dimensional linear inverse problems, has found broad applications in signal processing and statistical inference. Among its key variants, Vector Approximate Message…

Information Theory · Computer Science 2024-10-29 Qun Chen , Haochuan Zhang , Huimin Zhu

Approximate message passing (AMP) refers to a class of efficient algorithms for statistical estimation in high-dimensional problems such as compressed sensing and low-rank matrix estimation. This paper analyzes the performance of AMP in the…

Information Theory · Computer Science 2018-10-23 Cynthia Rush , Ramji Venkataramanan

Approximate Message Passing (AMP) has been shown to be a superior method for inference problems, such as the recovery of signals from sets of noisy, lower-dimensionality measurements, both in terms of reconstruction accuracy and in…

Information Theory · Computer Science 2015-06-10 Andre Manoel , Florent Krzakala , Eric W. Tramel , Lenka Zdeborová

Approximate Message Passing (AMP) is a class of iterative algorithms that have found applications in many problems in high-dimensional statistics and machine learning. In its general form, AMP can be formulated as an iterative procedure…

Probability · Mathematics 2023-05-02 Rishabh Dudeja , Yue M. Lu , Subhabrata Sen

Approximate Message Passing (AMP) algorithms are a family of iterative algorithms based on large random matrices with the special property of tracking the statistical properties of their iterates. They are used in various fields such as…

Probability · Mathematics 2025-03-27 Mohammed-Younes Gueddari , Walid Hachem , Jamal Najim

Consider the problem of estimating a low-rank matrix when its entries are perturbed by Gaussian noise. If the empirical distribution of the entries of the spikes is known, optimal estimators that exploit this knowledge can substantially…

Statistics Theory · Mathematics 2019-08-08 Andrea Montanari , Ramji Venkataramanan

Characterizing the distribution of high-dimensional statistical estimators is a challenging task, due to the breakdown of classical asymptotic theory in high dimension. This paper makes progress towards this by developing non-asymptotic…

Statistics Theory · Mathematics 2024-01-09 Gen Li , Yuting Wei

Approximate Message Passing (AMP) algorithms are a class of iterative procedures for computationally-efficient estimation in high-dimensional inference and estimation tasks. Due to the presence of an 'Onsager' correction term in its…

Statistics Theory · Mathematics 2023-02-02 Collin Cademartori , Cynthia Rush

In this paper we study a fully connected planted spin glass named the planted XY model. Motivation for studying this system comes both from the spin glass field and the one of statistical inference where it models the angular…

Disordered Systems and Neural Networks · Physics 2024-01-12 Siyu Chen , Guanhao Huang , Giovanni Piccioli , Lenka Zdeborová

1-bit compressive sensing aims to recover sparse signals from quantized 1-bit measurements. Designing efficient approaches that could handle noisy 1-bit measurements is important in a variety of applications. In this paper we use the…

Information Theory · Computer Science 2022-04-28 Shuai Huang , Trac D. Tran

We consider the problem of signal estimation in generalized linear models defined via rotationally invariant design matrices. Since these matrices can have an arbitrary spectral distribution, this model is well suited for capturing complex…

Machine Learning · Statistics 2022-06-10 Ramji Venkataramanan , Kevin Kögler , Marco Mondelli

For certain sensing matrices, the Approximate Message Passing (AMP) algorithm efficiently reconstructs undersampled signals. However, in Magnetic Resonance Imaging (MRI), where Fourier coefficients of a natural image are sampled with…

Signal Processing · Electrical Eng. & Systems 2020-09-08 Charles Millard , Aaron T Hess , Boris Mailhé , Jared Tanner

Designing efficient sparse recovery algorithms that could handle noisy quantized measurements is important in a variety of applications -- from radar to source localization, spectrum sensing and wireless networking. We take advantage of the…

Signal Processing · Electrical Eng. & Systems 2022-05-24 Shuai Huang , Deqiang Qiu , Trac D. Tran

High-dimensional signal recovery of standard linear regression is a key challenge in many engineering fields, such as, communications, compressed sensing, and image processing. The approximate message passing (AMP) algorithm proposed by…

Information Theory · Computer Science 2022-03-02 Qiuyun Zou , Hongwen Yang

We consider sparse signal reconstruction via minimization of the smoothly clipped absolute deviation (SCAD) penalty, and develop one-step replica-symmetry-breaking (1RSB) extensions of approximate message passing (AMP), termed 1RSB-AMP.…

Machine Learning · Statistics 2025-12-22 Xiaosi Gu , Ayaka Sakata , Tomoyuki Obuchi

We consider a broad class of Approximate Message Passing (AMP) algorithms defined as a Lipschitzian functional iteration in terms of an $n\times n$ random symmetric matrix $A$. We establish universality in noise for this AMP in the…

Probability · Mathematics 2020-06-02 Wei-Kuo Chen , Wai-Kit Lam

In a recent article (Proc. Natl. Acad. Sci., 110(36), 14557-14562), El Karoui et al. study the distribution of robust regression estimators in the regime in which the number of parameters p is of the same order as the number of samples n.…

Statistics Theory · Mathematics 2013-11-18 David Donoho , Andrea Montanari

We consider the estimation of an i.i.d. (possibly non-Gaussian) vector $\xbf \in \R^n$ from measurements $\ybf \in \R^m$ obtained by a general cascade model consisting of a known linear transform followed by a probabilistic componentwise…

Information Theory · Computer Science 2012-12-04 Ulugbek S. Kamilov , Sundeep Rangan , Alyson K. Fletcher , Michael Unser

Approximate message passing (AMP) is a scalable, iterative approach to signal recovery. For structured random measurement ensembles, including independent and identically distributed (i.i.d.) Gaussian and rotationally-invariant matrices,…

Information Theory · Computer Science 2023-06-27 Dang Qua Nguyen , Taejoon Kim
‹ Prev 1 2 3 10 Next ›