Log In Sign Up

Composite optimization for robust blind deconvolution

by   Vasileios Charisopoulos, et al.

The blind deconvolution problem seeks to recover a pair of vectors from a set of rank one bilinear measurements. We consider a natural nonsmooth formulation of the problem and show that under standard statistical assumptions, its moduli of weak convexity, sharpness, and Lipschitz continuity are all dimension independent. This phenomenon persists even when up to half of the measurements are corrupted by noise. Consequently, standard algorithms, such as the subgradient and prox-linear methods, converge at a rapid dimension-independent rate when initialized within constant relative error of the solution. We then complete the paper with a new initialization strategy, complementing the local search algorithms. The initialization procedure is both provably efficient and robust to outlying measurements. Numerical experiments, on both simulated and real data, illustrate the developed theory and methods.


Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence

The task of recovering a low-rank matrix from its noisy linear measureme...

Robust Blind Deconvolution via Mirror Descent

We revisit the Blind Deconvolution problem with a focus on understanding...

Simultaneous Phase Retrieval and Blind Deconvolution via Convex Programming

We consider the task of recovering two real or complex m-vectors from ph...

Median-Truncated Nonconvex Approach for Phase Retrieval with Outliers

This paper investigates the phase retrieval problem, which aims to recov...

On the convex geometry of blind deconvolution and matrix completion

Low-rank matrix recovery from structured measurements has been a topic o...

Blind Deconvolutional Phase Retrieval via Convex Programming

We consider the task of recovering two real or complex m-vectors from ph...

Bilinear Compressed Sensing under known Signs via Convex Programming

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