English
Related papers

Related papers: Orthogonal Approximate Message Passing with Optima…

200 papers

In a recent article (Proc. Natl. Acad. Sci., 110(36), 14557-14562), El Karoui et al. study the distribution of robust regression estimators in the regime in which the number of parameters p is of the same order as the number of samples n.…

Statistics Theory · Mathematics 2013-11-18 David Donoho , Andrea Montanari

Orbital angular momentum (OAM) at radio frequency (RF) provides a novel approach of multiplexing a set of orthogonal modes on the same frequency channel to achieve high spectrum efficiencies. However, there are still big challenges in the…

Signal Processing · Electrical Eng. & Systems 2020-07-07 Rui Chen , Wen-Xuan Long , Xiaodong Wang , Jiandong Li

The orthogonal matching pursuit (OMP) is an algorithm to solve sparse approximation problems. Sufficient conditions for exact recovery are known with and without noise. In this paper we investigate the applicability of the OMP for the…

Numerical Analysis · Mathematics 2010-10-26 Loic Denis , Dirk A. Lorenz , Dennis Trede

In this paper, we propose a practical receiver for multicarrier signals subjected to a strong memoryless nonlinearity. The receiver design is based on a generalized approximate message passing (GAMP) framework, and this allows real-time…

Information Theory · Computer Science 2017-03-07 Sergey V. Zhidkov

The orthogonal multi-matching pursuit (OMMP) is a natural extension of orthogonal matching pursuit (OMP). We denote the OMMP with the parameter $M$ as OMMP(M) where $M\geq 1$ is an integer. The main difference between OMP and OMMP(M) is…

Information Theory · Computer Science 2013-07-18 Zhiqiang Xu

Computing maximum a posteriori (MAP) estimation in graphical models is an important inference problem with many applications. We present message-passing algorithms for quadratic programming (QP) formulations of MAP estimation for pairwise…

Artificial Intelligence · Computer Science 2012-02-20 Akshat Kumar , Shlomo Zilberstein

In this paper we consider the generalized approximate message passing (GAMP) algorithm for recovering a sparse signal from modulo samples of randomized projections of the unknown signal. The modulo samples are obtained by a self-reset (SR)…

Signal Processing · Electrical Eng. & Systems 2018-07-10 Osman Musa , Peter Jung , Norbert Goertz

Estimating a vector $\mathbf{x}$ from noisy linear measurements $\mathbf{Ax}+\mathbf{w}$ often requires use of prior knowledge or structural constraints on $\mathbf{x}$ for accurate reconstruction. Several recent works have considered…

Information Theory · Computer Science 2020-01-29 Alyson K. Fletcher , Sundeep Rangan , Subrata Sarkar , Philip Schniter

The denoising-based approximate message passing (D-AMP) methodology, recently proposed by Metzler, Maleki, and Baraniuk, allows one to plug in sophisticated denoisers like BM3D into the AMP algorithm to achieve state-of-the-art compressive…

Information Theory · Computer Science 2016-11-07 Philip Schniter , Sundeep Rangan , Alyson Fletcher

Integrated sensing and communication (ISAC) is a promising candidate technology for 6G due to its improvement in spectral efficiency and energy efficiency. Orthogonal frequency division multiplexing (OFDM) signal is a mainstream candidate…

Signal Processing · Electrical Eng. & Systems 2025-08-19 Lin Wang , Zhiqing Wei , Xu Chen , Zhiyong Feng

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

We consider the problem of parameter estimation in a high-dimensional generalized linear model. Spectral methods obtained via the principal eigenvector of a suitable data-dependent matrix provide a simple yet surprisingly effective…

Statistics Theory · Mathematics 2025-07-11 Yihan Zhang , Hong Chang Ji , Ramji Venkataramanan , Marco Mondelli

In a recent paper, the authors proposed a new class of low-complexity iterative thresholding algorithms for reconstructing sparse signals from a small set of linear measurements \cite{DMM}. The new algorithms are broadly referred to as AMP,…

Information Theory · Computer Science 2009-11-24 David L. Donoho , Arian Maleki , Andrea Montanari

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 encountered in compressive sensing, where one seeks to…

Information Theory · Computer Science 2016-07-21 Mark Borgerding , Philip Schniter

Greedy algorithms for minimizing L0-norm of sparse decomposition have profound application impact on many signal processing problems. In the sparse coding setup, given the observations $\mathrm{y}$ and the redundant dictionary…

Numerical Analysis · Computer Science 2015-02-13 Yuanyi Xue , Yao Wang

As an emerging communication auxiliary technology, reconfigurable intelligent surface (RIS) is expected to play a significant role in the upcoming 6G networks. Due to its total reflection characteristics, it is challenging to implement…

Signal Processing · Electrical Eng. & Systems 2023-08-04 W. Li , Z. Lin , Q. Guo , B. Vucetic

This paper investigates a large unitarily invariant system (LUIS) involving a unitarily invariant sensing matrix, an arbitrary fixed signal distribution, and forward error control (FEC) coding. Several area properties are established based…

Information Theory · Computer Science 2022-06-24 Lei Liu , Shansuo Liang , Li Ping

In wireless communication systems, Orthogonal Frequency-Division Multiplexing (OFDM) includes variants using either a cyclic prefix (CP) or a zero padding (ZP) as the guard interval to avoid inter-symbol interference. OFDM is ideally suited…

Signal Processing · Electrical Eng. & Systems 2020-08-18 Koosha Pourtahmasi Roshandeh , Mostafa Mohammadkarimi , Masoud Ardakani

Since most components of sparse multi-path channel (SMPC) are zero, impulse response of SMPC can be recovered from a short training sequence. Though the ordinary orthogonal matching pursuit (OMP) algorithm provides a very fast…

Information Theory · Computer Science 2010-05-24 Ruiming Yang , Qun Wan , Yipeng Liu , Wanlin Yang

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