English
Related papers

Related papers: Discussion of "Fast Approximate Inference for Arbi…

200 papers

We consider the problem of signal estimation in generalized linear models defined via rotationally invariant design matrices. Since these matrices can have an arbitrary spectral distribution, this model is well suited for capturing complex…

Machine Learning · Statistics 2022-06-10 Ramji Venkataramanan , Kevin Kögler , Marco Mondelli

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

The problem of estimating a random vector x from noisy linear measurements y = A x + w with unknown parameters on the distributions of x and w, which must also be learned, arises in a wide range of statistical learning and linear inverse…

Information Theory · Computer Science 2017-06-20 Alyson K. Fletcher , Mojtaba Sahraee-Ardakan , Philip Schniter , Sundeep Rangan

We consider the estimation of an i.i.d. (possibly non-Gaussian) vector $\xbf \in \R^n$ from measurements $\ybf \in \R^m$ obtained by a general cascade model consisting of a known linear transform followed by a probabilistic componentwise…

Information Theory · Computer Science 2012-12-04 Ulugbek S. Kamilov , Sundeep Rangan , Alyson K. Fletcher , Michael Unser

Approximate message passing (AMP) refers to a class of efficient algorithms for statistical estimation in high-dimensional problems such as compressed sensing and low-rank matrix estimation. This paper analyzes the performance of AMP in the…

Information Theory · Computer Science 2018-10-23 Cynthia Rush , Ramji Venkataramanan

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

Approximate message passing is an iterative algorithm for compressed sensing and related applications. A solid theory about the performance and convergence of the algorithm exists for measurement matrices having iid entries of zero mean.…

Information Theory · Computer Science 2014-10-03 Francesco Caltagirone , Florent Krzakala , Lenka Zdeborová

Approximate message passing (AMP) methods have gained recent traction in sparse signal recovery. Additional information about the signal, or \emph{side information} (SI), is commonly available and can aid in efficient signal recovery. This…

Information Theory · Computer Science 2019-05-06 Anna Ma , You , Zhou , Cynthia Rush , Dror Baron , Deanna Needell

Generalised approximate message passing (GAMP) is an approximate Bayesian estimation algorithm for signals observed through a linear transform with a possibly non-linear subsequent measurement model. By leveraging prior information about…

Signal Processing · Electrical Eng. & Systems 2018-12-05 Christian Schou Oxvig , Thomas Arildsen

In many areas of applied statistics and machine learning, generating an arbitrary number of independent and identically distributed (i.i.d.) samples from a given distribution is a key task. When the distribution is known only through…

Artificial Intelligence · Computer Science 2021-10-29 Ulysse Marteau-Ferey , Francis Bach , Alessandro Rudi

Discussion of "Frequentist coverage of adaptive nonparametric Bayesian credible sets" by Szab\'o, van der Vaart and van Zanten [arXiv:1310.4489v5].

Statistics Theory · Mathematics 2015-09-08 Subhashis Ghosal

Discussion of "Frequentist coverage of adaptive nonparametric Bayesian credible sets" by Szab\'o, van der Vaart and van Zanten [arXiv:1310.4489v5].

Statistics Theory · Mathematics 2015-09-08 Mark G. Low , Zongming Ma

Discussion of "Frequentist coverage of adaptive nonparametric Bayesian credible sets" by Szab\'o, van der Vaart and van Zanten [arXiv:1310.4489v5].

Statistics Theory · Mathematics 2015-09-08 Judith Rousseau

Discussion of "Frequentist coverage of adaptive nonparametric Bayesian credible sets" by Szab\'o, van der Vaart and van Zanten [arXiv:1310.4489v5].

Statistics Theory · Mathematics 2015-09-08 Ismaël Castillo

Discussion of "Frequentist coverage of adaptive nonparametric Bayesian credible sets" by Szab\'o, van der Vaart and van Zanten [arXiv:1310.4489v5].

Statistics Theory · Mathematics 2015-09-08 Richard Nickl

Approximate message-passing (AMP) method is a simple and efficient framework for the linear inverse problems. In this letter, we propose a faster AMP to solve the \emph{$L_1$-Split-Analysis} for the 2D sparsity separation, which is referred…

Information Theory · Computer Science 2015-07-13 Jaewook Kang , Hyoyoung Jung , Kiseon Kim

Variational inference offers scalable and flexible tools to tackle intractable Bayesian inference of modern statistical models like Bayesian neural networks and Gaussian processes. For largely over-parameterized models, however, the…

Machine Learning · Statistics 2019-12-03 Simone Rossi , Sebastien Marmin , Maurizio Filippone

An improved inference method for densely connected systems is presented. The approach is based on passing condensed messages between variables, representing macroscopic averages of microscopic messages. We extend previous work that showed…

Information Theory · Computer Science 2009-11-11 Juan P. Neirotti , David Saad

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

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