Random perturbation and matrix sparsification and completion

03/02/2018
by   Sean O'Rourke, et al.
0

We discuss general perturbation inequalities when the perturbation is random. As applications, we obtain several new results concerning two important problems: matrix sparsification and matrix completion.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/10/2016

A note on the statistical view of matrix completion

A very simple interpretation of matrix completion problem is introduced ...
research
06/28/2022

A Perturbation Bound on the Subspace Estimator from Canonical Projections

This paper derives a perturbation bound on the optimal subspace estimato...
research
08/04/2020

Recovering a perturbation of a matrix polynomial from a perturbation of its linearization

A number of theoretical and computational problems for matrix polynomial...
research
02/23/2018

Abstract Completion, Formalized

Completion is one of the most studied techniques in term rewriting and f...
research
10/02/2021

One-Bit Matrix Completion with Differential Privacy

Matrix completion is a prevailing collaborative filtering method for rec...
research
11/18/2022

Always Valid Risk Monitoring for Online Matrix Completion

Always-valid concentration inequalities are increasingly used as perform...
research
11/03/2010

Performance Analysis of Spectral Clustering on Compressed, Incomplete and Inaccurate Measurements

Spectral clustering is one of the most widely used techniques for extrac...

Please sign up or login with your details

Forgot password? Click here to reset