English
Related papers

Related papers: Asymptotic Analysis of Complex LASSO via Complex A…

200 papers

The Approximate Message Passing (AMP) algorithm efficiently reconstructs signals which have been sampled with large i.i.d. sub-Gaussian sensing matrices. Central to AMP is its "state evolution", which guarantees that the difference between…

Signal Processing · Electrical Eng. & Systems 2020-09-08 Charles Millard , Aaron T Hess , Boris Mailhé , Jared Tanner

This paper introduces a framework for approximate message passing (AMP) in dynamic settings where the data at each iteration is passed through a linear operator. This framework is motivated in part by applications in large-scale,…

Statistics Theory · Mathematics 2026-01-19 Riccardo Rossetti , Bobak Nazer , Galen Reeves

Orthogonal approximate message-passing (OAMP) is proposed for signal recovery from right-orthogonally invariant linear measurements with spatial coupling. Conventional state evolution is generalized to a unified framework of state evolution…

Information Theory · Computer Science 2023-05-22 Keigo Takeuchi

This article considers recovery of signals that are sparse or approximately sparse in terms of a (possibly) highly overcomplete and coherent tight frame from undersampled data corrupted with additive noise. We show that the properly…

Information Theory · Computer Science 2013-09-10 Junhong Lin , Song Li

Vector Approximate Message Passing (VAMP) provides the means of solving a linear inverse problem in a Bayes-optimal way assuming the measurement operator is sufficiently random. However, VAMP requires implementing the linear minimum mean…

Information Theory · Computer Science 2022-06-23 Nikolajs Skuratovs , Mike E. Davies

A signal recovery scheme is developed for linear observation systems based on expectation consistent (EC) mean field approximation. Approximate message passing (AMP) is known to be consistent with the results obtained using the replica…

Information Theory · Computer Science 2014-07-08 Yoshiyuki Kabashima , Mikko Vehkapera

The paper explores the problem of \emph{spectral compressed sensing}, which aims to recover a spectrally sparse signal from a small random subset of its $n$ time domain samples. The signal of interest is assumed to be a superposition of $r$…

Information Theory · Computer Science 2015-01-05 Yuxin Chen , Yuejie Chi

In this paper, utilizing techniques in compressed sensing, parallel optimization and deep learning, we propose a model-driven approach to jointly design the common measurement matrix and GROUP LASSO-based jointly sparse signal recovery…

Information Theory · Computer Science 2020-02-10 Shuaichao Li , Wanqing Zhang , Ying Cui

We consider the problem of learning a coefficient vector $x_{0}$ in $R^{N}$ from noisy linear observations $y=Fx_{0}+w$ in $R^{M}$ in the high dimensional limit $M,N$ to infinity with $\alpha=M/N$ fixed. We provide a rigorous derivation of…

Machine Learning · Statistics 2020-02-12 Cédric Gerbelot , Alia Abbara , Florent Krzakala

Channel estimation problem is one of the key technical issues in time-variant multiple-input single-output (MSIO) communication systems. To estimate the MISO channel, least mean square (LMS) algorithm is applied to adaptive channel…

Information Theory · Computer Science 2013-02-07 Guan Gui , Wei Peng , Abolfazl Mehbodniya , Fumiyuki Adachi

We consider an $\ell_2$-regularized non-convex optimization problem for recovering signals from their noisy phaseless observations. We design and study the performance of a message passing algorithm that aims to solve this optimization…

Information Theory · Computer Science 2018-02-27 Junjie Ma , Ji Xu , Arian Maleki

Gaussian and quadratic approximations of message passing algorithms on graphs have attracted considerable recent attention due to their computational simplicity, analytic tractability, and wide applicability in optimization and statistical…

Information Theory · Computer Science 2026-03-12 Sundeep Rangan , Alyson K. Fletcher , Vivek K. Goyal , Evan Byrne , Philip Schniter

The least-absolute shrinkage and selection operator (LASSO) is a regularization technique for estimating sparse signals of interest emerging in various applications and can be efficiently solved via the alternating direction method of…

Information Theory · Computer Science 2022-08-25 Huiyue Yi , Yan Xu , Wuxiong Zhang , Hui Xu

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 problem of recovering a signal $\mathbf{x}^* \in \mathbf{R}^n$, from magnitude-only measurements $y_i = |\left\langle\mathbf{a}_i,\mathbf{x}^*\right\rangle|$ for $i=[m]$. Also called the phase retrieval, this is a…

Machine Learning · Statistics 2017-11-28 Gauri Jagatap , Chinmay Hegde

An approximate method for conducting resampling in Lasso, the $\ell_1$ penalized linear regression, in a semi-analytic manner is developed, whereby the average over the resampled datasets is directly computed without repeated numerical…

Machine Learning · Statistics 2018-12-11 Tomoyuki Obuchi , Yoshiyuki Kabashima

Solving a large-scale regularized linear inverse problem using multiple processors is important in various real-world applications due to the limitations of individual processors and constraints on data sharing policies. This paper focuses…

Information Theory · Computer Science 2017-01-31 Yanting Ma , Yue M. Lu , Dror Baron

Intensively growing approach in signal processing and acquisition, the Compressive Sensing approach, allows sparse signals to be recovered from small number of randomly acquired signal coefficients. This paper analyses some of the commonly…

Signal Processing · Electrical Eng. & Systems 2018-02-21 Tamara Koljensic , Caslav Labudovic

Over the past years, there are increasing interests in recovering the signals from undersampling data where such signals are sparse under some orthogonal dictionary or tight framework, which is referred to be sparse synthetic model. More…

Information Theory · Computer Science 2012-02-10 Lianlin Li

For the problem of binary linear classification and feature selection, we propose algorithmic approaches to classifier design based on the generalized approximate message passing (GAMP) algorithm, recently proposed in the context of…

Information Theory · Computer Science 2015-06-18 Justin Ziniel , Philip Schniter , Per Sederberg
‹ Prev 1 8 9 10 Next ›