English
Related papers

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

200 papers

In this paper, we consider a general form of noisy compressive sensing (CS) where the sensing matrix is not precisely known. Such cases exist when there are imperfections or unknown calibration parameters during the measurement process.…

Signal Processing · Electrical Eng. & Systems 2018-08-28 Jiang Zhu , Qi Zhang , Xiangming Meng , Zhiwei Xu

Generalized approximate message passing (GAMP) is a computationally efficient algorithm for estimating an unknown signal $w_0\in\mathbb{R}^N$ from a random linear measurement $y= Xw_0 + \epsilon\in\mathbb{R}^M$, where…

Information Theory · Computer Science 2025-08-06 Takashi Takahashi

In this paper, we study the compressed sensing reconstruction problem with generalized elastic net prior (GENP), where a sparse signal is sampled via a noisy underdetermined linear observation system, and an additional initial estimation of…

Information Theory · Computer Science 2015-02-19 Xing Wang , Jie Liang

A concise expectation propagation (EP) based message passing algorithm (MPA) is derived for the general measurement channel. By neglecting some high-order infinitesimal terms, the EP-MPA is proven to be equivalent to the Generalized…

Information Theory · Computer Science 2019-07-11 Lei Liu , Ying Li , Chongwen Huang , Chau Yuen , Yong Liang Guan

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

Diffusion Large Language Models (DLLMs) have emerged as a powerful alternative to autoregressive models, enabling parallel token generation across multiple positions. However, preference alignment of DLLMs remains challenging due to high…

Computation and Language · Computer Science 2026-02-04 Liang Lin , Feng Xiong , Zengbin Wang , Kun Wang , Junhao Dong , Xuecai Hu , Yong Wang , Xiangxiang Chu

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

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

In this paper, we address the problem of recovering complex-valued signals from a set of complex-valued linear measurements. Approximate message passing (AMP) is one state-of-the-art algorithm to recover real-valued sparse signals. However,…

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

This is Part II of a two-part work on the estimation for a multi-layer generalized linear model (ML-GLM) in large system limits. In Part I, we had analyzed the asymptotic performance of an exact MMSE estimator, and obtained a set of coupled…

Information Theory · Computer Science 2020-07-21 Qiuyun Zou , Haochuan Zhang , Hongwen Yang

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

Approximate message passing (AMP) is a low-cost iterative parameter-estimation technique for certain high-dimensional linear systems with non-Gaussian distributions. AMP only applies to independent identically distributed (IID) transform…

Information Theory · Computer Science 2022-06-24 Lei Liu , Shunqi Huang , Brian M. Kurkoski

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

Deep generative priors are a powerful tool for reconstruction problems with complex data such as images and text. Inverse problems using such models require solving an inference problem of estimating the input and hidden units of the…

Information Theory · Computer Science 2019-03-05 Parthe Pandit , Mojtaba Sahraee , Sundeep Rangan , Alyson K. Fletcher

Generalized Linear Models (GLMs), where a random vector $\mathbf{x}$ is observed through a noisy, possibly nonlinear, function of a linear transform $\mathbf{z}=\mathbf{Ax}$ arise in a range of applications in nonlinear filtering and…

Information Theory · Computer Science 2016-05-03 Sundeep Rangan , Alyson K. Fletcher , Philip Schniter , Ulugbek Kamilov

We introduce a new approach to prediction in graphical models with latent-shift adaptation, i.e., where source and target environments differ in the distribution of an unobserved confounding latent variable. Previous work has shown that as…

Machine Learning · Statistics 2023-06-26 William I. Walker , Arthur Gretton , Maneesh Sahani

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

Computational simulation of chemical and biological systems using ab initio molecular dynamics has been a challenge over decades. Researchers have attempted to address the problem with machine learning and fragmentation-based methods.…

Chemical Physics · Physics 2024-07-16 Yunyang Li , Yusong Wang , Lin Huang , Han Yang , Xinran Wei , Jia Zhang , Tong Wang , Zun Wang , Bin Shao , Tie-Yan Liu

This paper addresses the reconstruction of an unknown signal vector with sublinear sparsity from generalized linear measurements. Generalized approximate message-passing (GAMP) is proposed via state evolution in the sublinear sparsity…

Information Theory · Computer Science 2025-02-21 Keigo Takeuchi

Retraining a model using its own predictions together with the original, potentially noisy labels is a well-known strategy for improving the model performance. While prior works have demonstrated the benefits of specific heuristic…

Machine Learning · Computer Science 2025-05-22 Adel Javanmard , Rudrajit Das , Alessandro Epasto , Vahab Mirrokni
‹ Prev 1 4 5 6 7 8 10 Next ›