English
Related papers

Related papers: A unifying tutorial on Approximate Message Passing

200 papers

In this paper, the `Approximate Message Passing' (AMP) algorithm, initially developed for compressed sensing of signals under i.i.d. Gaussian measurement matrices, has been extended to a multi-terminal setting (MAMP algorithm). It has been…

Information Theory · Computer Science 2014-01-14 Saeid Haghighatshoar

Optimal data detection in multiple-input multiple-output (MIMO) communication systems with a large number of antennas at both ends of the wireless link entails prohibitive computational complexity. In order to reduce the computational…

Information Theory · Computer Science 2015-10-22 Charles Jeon , Ramina Ghods , Arian Maleki , Christoph Studer

Message passing (MP) is a computational technique used to find approximate solutions to a variety of problems defined on networks. MP approximations are generally accurate in locally tree-like networks but require corrections to maintain…

Physics and Society · Physics 2023-09-27 George T. Cantwell , Alec Kirkley , Filippo Radicchi

In this work we propose a novel iterative estimation algorithm for linear observation systems called S-AMP whose fixed points are the stationary points of the exact Gibbs free energy under a set of (first- and second-) moment consistency…

Information Theory · Computer Science 2014-05-13 Burak Çakmak , Ole Winther , Bernard H. Fleury

Recently we extended Approximate message passing (AMP) algorithm to be able to handle general invariant matrix ensembles. In this contribution we extend our S-AMP approach to non-linear observation models. We obtain generalized AMP (GAMP)…

Information Theory · Computer Science 2015-01-27 Burak Çakmak , Ole Winther , Bernard H. Fleury

We consider the problem of recovering clustered sparse signals with no prior knowledge of the sparsity pattern. Beyond simple sparsity, signals of interest often exhibits an underlying sparsity pattern which, if leveraged, can improve the…

Information Theory · Computer Science 2016-01-05 Xiangming Meng , Sheng Wu , Linling Kuang , Defeng , Huang , Jianhua Lu

In this paper we develop proximal methods for statistical learning. Proximal point algorithms are useful in statistics and machine learning for obtaining optimization solutions for composite functions. Our approach exploits closed-form…

Machine Learning · Statistics 2015-06-02 Nicholas G. Polson , James G. Scott , Brandon T. Willard

Estimation of a vector from quantized linear measurements is a common problem for which simple linear techniques are suboptimal -- sometimes greatly so. This paper develops generalized approximate message passing (GAMP) algorithms for…

Information Theory · Computer Science 2015-03-24 Ulugbek Kamilov , Vivek K. Goyal , Sundeep Rangan

Vector Approximate Message Passing (VAMP) provides the means of solving a linear inverse problem in a Bayes-optimal way assuming the measurement operator is sufficiently random. However, VAMP requires implementing the linear minimum mean…

Information Theory · Computer Science 2022-06-23 Nikolajs Skuratovs , Mike E. Davies

We study compressed sensing (CS) signal reconstruction problems where an input signal is measured via matrix multiplication under additive white Gaussian noise. Our signals are assumed to be stationary and ergodic, but the input statistics…

Information Theory · Computer Science 2016-11-03 Yanting Ma , Junan Zhu , Dror Baron

The standard linear regression (SLR) problem is to recover a vector $\mathbf{x}^0$ from noisy linear observations $\mathbf{y}=\mathbf{Ax}^0+\mathbf{w}$. The approximate message passing (AMP) algorithm recently proposed by Donoho, Maleki,…

Information Theory · Computer Science 2018-07-24 Sundeep Rangan , Philip Schniter , Alyson K. Fletcher

This article presents a general approximation-theoretic framework to analyze measure transport algorithms for probabilistic modeling. A primary motivating application for such algorithms is sampling -- a central task in statistical…

Numerical Analysis · Mathematics 2024-09-19 Ricardo Baptista , Bamdad Hosseini , Nikola B. Kovachki , Youssef M. Marzouk , Amir Sagiv

This work explores multi-modal inference in a high-dimensional simplified model, analytically quantifying the performance gain of multi-modal inference over that of analyzing modalities in isolation. We present the Bayes-optimal performance…

Machine Learning · Statistics 2025-09-30 Christian Keup , Lenka Zdeborová

For the problem of binary linear classification and feature selection, we propose algorithmic approaches to classifier design based on the generalized approximate message passing (GAMP) algorithm, recently proposed in the context of…

Information Theory · Computer Science 2015-06-18 Justin Ziniel , Philip Schniter , Per Sederberg

We show how the notion of message passing can be used to streamline the algebra and computer coding for fast approximate inference in large Bayesian semiparametric regression models. In particular, this approach is amenable to handling…

Methodology · Statistics 2016-04-07 M. P. Wand

Retraining a model using its own predictions together with the original, potentially noisy labels is a well-known strategy for improving the model performance. While prior works have demonstrated the benefits of specific heuristic…

Machine Learning · Computer Science 2025-05-22 Adel Javanmard , Rudrajit Das , Alessandro Epasto , Vahab Mirrokni

The sum-product or belief propagation (BP) algorithm is a widely used message-passing technique for computing approximate marginals in graphical models. We introduce a new technique, called stochastic orthogonal series message-passing…

Information Theory · Computer Science 2012-12-18 Nima Noorshams , Martin J. Wainwright

Sparse regression codes with approximate message passing (AMP) decoding have gained much attention in recent times. The concepts underlying this coding scheme extend to unsourced access with coded compressed sensing (CCS), as first pointed…

Information Theory · Computer Science 2020-01-14 Vamsi K. Amalladinne , Asit Kumar Pradhan , Cynthia Rush , Jean-Francois Chamberland , Krishna R. Narayanan

We propose a novel algorithm for compressive imaging that exploits both the sparsity and persistence across scales found in the 2D wavelet transform coefficients of natural images. Like other recent works, we model wavelet structure using a…

Computer Vision and Pattern Recognition · Computer Science 2015-05-30 Subhojit Som , Philip Schniter

The ubiquity of approximately sparse data has led a variety of com- munities to great interest in compressed sensing algorithms. Although these are very successful and well understood for linear measurements with additive noise, applying…

Information Theory · Computer Science 2016-07-27 Christophe Schülke , Francesco Caltagirone , Lenka Zdeborová
‹ Prev 1 4 5 6 7 8 10 Next ›