English
Related papers

Related papers: Rigorous Dynamics and Consistent Estimation in Arb…

200 papers

This paper introduces a framework for approximate message passing (AMP) in dynamic settings where the data at each iteration is passed through a linear operator. This framework is motivated in part by applications in large-scale,…

Statistics Theory · Mathematics 2026-01-19 Riccardo Rossetti , Bobak Nazer , Galen Reeves

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

The generalized linear model (GLM), where a random vector $\boldsymbol{x}$ is observed through a noisy, possibly nonlinear, function of a linear transform output $\boldsymbol{z}=\boldsymbol{Ax}$, arises in a range of applications such as…

Information Theory · Computer Science 2016-12-06 Philip Schniter , Sundeep Rangan , Alyson K. Fletcher

Approximate message passing algorithm enjoyed considerable attention in the last decade. In this paper we introduce a variant of the AMP algorithm that takes into account glassy nature of the system under consideration. We coin this…

Disordered Systems and Neural Networks · Physics 2019-02-07 Fabrizio Antenucci , Florent Krzakala , Pierfrancesco Urbani , Lenka Zdeborová

Various alignment problems arising in cryo-electron microscopy, community detection, time synchronization, computer vision, and other fields fall into a common framework of synchronization problems over compact groups such as Z/L, U(1), or…

Information Theory · Computer Science 2018-09-14 Amelia Perry , Alexander S. Wein , Afonso S. Bandeira , Ankur Moitra

SLOPE is a relatively new convex optimization procedure for high-dimensional linear regression via the sorted l1 penalty: the larger the rank of the fitted coefficient, the larger the penalty. This non-separable penalty renders many…

Machine Learning · Statistics 2019-07-18 Zhiqi Bu , Jason Klusowski , Cynthia Rush , Weijie Su

High-dimensional time series appear in many scientific setups, demanding a nuanced approach to model and analyze the underlying dependence structure. Theoretical advancements so far often rely on stringent assumptions regarding the sparsity…

Information Theory · Computer Science 2025-03-20 Daria Tieplova , Samriddha Lahiry , Jean Barbier

Approximate message passing (AMP) is a class of low-complexity, scalable algorithms for solving high-dimensional linear regression tasks where one wishes to recover an unknown signal from noisy, linear measurements. AMP is an iterative…

Information Theory · Computer Science 2019-08-27 Yanting Ma , Cynthia Rush , Dror Baron

Bayesian approximate message passing (BAMP) is an efficient method in compressed sensing that is nearly optimal in the minimum mean squared error (MMSE) sense. Bayesian approximate message passing (BAMP) performs joint recovery of multiple…

Information Theory · Computer Science 2019-01-30 Gabor Hannak , Alessandro Perelli , Norbert Goertz , Gerald Matz , Mike E. Davies

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á

In compressed sensing one measures sparse signals directly in a compressed form via a linear transform and then reconstructs the original signal. However, it is often the case that the linear transform itself is known only approximately, a…

Information Theory · Computer Science 2013-11-13 Florent Krzakala , Marc Mézard , Lenka Zdeborová

Phase retrieval refers to the problem of recovering a high-dimensional vector $\boldsymbol{x} \in \mathbb{C}^N$ from the magnitude of its linear transform $\boldsymbol{z} = A \boldsymbol{x}$, observed through a noisy channel. To improve the…

Computation · Statistics 2024-10-10 Hajime Ueda , Shun Katakami , Masato Okada

We consider the problem of parameter estimation from a generalized linear model with a random design matrix that is orthogonally invariant in law. Such a model allows the design have an arbitrary distribution of singular values and only…

Statistics Theory · Mathematics 2026-02-11 Yihan Zhang , Hong Chang Ji , Ramji Venkataramanan , 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

We propose regularized approximate message passing (RAMP), a low-complexity algorithm for discrete signal detection in overloaded multiple-input multiple-output (MIMO) systems where the number of transmit antennas exceeds the number of…

Signal Processing · Electrical Eng. & Systems 2026-04-07 Shreesal Shrestha , Getuar Rexhepi , Kuranage Roche Rayan Ranasinghe , Hyeon Seok Rou , Giuseppe Thadeu Freitas de Abreu

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

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

We derive an efficient stochastic algorithm for inverse problems that present an unknown linear forcing term and a set of nonlinear parameters to be recovered. It is assumed that the data is noisy and that the linear part of the problem is…

Numerical Analysis · Mathematics 2019-09-17 Darko Volkov

Approximate message passing (AMP) methods and their variants have attracted considerable recent attention for the problem of estimating a random vector $\mathbf{x}$ observed through a linear transform $\mathbf{A}$. In the case of large…

Information Theory · Computer Science 2018-03-05 Sundeep Rangan , Philip Schniter , Alyson K. Fletcher , Subrata Sarkar