English
Related papers

Related papers: Bayes-Optimal Convolutional AMP

200 papers

Solving a large-scale regularized linear inverse problem using multiple processors is important in various real-world applications due to the limitations of individual processors and constraints on data sharing policies. This paper focuses…

Information Theory · Computer Science 2017-01-31 Yanting Ma , Yue M. Lu , Dror Baron

Approximate Message Passing (AMP) algorithms have seen widespread use across a variety of applications. However, the precise forms for their Onsager corrections and state evolutions depend on properties of the underlying random matrix…

Probability · Mathematics 2021-08-16 Zhou Fan

This paper addresses the reconstruction of sparse signals from generalized linear measurements. Signal sparsity is assumed to be sublinear in the signal dimension while it was proportional to the signal dimension in conventional research.…

Information Theory · Computer Science 2026-04-13 Keigo Takeuchi

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

This paper presents a unified framework to understand the dynamics of message-passing algorithms in compressed sensing. State evolution is rigorously analyzed for a general error model that contains the error model of approximate…

Information Theory · Computer Science 2019-01-17 Keigo Takeuchi

In this work the dynamic compressive sensing (CS) problem of recovering sparse, correlated, time-varying signals from sub-Nyquist, non-adaptive, linear measurements is explored from a Bayesian perspective. While there has been a handful of…

Information Theory · Computer Science 2015-06-05 Justin Ziniel , Philip Schniter

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

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

The generalized approximate message passing (GAMP) algorithm is an efficient method of MAP or approximate-MMSE estimation of $x$ observed from a noisy version of the transform coefficients $z = Ax$. In fact, for large zero-mean i.i.d…

Information Theory · Computer Science 2015-08-11 Jeremy Vila , Philip Schniter , Sundeep Rangan , Florent Krzakala , Lenka Zdeborova

We consider the problem of signal estimation in a generalized linear model (GLM). GLMs include many canonical problems in statistical estimation, such as linear regression, phase retrieval, and 1-bit compressed sensing. Recent work has…

Information Theory · Computer Science 2024-10-29 Pablo Pascual Cobo , Kuan Hsieh , Ramji Venkataramanan

We consider large-scale linear inverse problems in Bayesian settings. Our general approach follows a recent line of work that applies the approximate message passing (AMP) framework in multi-processor (MP) computational systems by storing…

Information Theory · Computer Science 2016-11-17 Junan Zhu , Ahmad Beirami , Dror Baron

Approximate message passing (AMP) is an algorithmic framework for solving linear inverse problems from noisy measurements, with exciting applications such as reconstructing images, audio, hyper spectral images, and various other signals,…

Information Theory · Computer Science 2017-02-13 Junan Zhu , Ryan Pilgrim , Dror Baron

Approximate Message Passing (AMP) is an efficient iterative parameter-estimation technique for certain high-dimensional linear systems with non-Gaussian distributions, such as sparse systems. In AMP, a so-called Onsager term is added to…

Information Theory · Computer Science 2023-01-16 Lei Liu , Yiyao Cheng , Shansuo Liang , Jonathan H. Manton , Li Ping

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á

Decentralized generalized approximate message-passing (GAMP) is proposed for compressed sensing from distributed generalized linear measurements in a tree-structured network. Consensus propagation is used to realize average consensus…

Information Theory · Computer Science 2024-06-05 Keigo Takeuchi

We propose an orthogonal approximate message passing (OAMP) algorithm for signal estimation in the rectangular spiked matrix model with general rotationally invariant (RI) noise. We establish a rigorous state evolution that exactly…

Statistics Theory · Mathematics 2026-02-04 Haohua Chen , Songbin Liu , Junjie Ma

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

Approximate message passing (AMP) is an effective iterative sparse recovery algorithm for linear system models. Its performance is characterized by the state evolution (SE) which is a simple scalar recursion. However, depending on a…

Signal Processing · Electrical Eng. & Systems 2018-04-02 Kazushi Mimura

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 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