English
Related papers

Related papers: Generalised Approximate Message Passing for Non-I.…

200 papers

Mean-field characterizations of first-order iterative algorithms -- including Approximate Message Passing (AMP), stochastic and proximal gradient descent, and Langevin diffusions -- have enabled a precise understanding of learning dynamics…

Statistics Theory · Mathematics 2025-07-01 Max Lovig , Tianhao Wang , Zhou Fan

Continuous-time trajectory representations are a powerful tool that can be used to address several issues in many practical simultaneous localization and mapping (SLAM) scenarios, like continuously collected measurements distorted by robot…

Robotics · Computer Science 2017-05-18 Jing Dong , Byron Boots , Frank Dellaert

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

We develop a fast variational approximation scheme for Gaussian process (GP) regression, where the spectrum of the covariance function is subjected to a sparse approximation. Our approach enables uncertainty in covariance function…

Computation · Statistics 2019-04-24 Linda S. L. Tan , Victor M. H. Ong , David J. Nott , Ajay Jasra

As a greedy algorithm to recover sparse signals from compressed measurements, orthogonal matching pursuit (OMP) algorithm has received much attention in recent years. In this paper, we introduce an extension of the OMP for pursuing…

Information Theory · Computer Science 2014-04-01 Jian Wang , Seokbeop Kwon , Byonghyo Shim

We introduce Tree-AMP, standing for Tree Approximate Message Passing, a python package for compositional inference in high-dimensional tree-structured models. The package provides a unifying framework to study several approximate message…

Machine Learning · Statistics 2023-04-19 Antoine Baker , Benjamin Aubin , Florent Krzakala , Lenka Zdeborová

Orthogonal approximate message-passing (OAMP) is proposed for signal recovery from right-orthogonally invariant linear measurements with spatial coupling. Conventional state evolution is generalized to a unified framework of state evolution…

Information Theory · Computer Science 2023-05-22 Keigo Takeuchi

Understanding efficiency in high dimensional linear models is a longstanding problem of interest. Classical work with smaller dimensional problems dating back to Huber and Bickel has illustrated the benefits of efficient loss functions.…

Statistics Theory · Mathematics 2017-08-16 Jelena Bradic

Deep generative priors are a powerful tool for reconstruction problems with complex data such as images and text. Inverse problems using such models require solving an inference problem of estimating the input and hidden units of the…

Information Theory · Computer Science 2019-03-05 Parthe Pandit , Mojtaba Sahraee , Sundeep Rangan , Alyson K. Fletcher

Sparse Regression Codes (SPARCs) are capacity-achieving codes introduced for communication over the Additive White Gaussian Noise (AWGN) channels and were later extended to general memoryless channels. In particular it was shown via…

Information Theory · Computer Science 2024-09-10 Yuhao Liu , Yizhou Xu , Tianqi Hou

We discuss a method for sparse signal approximation, which is based on the correlation of the target signal with a pseudo-random signal, and uses a modification of the greedy matching pursuit algorithm. We show that this approach provides…

Data Analysis, Statistics and Probability · Physics 2011-05-26 M. Andrecut

We analyse a linear regression problem with nonconvex regularization called smoothly clipped absolute deviation (SCAD) under an overcomplete Gaussian basis for Gaussian random data. We propose an approximate message passing (AMP) algorithm…

Machine Learning · Statistics 2018-04-04 Ayaka Sakata , Yingying Xu

This paper studies the problem of power allocation in compressed sensing when different components in the unknown sparse signal have different probability to be non-zero. Given the prior information of the non-uniform sparsity and the total…

Information Theory · Computer Science 2014-05-12 Xiaochen Zhao , Wei Dai

In the context of the compressed sensing problem, we propose a new ensemble of sparse random matrices which allow one (i) to acquire and compress a {\rho}0-sparse signal of length N in a time linear in N and (ii) to perfectly recover the…

Information Theory · Computer Science 2013-04-15 Maria Chiara Angelini , Federico Ricci-Tersenghi , Yoshiyuki Kabashima

We consider a compressive hyperspectral imaging reconstruction problem, where three-dimensional spatio-spectral information about a scene is sensed by a coded aperture snapshot spectral imager (CASSI). The approximate message passing (AMP)…

Information Theory · Computer Science 2015-09-09 Jin Tan , Yanting Ma , Hoover Rueda , Dror Baron , Gonzalo Arce

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

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

As one of the core technologies for 5G systems, massive multiple-input multiple-output (MIMO) introduces dramatic capacity improvements along with very high beamforming and spatial multiplexing gains. When developing efficient physical…

Information Theory · Computer Science 2023-11-01 Hengtao He , Xianghao Yu , Jun Zhang , Shenghui Song , Khaled B. Letaief

A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, solutions of underdetermined linear systems of equations. Many…

Information Theory · Computer Science 2010-04-13 Jeffrey D. Blanchard , Coralia Cartis , Jared Tanner , Andrew Thompson

We show how the notion of message passing can be used to streamline the algebra and computer coding for fast approximate inference in large Bayesian semiparametric regression models. In particular, this approach is amenable to handling…

Methodology · Statistics 2016-04-07 M. P. Wand
‹ Prev 1 8 9 10 Next ›