English
Related papers

Related papers: Replicated Vector Approximate Message Passing For …

200 papers

Vector approximate message passing (VAMP) is an efficient approximate inference algorithm used for generalized linear models. Although VAMP exhibits excellent performance, particularly when measurement matrices are sampled from rotationally…

Information Theory · Computer Science 2025-08-05 Takashi Takahashi , Yoshiyuki Kabashima

We consider the estimation of an i.i.d.\ random vector observed through a linear transform followed by a componentwise, probabilistic (possibly nonlinear) measurement channel. A novel algorithm, called generalized approximate message…

Information Theory · Computer Science 2012-08-15 Sundeep Rangan

This thesis is interested in the application of statistical physics methods and inference to sparse linear estimation problems. The main tools are the graphical models and approximate message-passing algorithm together with the cavity…

Information Theory · Computer Science 2015-11-06 Jean Barbier

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

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

Probabilistic inference problems arise naturally in distributed systems such as sensor networks and teams of mobile robots. Inference algorithms that use message passing are a natural fit for distributed systems, but they must be robust to…

Artificial Intelligence · Computer Science 2012-07-19 Mark Paskin , Carlos E. Guestrin

We consider the estimation of a signal from the knowledge of its noisy linear random Gaussian projections. A few examples where this problem is relevant are compressed sensing, sparse superposition codes, and code division multiple access.…

Information Theory · Computer Science 2020-08-31 Jean Barbier , Nicolas Macris , Mohamad Dia , Florent Krzakala

Compressed sensing aims to undersample certain high-dimensional signals, yet accurately reconstruct them by exploiting signal characteristics. Accurate reconstruction is possible when the object to be recovered is sufficiently sparse in a…

Information Theory · Computer Science 2015-05-13 David L. Donoho , Arian Maleki , Andrea Montanari

We study the compressed sensing reconstruction problem for a broad class of random, band-diagonal sensing matrices. This construction is inspired by the idea of spatial coupling in coding theory. As demonstrated heuristically and…

Information Theory · Computer Science 2015-03-19 David L. Donoho , Adel Javanmard , Andrea Montanari

Vector approximate message passing (VAMP) is a computationally simple approach to the recovery of a signal $\mathbf{x}$ from noisy linear measurements $\mathbf{y}=\mathbf{Ax}+\mathbf{w}$. Like the AMP proposed by Donoho, Maleki, and…

Information Theory · Computer Science 2018-03-09 Alyson K. Fletcher , Philip Schniter

Approximate Message Passing (AMP) has been shown to be a superior method for inference problems, such as the recovery of signals from sets of noisy, lower-dimensionality measurements, both in terms of reconstruction accuracy and in…

Information Theory · Computer Science 2015-06-10 Andre Manoel , Florent Krzakala , Eric W. Tramel , Lenka Zdeborová

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

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

Phase retrieval refers to the problem of recovering a high-dimensional vector $\boldsymbol{x} \in \mathbb{C}^N$ from the magnitude of its linear transform $\boldsymbol{z} = A \boldsymbol{x}$, observed through a noisy channel. To improve the…

Computation · Statistics 2024-10-10 Hajime Ueda , Shun Katakami , Masato Okada

We consider the variable selection problem of generalized linear models (GLMs). Stability selection (SS) is a promising method proposed for solving this problem. Although SS provides practical variable selection criteria, it is…

Machine Learning · Statistics 2025-08-06 Takashi Takahashi , Yoshiyuki Kabashima

There has been a recent surge of interest in the study of asymptotic reconstruction performance in various cases of generalized linear estimation problems in the teacher-student setting, especially for the case of i.i.d standard normal…

Machine Learning · Statistics 2023-02-20 Cedric Gerbelot , Alia Abbara , Florent Krzakala

In Compressed Sensing, a real-valued sparse vector has to be estimated from an underdetermined system of linear equations. In many applications, however, the elements of the sparse vector are drawn from a finite set. For the estimation of…

Information Theory · Computer Science 2016-08-24 Susanne Sparrer , Robert F. H. Fischer

Reconstruction of images from noisy linear measurements is a core problem in image processing, for which convex optimization methods based on total variation (TV) minimization have been the long-standing state-of-the-art. We present an…

Information Theory · Computer Science 2016-08-31 Jean Barbier , Eric W. Tramel , Florent Krzakala

The article is devoted to the resampling approach application to the reliability problems. This approach to reliability problems was first proposed by Ivnitsky (1967). Resampling is intensive statistical computer method, which is…

Applications · Statistics 2013-04-25 Maxim Fioshin , Helen Fioshina

The replica method is a non-rigorous but well-known technique from statistical physics used in the asymptotic analysis of large, random, nonlinear problems. This paper applies the replica method, under the assumption of replica symmetry, to…

Information Theory · Computer Science 2015-01-20 Sundeep Rangan , Alyson K. Fletcher , Vivek K Goyal
‹ Prev 1 2 3 10 Next ›