Robust moment estimation and improved clustering via sum of squares

DOI10.1145/3188745.3188970zbMath1434.62125OpenAlexW2808754399MaRDI QIDQ5230360

Pravesh K. Kothari, David Steurer, Jacob Steinhardt

Publication date: 22 August 2019

Published in: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3188745.3188970

zbMATH Keywords

momentsclusteringsum-of-squaresrobust learning

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (10)

Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials ⋮ Sum of Squares Bounds for the Empty Integral Hull Problem ⋮ Mean estimation with sub-Gaussian rates in polynomial time ⋮ Breaking symmetries to rescue sum of squares in the case of makespan scheduling ⋮ Unnamed Item ⋮ Robust Estimators in High-Dimensions Without the Computational Intractability ⋮ Unnamed Item ⋮ Finite sample properties of parametric MMD estimation: robustness to misspecification and dependence ⋮ Mean estimation and regression under heavy-tailed distributions: A survey ⋮ Graph Powering and Spectral Robustness

This page was built for publication: Robust moment estimation and improved clustering via sum of squares