English
Related papers

Related papers: Multi-Environment GLAMP: Approximate Message Passi…

200 papers

Approximate message passing (AMP) is a scalable, iterative approach to signal recovery. For structured random measurement ensembles, including independent and identically distributed (i.i.d.) Gaussian and rotationally-invariant matrices,…

Information Theory · Computer Science 2023-06-27 Dang Qua Nguyen , Taejoon Kim

This work explores multi-modal inference in a high-dimensional simplified model, analytically quantifying the performance gain of multi-modal inference over that of analyzing modalities in isolation. We present the Bayes-optimal performance…

Machine Learning · Statistics 2025-09-30 Christian Keup , Lenka Zdeborová

We consider the problem of decoding a discrete signal of categorical variables from the observation of several histograms of pooled subsets of it. We present an Approximate Message Passing (AMP) algorithm for recovering the signal in the…

Information Theory · Computer Science 2020-01-22 Ahmed El Alaoui , Aaditya Ramdas , Florent Krzakala , Lenka Zdeborova , Michael I. Jordan

Given a high-dimensional data matrix ${\boldsymbol A}\in{\mathbb R}^{m\times n}$, Approximate Message Passing (AMP) algorithms construct sequences of vectors ${\boldsymbol u}^t\in{\mathbb R}^n$, ${\boldsymbol v}^t\in{\mathbb R}^m$, indexed…

Information Theory · Computer Science 2017-08-15 Raphael Berthier , Andrea Montanari , Phan-Minh Nguyen

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á

This paper considers the estimation and prediction of a high-dimensional linear regression in the setting of transfer learning, using samples from the target model as well as auxiliary samples from different but possibly related regression…

Methodology · Statistics 2020-06-19 Sai Li , T. Tony Cai , Hongzhe Li

We present a novel method for learning the weights of an artificial neural network - a Message Passing Learning Protocol (MPLP). In MPLP, we abstract every operations occurring in ANNs as independent agents. Each agent is responsible for…

Machine Learning · Computer Science 2020-07-06 Ettore Randazzo , Eyvind Niklasson , Alexander Mordvintsev

In this work, a Bayesian approximate message passing algorithm is proposed for solving the multiple measurement vector (MMV) problem in compressive sensing, in which a collection of sparse signal vectors that share a common support are…

Information Theory · Computer Science 2013-01-29 Justin Ziniel , Philip Schniter

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

With a unified belief propagation (BP) and mean field (MF) framework, we propose an iterative message passing receiver, which performs joint channel state and noise precision (the reciprocal of noise variance) estimation and decoding for…

Information Theory · Computer Science 2017-11-13 Zhengdao Yuan , Chuanzong Zhang , Zhongyong Wang , Qinghua Guo , Sheng Wu , and Xingye Wang

We study compressed sensing (CS) signal reconstruction problems where an input signal is measured via matrix multiplication under additive white Gaussian noise. Our signals are assumed to be stationary and ergodic, but the input statistics…

Information Theory · Computer Science 2016-11-03 Yanting Ma , Junan Zhu , Dror Baron

We consider the problem of recovering an unknown signal ${\mathbf x}\in {\mathbb R}^n$ from general nonlinear measurements obtained through a generalized linear model (GLM), i.e., ${\mathbf y}= f\left({\mathbf A}{\mathbf x}+{\mathbf…

Information Theory · Computer Science 2022-10-18 Jiang Zhu , Xiangming Meng , Xupeng Lei , Qinghua Guo

We introduce a theoretical approach for designing generalizations of the approximate message passing (AMP) algorithm for compressed sensing which are valid for large observation matrices that are drawn from an invariant random matrix…

Information Theory · Computer Science 2017-05-12 Burak Çakmak , Manfred Opper , Ole Winther , Bernard H. Fleury

We consider the problem of recovering a vector $\beta_o \in \mathbb{R}^p$ from $n$ random and noisy linear observations $y= X\beta_o + w$, where $X$ is the measurement matrix and $w$ is noise. The LASSO estimate is given by the solution to…

Statistics Theory · Mathematics 2015-11-05 Ali Mousavi , Arian Maleki , Richard G. Baraniuk

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

Gradient-descent-based algorithms and their stochastic versions have widespread applications in machine learning and statistical inference. In this work we perform an analytic study of the performances of one of them, the Langevin…

This paper tackles the problem of millimeter-Wave (mmWave) channel estimation in massive MIMO communication systems. A new Bayes-optimal channel estimator is derived using recent advances in the approximate belief propagation (BP) Bayesian…

Information Theory · Computer Science 2019-03-07 Faouzi Bellili , Foad Sohrabi , Wei Yu

In this paper, we present structured message passing (SMP), a unifying framework for approximate inference algorithms that take advantage of structured representations such as algebraic decision diagrams and sparse hash tables. These…

Artificial Intelligence · Computer Science 2013-09-27 Vibhav Gogate , Pedro Domingos

We consider the problem of recovering clustered sparse signals with no prior knowledge of the sparsity pattern. Beyond simple sparsity, signals of interest often exhibits an underlying sparsity pattern which, if leveraged, can improve the…

Information Theory · Computer Science 2016-01-05 Xiangming Meng , Sheng Wu , Linling Kuang , Defeng , Huang , Jianhua Lu

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