English
Related papers

Related papers: Plug-And-Play Learned Gaussian-mixture Approximate…

200 papers

The denoising-based approximate message passing (D-AMP) methodology, recently proposed by Metzler, Maleki, and Baraniuk, allows one to plug in sophisticated denoisers like BM3D into the AMP algorithm to achieve state-of-the-art compressive…

Information Theory · Computer Science 2016-11-07 Philip Schniter , Sundeep Rangan , Alyson Fletcher

Deep learning has gained great popularity due to its widespread success on many inference problems. We consider the application of deep learning to the sparse linear inverse problem encountered in compressive sensing, where one seeks to…

Information Theory · Computer Science 2016-07-21 Mark Borgerding , Philip Schniter

Plug-and-play (PnP) is a non-convex framework that combines ADMM or other proximal algorithms with advanced denoiser priors. Recently, PnP has achieved great empirical success, especially with the integration of deep learning-based…

Image and Video Processing · Electrical Eng. & Systems 2020-11-19 Kaixuan Wei , Angelica Aviles-Rivero , Jingwei Liang , Ying Fu , Carola-Bibiane Schönlieb , Hua Huang

This letter proposes a novel message-passing algorithm for signal recovery in compressed sensing. The proposed algorithm solves the disadvantages of approximate message-passing (AMP) and orthogonal/vector AMP, and realizes their advantages.…

Information Theory · Computer Science 2020-04-22 Keigo Takeuchi

Plug-and-play priors (PnP) is a broadly applicable methodology for solving inverse problems by exploiting statistical priors specified as denoisers. Recent work has reported the state-of-the-art performance of PnP algorithms using…

Machine Learning · Computer Science 2021-01-25 Yu Sun , Zihui Wu , Xiaojian Xu , Brendt Wohlberg , Ulugbek S. Kamilov

Approximate message passing (AMP) is a class of efficient algorithms for solving high-dimensional linear regression tasks where one wishes to recover an unknown signal \beta_0 from noisy, linear measurements y = A \beta_0 + w. When applying…

Information Theory · Computer Science 2017-08-15 Yanting Ma , Cynthia Rush , Dror Baron

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

We propose efficient and low-complexity multiuser detection (MUD) algorithms for Gaussian multiple access channel (G-MAC) for short-packet transmission in massive machine type communications. To do so, we first formulate the G-MAC MUD…

Information Theory · Computer Science 2024-03-26 Mostafa Mohammadkarimi , Masoud Ardakani

Approximate message passing (AMP) methods have gained recent traction in sparse signal recovery. Additional information about the signal, or \emph{side information} (SI), is commonly available and can aid in efficient signal recovery. This…

Information Theory · Computer Science 2019-05-06 Anna Ma , You , Zhou , Cynthia Rush , Dror Baron , Deanna Needell

Generalized approximate message passing (GAMP) is a promising technique for unknown signal reconstruction of generalized linear models (GLM). However, it requires that the transformation matrix has independent and identically distributed…

Information Theory · Computer Science 2021-10-18 Feiyan Tian , Lei Liu , Xiaoming Chen

Recently, several promising approximate message passing (AMP) based algorithms have been developed for bilinear recovery with model $\boldsymbol{Y}=\sum_{k=1}^K b_k \boldsymbol{A}_k \boldsymbol{C} +\boldsymbol{W} $, where $\{b_k\}$ and…

Information Theory · Computer Science 2021-02-24 Zhengdao Yuan , Qinghua Guo , Man Luo

Gaussian and quadratic approximations of message passing algorithms on graphs have attracted considerable recent attention due to their computational simplicity, analytic tractability, and wide applicability in optimization and statistical…

Information Theory · Computer Science 2026-03-12 Sundeep Rangan , Alyson K. Fletcher , Vivek K. Goyal , Evan Byrne , Philip Schniter

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

Deep learning has gained great popularity due to its widespread success on many inference problems. We consider the application of deep learning to the sparse linear inverse problem, where one seeks to recover a sparse signal from a few…

Information Theory · Computer Science 2017-08-02 Mark Borgerding , Philip Schniter , Sundeep Rangan

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

This paper considers the massive connectivity problem in an asynchronous grant-free random access system, where a huge number of devices sporadically transmit data to a base station (BS) with imperfect synchronization. The goal is to design…

Information Theory · Computer Science 2021-01-05 Weifeng Zhu , Meixia Tao , Xiaojun Yuan , Yunfeng Guan

This paper considers a compressed-coding scheme that combines compressed sensing with forward error control coding. Approximate message passing (AMP) is used to decode the message. Based on the state evolution analysis of AMP, we derive the…

Information Theory · Computer Science 2024-10-30 Shansuo Liang , Chulong Liang , Junjie Ma , Li Ping

We consider the estimation of an i.i.d.\ random vector observed through a linear transform followed by a componentwise, probabilistic (possibly nonlinear) measurement channel. A novel algorithm, called generalized approximate message…

Information Theory · Computer Science 2012-08-15 Sundeep Rangan

In this paper, we introduce Plug-and-Play (PnP) Flow Matching, an algorithm for solving imaging inverse problems. PnP methods leverage the strength of pre-trained denoisers, often deep neural networks, by integrating them in optimization…

Computer Vision and Pattern Recognition · Computer Science 2025-09-10 Ségolène Martin , Anne Gagneux , Paul Hagemann , Gabriele Steidl

We consider the problem of reconstructing a signal from multi-layered (possibly) non-linear measurements. Using non-rigorous but standard methods from statistical physics we present the Multi-Layer Approximate Message Passing (ML-AMP)…

Information Theory · Computer Science 2020-01-22 Andre Manoel , Florent Krzakala , Marc Mézard , Lenka Zdeborová