activity
20142025
most citedAn Overview of Robust Subspace Recovery

120 citations · 273 across the 13 of their papers we have counts for

collaborators
Showing cs.LGShow all

6 papers · 1 filter

cs.LG2022

Stochastic and Private Nonconvex Outlier-Robust PCA

Tyler Maunu, Chenyu Yu, Gilad Lerman

We develop theoretically guaranteed stochastic methods for outlier-robust PCA. Outlier-robust PCA seeks an underlying low-dimensional linear subspace from a dataset that is corrupt…

cs.LG2021★ 5 cited

Score-based Generative Neural Networks for Large-Scale Optimal Transport

Mara Daniels, Tyler Maunu, Paul Hand

We consider the fundamental problem of sampling the optimal transport coupling between given source and target distributions. In certain cases, the optimal transport plan takes the…

cs.LG2019★ 9 cited

Robust Subspace Recovery with Adversarial Outliers

Tyler Maunu, Gilad Lerman

We study the problem of robust subspace recovery (RSR) in the presence of adversarial outliers. That is, we seek a subspace that contains a large portion of a dataset when some fra…

cs.LG2018★ 120 cited

An Overview of Robust Subspace Recovery

Gilad Lerman, Tyler Maunu

This paper will serve as an introduction to the body of work on robust subspace recovery. Robust subspace recovery involves finding an underlying low-dimensional subspace in a data…

cs.LG2017★ 33 cited

A Well-Tempered Landscape for Non-convex Robust Subspace Recovery

Tyler Maunu, Teng Zhang, Gilad Lerman

We present a mathematical analysis of a non-convex energy landscape for robust subspace recovery. We prove that an underlying subspace is the only stationary point and local minimi…

cs.LG2014★ 51 cited

Fast, Robust and Non-convex Subspace Recovery

Gilad Lerman, Tyler Maunu

This work presents a fast and non-convex algorithm for robust subspace recovery. The data sets considered include inliers drawn around a low-dimensional subspace of a higher dimens…