English
Related papers

Related papers: Approximate Message Passing with Restricted Boltzm…

200 papers

Sparse Bayesian learning (SBL) can be implemented with low complexity based on the approximate message passing (AMP) algorithm. However, it is vulnerable to `difficult' measurement matrices as AMP can easily diverge. Damped AMP has been…

Information Theory · Computer Science 2019-08-20 Man Luo , Qinghua Guo

Orthogonal/vector approximate message-passing (AMP) is a powerful message-passing (MP) algorithm for signal reconstruction in compressed sensing. This paper proves the convergence of Bayes-optimal orthogonal/vector AMP in the large system…

Information Theory · Computer Science 2022-04-26 Keigo Takeuchi

We propose a scheme to estimate the parameters $b_i$ and $c_j$ of the bilinear form $z_m=\sum_{i,j} b_i z_m^{(i,j)} c_j$ from noisy measurements $\{y_m\}_{m=1}^M$, where $y_m$ and $z_m$ are related through an arbitrary likelihood function…

Information Theory · Computer Science 2016-05-25 Jason T. Parker , Philip Schniter

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

In many contexts, there is interest in selecting the most important variables from a very large collection, commonly referred to as support recovery or variable, feature or subset selection. There is an enormous literature proposing a rich…

Computation · Statistics 2015-06-23 Willem van den Boom , Galen Reeves , David B. Dunson

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

The estimation of a random vector with independent components passed through a linear transform followed by a componentwise (possibly nonlinear) output map arises in a range of applications. Approximate message passing (AMP) methods, based…

Information Theory · Computer Science 2016-05-03 Sundeep Rangan , Philip Schniter , Erwin Riegler , Alyson Fletcher , Volkan Cevher

Approximate message passing (AMP) and its variants, developed based on loopy belief propagation, are attractive for estimating a vector x from a noisy version of z = Ax, which arises in many applications. For a large A with i. i. d.…

Information Theory · Computer Science 2015-04-21 Qinghua Guo , Jiangtao Xi

The sparse Beyesian learning (also referred to as Bayesian compressed sensing) algorithm is one of the most popular approaches for sparse signal recovery, and has demonstrated superior performance in a series of experiments. Nevertheless,…

Information Theory · Computer Science 2015-01-21 Fuwei Li , Jun Fang , Huiping Duan , Zhi Chen , Hongbin Li

This paper considers the massive connectivity problem in an asynchronous grant-free random access system, where a huge number of devices sporadically transmit data to a base station (BS) with imperfect synchronization. The goal is to design…

Information Theory · Computer Science 2021-01-05 Weifeng Zhu , Meixia Tao , Xiaojun Yuan , Yunfeng Guan

The standard linear regression (SLR) problem is to recover a vector $\mathbf{x}^0$ from noisy linear observations $\mathbf{y}=\mathbf{Ax}^0+\mathbf{w}$. The approximate message passing (AMP) algorithm recently proposed by Donoho, Maleki,…

Information Theory · Computer Science 2018-07-24 Sundeep Rangan , Philip Schniter , Alyson K. Fletcher

Approximate message passing algorithm enjoyed considerable attention in the last decade. In this paper we introduce a variant of the AMP algorithm that takes into account glassy nature of the system under consideration. We coin this…

Disordered Systems and Neural Networks · Physics 2019-02-07 Fabrizio Antenucci , Florent Krzakala , Pierfrancesco Urbani , Lenka Zdeborová

In this paper we consider Basis Pursuit De-Noising (BPDN) problems in which the sparse original signal is drawn from a finite alphabet. To solve this problem we propose an iterative message passing algorithm, which capitalises not only on…

Information Theory · Computer Science 2016-11-17 Andreas Muller , Dino Sejdinovic , Robert Piechocki

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

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á

The Restricted Boltzmann Machine (RBM) is a stochastic neural network capable of solving a variety of difficult tasks such as NP-Hard combinatorial optimization problems and integer factorization. The RBM architecture is also very compact;…

Machine Learning · Computer Science 2020-10-15 Saavan Patel , Philip Canoza , Sayeef Salahuddin

Low-complexity Bayes-optimal memory approximate message passing (MAMP) is an efficient signal estimation algorithm in compressed sensing and multicarrier modulation. However, achieving replica Bayes optimality with MAMP necessitates a…

Information Theory · Computer Science 2024-07-19 Lei Liu , Ming Wang , Shufeng Li , Yuhao Chi , Ning Wei , ZhaoYang Zhang

We consider the problem of signal estimation in a generalized linear model (GLM). GLMs include many canonical problems in statistical estimation, such as linear regression, phase retrieval, and 1-bit compressed sensing. Recent work has…

Information Theory · Computer Science 2024-10-29 Pablo Pascual Cobo , Kuan Hsieh , Ramji Venkataramanan

Orthogonal time frequency space (OTFS) modulation has emerged as a promising solution to support high-mobility wireless communications, for which, cost-effective data detectors are critical. Although graph neural network (GNN)-based data…

Signal Processing · Electrical Eng. & Systems 2024-04-16 Wenhao Zhuang , Yuyi Mao , Hengtao He , Lei Xie , Shenghui Song , Yao Ge , Zhi Ding

Approximate Message Passing (AMP) algorithmshave recently gathered significant attention across disciplines such as statistical physics, machine learning, and communication systems. This study aims to extend AMP algorithms to non-symmetric…

Probability · Mathematics 2024-02-14 Mohammed-Younes Gueddari , Walid Hachem , Jamal Najim
‹ Prev 1 4 5 6 7 8 10 Next ›