Robust Recovery of Sparse Nonnegative Weights from Mixtures of Positive-Semidefinite Matrices

03/26/2020
by   Fabian Jaensch, et al.
0

We consider a structured estimation problem where an observed matrix is assumed to be generated as an s-sparse linear combination of N given n× n positive-semidefinite matrices. Recovering the unknown N-dimensional and s-sparse weights from noisy observations is an important problem in various fields of signal processing and also a relevant pre-processing step in covariance estimation. We will present related recovery guarantees and focus on the case of nonnegative weights. The problem is formulated as a convex program and can be solved without further tuning. Such robust, non-Bayesian and parameter-free approaches are important for applications where prior distributions and further model parameters are unknown. Motivated by explicit applications in wireless communication, we will consider the particular rank-one case, where the known matrices are outer products of iid. zero-mean subgaussian n-dimensional complex vectors. We show that, for given n and N, one can recover nonnegative s–sparse weights with a parameter-free convex program once s≤ O(n^2 / log^2(N/n^2). Our error estimate scales linearly in the instantaneous noise power whereby the convex algorithm does not need prior bounds on the noise. Such estimates are important if the magnitude of the additive distortion depends on the unknown itself.

READ FULL TEXT

page 1

page 9

research
03/29/2020

Efficient Noise-Blind ℓ_1-Regression of Nonnegative Compressible Signals

In compressed sensing the goal is to recover a signal from as few as pos...
research
09/22/2018

A convex program for bilinear inversion of sparse vectors

We consider the bilinear inverse problem of recovering two vectors, x∈R^...
research
12/28/2021

Robust Sparse Recovery with Sparse Bernoulli matrices via Expanders

Sparse binary matrices are of great interest in the field of compressed ...
research
08/17/2022

Sparse Nonnegative Tucker Decomposition and Completion under Noisy Observations

Tensor decomposition is a powerful tool for extracting physically meanin...
research
08/19/2020

Robust Instance-Optimal Recovery of Sparse Signals at Unknown Noise Levels

We consider the problem of sparse signal recovery from noisy measurement...
research
10/07/2022

Maximum Likelihood-based Gridless DoA Estimation Using Structured Covariance Matrix Recovery and SBL with Grid Refinement

We consider the parametric data model employed in applications such as l...
research
06/25/2019

Bilinear Compressed Sensing under known Signs via Convex Programming

We consider the bilinear inverse problem of recovering two vectors, x∈R^...

Please sign up or login with your details

Forgot password? Click here to reset