English
Related papers

Related papers: Parameterless Optimal Approximate Message Passing

200 papers

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

We propose a probabilistic framework for interpreting and developing hard thresholding sparse signal reconstruction methods and present several new algorithms based on this framework. The measurements follow an underdetermined linear model,…

Information Theory · Computer Science 2010-11-08 Kun Qiu , Aleksandar Dogandzic

Compressed sensing is a signal processing method that acquires data directly in a compressed form. This allows one to make less measurements than what was considered necessary to record a signal, enabling faster or more precise measurement…

Statistical Mechanics · Physics 2012-08-20 Florent Krzakala , Marc Mézard , François Sausset , Yifan Sun , Lenka Zdeborová

Message passing algorithms, whose iterative nature captures well complicated interactions among interconnected variables in complex systems and extracts information from the fixed point of iterated messages, provide a powerful toolkit in…

Disordered Systems and Neural Networks · Physics 2022-02-28 Chun-Yan Zhao , Yan-Rong Fu , Jin-Hua Zhao

We consider the problem of sparse signal recovery from noisy measurements. Many of frequently used recovery methods rely on some sort of tuning depending on either noise or signal parameters. If no estimates for either of them are…

Information Theory · Computer Science 2020-10-20 Hendrik Bernd Petersen , Peter Jung

We propose a tensor generalized approximate message passing (TeG-AMP) algorithm for low-rank tensor inference, which can be used to solve tensor completion and decomposition problems. We derive TeG-AMP algorithm as an approximation of the…

Machine Learning · Computer Science 2025-04-02 Yinchuan Li , Guangchen Lan , Xiaodong Wang

The question of fast convergence in the classical problem of high dimensional linear regression has been extensively studied. Arguably, one of the fastest procedures in practice is Iterative Hard Thresholding (IHT). Still, IHT relies…

Statistics Theory · Mathematics 2020-08-28 Mohamed Ndaoud

Thresholding based iterative algorithms have the trade-off between effectiveness and optimality. Some are effective but involving sub-matrix inversions in every step of iterations. For systems of large sizes, such algorithms can be…

Information Theory · Computer Science 2017-11-08 Zhanjie Song , Shidong Li , Ningning Han

In this paper, an efficient distributed approach for implementing the approximate message passing (AMP) algorithm, named distributed AMP (DAMP), is developed for compressed sensing (CS) recovery in sensor networks with the sparsity K…

Distributed, Parallel, and Cluster Computing · Computer Science 2014-05-26 Puxiao Han , Ruixin Niu , Mengqi Ren

Noiseless compressive sensing is a two-steps setting that allows for undersampling a sparse signal and then reconstructing it without loss of information. The LASSO algorithm, based on $\lone$ regularization, provides an efficient and…

Information Theory · Computer Science 2025-11-13 Damien Barbier , Carlo Lucibello , Luca Saglietti , Florent Krzakala , Lenka Zdeborová

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

Approximate message passing (AMP) type algorithms have been widely used in the signal reconstruction of certain large random linear systems. A key feature of the AMP-type algorithms is that their dynamics can be correctly described by state…

Information Theory · Computer Science 2022-06-24 Lei Liu , Shunqi Huang , Brian M. Kurkoski

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

In this paper, we consider the problem of multi-resolution compressed sensing (MR-CS) reconstruction, which has received little attention in the literature. Instead of always reconstructing the signal at the original high resolution (HR),…

Information Theory · Computer Science 2016-01-21 Xing Wang , Jie Liang

In this paper, we study a spiked Wigner problem with an inhomogeneous noise profile. Our aim in this problem is to recover the signal passed through an inhomogeneous low-rank matrix channel. While the information-theoretic performances are…

Machine Learning · Statistics 2023-02-15 Aleksandr Pak , Justin Ko , Florent Krzakala

This paper proposes Bayes-optimal convolutional approximate message-passing (CAMP) for signal recovery in compressed sensing. CAMP uses the same low-complexity matched filter (MF) for interference suppression as approximate message-passing…

Information Theory · Computer Science 2021-04-05 Keigo Takeuchi

We consider the problem of reconstructing the signal and the hidden variables from observations coming from a multi-layer network with rotationally invariant weight matrices. The multi-layer structure models inference from deep generative…

Machine Learning · Statistics 2022-12-06 Yizhou Xu , TianQi Hou , ShanSuo Liang , Marco Mondelli

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

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

Information Theory · Computer Science 2025-12-23 Haohua Chen , Songbin Liu , Junjie Ma

Recovery of arbitrarily positioned samples that are missing in sparse signals recently attracted significant research interest. Sparse signals with heavily corrupted arbitrary positioned samples could be analyzed in the same way as…

Information Theory · Computer Science 2013-09-24 Ljubisa Stankovic , Milos Dakovic , Stefan Vujovic
‹ Prev 1 4 5 6 7 8 10 Next ›