English
Related papers

Related papers: Warm-Starting in Message Passing algorithms

200 papers

To support complex communication scenarios in next-generation wireless communications, this paper focuses on a generalized MIMO (GMIMO) with practical assumptions, such as massive antennas, practical channel coding, arbitrary input…

Information Theory · Computer Science 2023-11-08 Yufei Chen , Lei Liu , Yuhao Chi , Ying Li , Zhaoyang Zhang

This paper is concerned with the problem of reconstructing an unknown rank-one matrix with prior structural information from noisy observations. While computing the Bayes-optimal estimator seems intractable in general due to its nonconvex…

Statistics Theory · Mathematics 2023-02-08 Gen Li , Wei Fan , Yuting Wei

When recovering a sparse signal from noisy compressive linear measurements, the distribution of the signal's non-zero coefficients can have a profound effect on recovery mean-squared error (MSE). If this distribution was apriori known, then…

Information Theory · Computer Science 2015-06-05 Jeremy P. Vila , Philip Schniter

This paper is divided into two parts. The first part is devoted to the study of a class of Approximate Message Passing (AMP) algorithms which are widely used in the fields of statistical physics, machine learning, or communication theory.…

Probability · Mathematics 2024-06-13 Walid Hachem

Generalized Vector Approximate Message Passing (GVAMP) is an efficient iterative algorithm for approximately minimum-mean-squared-error estimation of a random vector $\mathbf{x}\sim p_{\mathbf{x}}(\mathbf{x})$ from generalized linear…

Information Theory · Computer Science 2018-06-27 Christopher A. Metzler , Philip Schniter , Richard G. Baraniuk

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) algorithms have shown great promise in sparse signal reconstruction due to their low computational requirements and fast convergence to an exact solution. Moreover, they provide a probabilistic framework…

Sound · Computer Science 2018-02-02 Turab Iqbal , Wenwu Wang

We give a fast, spectral procedure for implementing approximate-message passing (AMP) algorithms robustly. For any quadratic optimization problem over symmetric matrices $X$ with independent subgaussian entries, and any separable AMP…

Data Structures and Algorithms · Computer Science 2024-11-06 Misha Ivkov , Tselil Schramm

Approximate Message Passing (AMP) algorithmshave recently gathered significant attention across disciplines such as statistical physics, machine learning, and communication systems. This study aims to extend AMP algorithms to non-symmetric…

Probability · Mathematics 2024-02-14 Mohammed-Younes Gueddari , Walid Hachem , Jamal Najim

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

The sparse Beyesian learning (also referred to as Bayesian compressed sensing) algorithm is one of the most popular approaches for sparse signal recovery, and has demonstrated superior performance in a series of experiments. Nevertheless,…

Information Theory · Computer Science 2015-01-21 Fuwei Li , Jun Fang , Huiping Duan , Zhi Chen , Hongbin Li

We propose score-based VAMP (SC-VAMP), a variant of vector approximate message passing (VAMP) in which the Onsager correction is expressed and computed via conditional Fisher information, thereby enabling a Jacobian-free implementation.…

Information Theory · Computer Science 2026-01-13 Tadashi Wadayama , Takumi Takahashi

Purpose: For quantitative susceptibility mapping (QSM), the lack of ground-truth in clinical settings makes it challenging to determine suitable parameters for the dipole inversion. We propose a probabilistic Bayesian approach for QSM with…

Image and Video Processing · Electrical Eng. & Systems 2023-06-01 Shuai Huang , James J. Lah , Jason W. Allen , Deqiang Qiu

A common goal in many research areas is to reconstruct an unknown signal x from noisy linear measurements. Approximate message passing (AMP) is a class of low-complexity algorithms for efficiently solving such high-dimensional regression…

Information Theory · Computer Science 2019-05-07 Hangjin Liu , Cynthia Rush , Dror Baron

This paper considers a generalized multiple-input multiple-output (GMIMO) with practical assumptions, such as massive antennas, practical channel coding, arbitrary input distributions, and general right-unitarily-invariant channel matrices…

Information Theory · Computer Science 2023-10-30 Yufei Chen , Lei Liu , Yuhao Chi , Ying Li , Zhaoyang Zhang

Generalized Linear Models (GLMs), where a random vector $\mathbf{x}$ is observed through a noisy, possibly nonlinear, function of a linear transform $\mathbf{z}=\mathbf{Ax}$ arise in a range of applications in nonlinear filtering and…

Information Theory · Computer Science 2016-05-03 Sundeep Rangan , Alyson K. Fletcher , Philip Schniter , Ulugbek Kamilov

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

The Approximate Message Passing (AMP) algorithm efficiently reconstructs signals which have been sampled with large i.i.d. sub-Gaussian sensing matrices. Central to AMP is its "state evolution", which guarantees that the difference between…

Signal Processing · Electrical Eng. & Systems 2020-09-08 Charles Millard , Aaron T Hess , Boris Mailhé , Jared Tanner

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

Estimating a vector $\mathbf{x}$ from noisy linear measurements $\mathbf{Ax}+\mathbf{w}$ often requires use of prior knowledge or structural constraints on $\mathbf{x}$ for accurate reconstruction. Several recent works have considered…

Information Theory · Computer Science 2020-01-29 Alyson K. Fletcher , Sundeep Rangan , Subrata Sarkar , Philip Schniter
‹ Prev 1 3 4 5 6 7 10 Next ›