English
Related papers

Related papers: Approximate Message Passing algorithms for rotatio…

200 papers

Often, large, high dimensional datasets collected across multiple modalities can be organized as a higher order tensor. Low-rank tensor decomposition then arises as a powerful and widely used tool to discover simple low dimensional…

Machine Learning · Statistics 2020-01-29 Jonathan Kadmon , Surya Ganguli

The generalized approximate message passing (GAMP) algorithm under the Bayesian setting shows advantage in recovering under-sampled sparse signals from corrupted observations. Compared to conventional convex optimization methods, it has a…

Information Theory · Computer Science 2017-01-12 Shuai Huang , Trac D. Tran

Deep learning has gained great popularity due to its widespread success on many inference problems. We consider the application of deep learning to the sparse linear inverse problem, where one seeks to recover a sparse signal from a few…

Information Theory · Computer Science 2017-08-02 Mark Borgerding , Philip Schniter , Sundeep Rangan

In this paper we consider the generalized approximate message passing (GAMP) algorithm for recovering a sparse signal from modulo samples of randomized projections of the unknown signal. The modulo samples are obtained by a self-reset (SR)…

Signal Processing · Electrical Eng. & Systems 2018-07-10 Osman Musa , Peter Jung , Norbert Goertz

The ubiquity of approximately sparse data has led a variety of com- munities to great interest in compressed sensing algorithms. Although these are very successful and well understood for linear measurements with additive noise, applying…

Information Theory · Computer Science 2016-07-27 Christophe Schülke , Francesco Caltagirone , Lenka Zdeborová

In the pooled data problem, the goal is to identify the categories associated with a large collection of items via a sequence of pooled tests. Each pooled test reveals the number of items of each category within the pool. We study an…

Information Theory · Computer Science 2024-10-25 Nelvin Tan , Pablo Pascual Cobo , Jonathan Scarlett , Ramji Venkataramanan

We extend the generalized approximate message passing (G-AMP) approach, originally proposed for high-dimensional generalized-linear regression in the context of compressive sensing, to the generalized-bilinear case, which enables its…

Information Theory · Computer Science 2015-06-17 Jason T. Parker , Philip Schniter , Volkan Cevher

X-ray Computed Tomography (CT) reconstruction from a sparse number of views is a useful way to reduce either the radiation dose or the acquisition time, for example in fixed-gantry CT systems, however this results in an ill-posed inverse…

Data Structures and Algorithms · Computer Science 2020-11-04 Alessandro Perelli , Michael Lexa , Ali Can , 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á

Deep learning has gained great popularity due to its widespread success on many inference problems. We consider the application of deep learning to the sparse linear inverse problem encountered in compressive sensing, where one seeks to…

Information Theory · Computer Science 2016-07-21 Mark Borgerding , Philip Schniter

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

A common sparse linear regression formulation is the l1 regularized least squares, which is also known as least absolute shrinkage and selection operator (LASSO). Approximate message passing (AMP) has been proved to asymptotically achieve…

Information Theory · Computer Science 2021-07-01 Yanting Ma , Min Kang , Jack W. Silverstein , Dror Baron

We consider the problem of localizing change points in a generalized linear model (GLM), a model that covers many widely studied problems in statistical learning including linear, logistic, and rectified linear regression. We propose a…

Machine Learning · Statistics 2025-09-08 Gabriel Arpino , Xiaoqi Liu , Julia Gontarek , Ramji Venkataramanan

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

We consider large-scale linear inverse problems in Bayesian settings. We follow a recent line of work that applies the approximate message passing (AMP) framework to multi-processor (MP) computational systems, where each processor node…

Information Theory · Computer Science 2016-11-09 Junan Zhu , Dror Baron , Ahmad Beirami

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á

We consider the algorithmic problem of finding a near ground state (near optimal solution) of a $p$-spin model. We show that for a class of algorithms broadly defined as Approximate Message Passing (AMP), the presence of the Overlap Gap…

Probability · Mathematics 2019-11-27 David Gamarnik , Aukosh Jagannath

Approximate Message Passing (AMP), originally designed to solve high-dimensional linear inverse problems, has found broad applications in signal processing and statistical inference. Among its key variants, Vector Approximate Message…

Information Theory · Computer Science 2024-10-29 Qun Chen , Haochuan Zhang , Huimin Zhu

This paper proposes a fast approximate message-passing (AMP) algorithm for solving compressed sensing (CS) recovery problems with 1D-finite-difference sparsity in term of MMSE estimation. The proposed algorithm, named ssAMP-BGFD, is…

Information Theory · Computer Science 2015-09-07 Jaewook Kang , Hyoyoung Jung , Heung-No Lee , Kiseon Kim

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
‹ Prev 1 4 5 6 7 8 10 Next ›