Adversarial Robust Low Rank Matrix Estimation: Compressed Sensing and Matrix Completion

10/25/2020
by   Takeyuki Sasai, et al.
0

We consider robust low rank matrix estimation when random noise is heavy-tailed and output is contaminated by adversarial noise. Under the clear conditions, we firstly attain a fast convergence rate for low rank matrix estimation including compressed sensing and matrix completion with convex estimators.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/24/2021

GNMR: A provable one-line algorithm for low rank matrix recovery

Low rank matrix recovery problems, including matrix completion and matri...
research
02/12/2013

Coherence and sufficient sampling densities for reconstruction in compressed sensing

We give a new, very general, formulation of the compressed sensing probl...
research
06/09/2022

Robust Matrix Completion with Heavy-tailed Noise

This paper studies low-rank matrix completion in the presence of heavy-t...
research
07/05/2019

Depth Restoration: A fast low-rank matrix completion via dual-graph regularization

As a real scenes sensing approach, depth information obtains the widespr...
research
02/11/2018

TARM: A Turbo-type Algorithm for Affine Rank Minimization

The affine rank minimization (ARM) problem arises in many real-world app...
research
07/18/2020

Compressed sensing of low-rank plus sparse matrices

Expressing a matrix as the sum of a low-rank matrix plus a sparse matrix...
research
02/06/2019

Robust Matrix Completion State Estimation in Distribution Systems

Due to the insufficient measurements in the distribution system state es...

Please sign up or login with your details

Forgot password? Click here to reset