scientific article; zbMATH DE number 7378616

DOI10.4230/LIPICS.APPROX-RANDOM.2018.4MaRDI QIDQ5009495

Srivatsan Kumar, Aditya Bhaskara

Publication date: 4 August 2021

Full work available at URL: https://arxiv.org/abs/1804.10696

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

PCAlow rank approximationrobustness to outliers

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (1)

Sampling-based dimension reduction for subspace approximation with outliers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quick approximation to matrices and applications
• Heuristics for semirandom graph problems
• Detecting high log-densities
• Graph expansion and the unique games conjecture
• Outlier-Robust PCA: The High-Dimensional Case
• Robust principal component analysis?
• Adaptive Sampling and Fast Low-Rank Matrix Approximation
• Robust Estimators in High-Dimensions Without the Computational Intractability
• Learning from untrusted data
• Constant approximation for k-median and k-means with outliers via iterative rounding
• Mixture models, robustness, and sum of squares proofs
• List-decodable robust mean estimation and learning mixtures of spherical gaussians
• Constant factor approximation for balanced cut in the PIE model
• Robust PCA via Outlier Pursuit
• Optimal Column-Based Low-Rank Matrix Reconstruction
• Robust Statistics
• Robust Statistics

This page was built for publication: