mlsanityData to 14 Oct 2026

A Perturbation Bound on the Subspace Estimator from Canonical Projections

arXiv 2206.14278 ↗First posted 28 Jun 2022stat.ML cs.IT cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

This paper derives a perturbation bound on the optimal subspace estimator obtained from a subset of its canonical projections contaminated by noise. This fundamental result has important implications in matrix completion, subspace clustering, and related problems.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 8 of its 26 references that are in the map. First posted on arXiv 28 Jun 2022.

Builds on

8 of 26 references.

References · 8

  1. 2015A Characterization of Deterministic Sampling Patterns for Low-Rank Matrix Completioncited by 13
  2. 2015Preference Completion: Large-scale Collaborative Ranking from Pairwise Comparisonscited by 11
  3. 2018Tensor Methods for Nonlinear Matrix Completioncited by 7
  4. 2017Fundamental Conditions for Low-CP-Rank Tensor Completioncited by 5
  5. 2014Deterministic Conditions for Subspace Identifiability from Incomplete Samplingcited by 2
  6. 2017Deterministic and Probabilistic Conditions for Finite Completability of Low-rank Multi-View Datacited by 1
  7. 2017On Deterministic Sampling Patterns for Robust Low-Rank Matrix Completioncited by 1
  8. 2018Mixture Matrix Completioncited by 1

Built on by

Not cited yet.