{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T14:50:58Z","timestamp":1784299858815,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":92,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T00:00:00Z","timestamp":1529452800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,6,20]]},"DOI":"10.1145\/3188745.3188970","type":"proceedings-article","created":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T20:15:46Z","timestamp":1529525746000},"page":"1035-1046","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":56,"title":["Robust moment estimation and improved clustering via sum of squares"],"prefix":"10.1145","author":[{"given":"Pravesh K.","family":"Kothari","sequence":"first","affiliation":[{"name":"Princeton University, USA \/ Institute for Advanced Study at Princeton, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jacob","family":"Steinhardt","sequence":"additional","affiliation":[{"name":"Stanford University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Steurer","sequence":"additional","affiliation":[{"name":"ETH Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,6,20]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11503415_31"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-014-0579-3"},{"key":"e_1_3_2_2_3_1","unstructured":"Anima Anandkumar Dean P. Foster Daniel J. Hsu Sham Kakade and Yi-Kai Liu. 2012. A Spectral Algorithm for Latent Dirichlet Allocation. In NIPS. 926\u2013934.   Anima Anandkumar Dean P. Foster Daniel J. Hsu Sham Kakade and Yi-Kai Liu. 2012. A Spectral Algorithm for Latent Dirichlet Allocation. In NIPS. 926\u2013934."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"A. Anandkumar R. Ge D. Hsu S. M. Kakade and M. Telgarsky. 2013. Tensor decompositions for learning latent variable models. arXiv (2013).  A. Anandkumar R. Ge D. Hsu S. M. Kakade and M. Telgarsky. 2013. Tensor decompositions for learning latent variable models. arXiv (2013).","DOI":"10.21236\/ADA604494"},{"key":"e_1_3_2_2_5_1","unstructured":"Animashree Anandkumar Rong Ge Daniel J. Hsu Sham M. Kakade and Matus Telgarsky. 2014.  Animashree Anandkumar Rong Ge Daniel J. Hsu Sham M. Kakade and Matus Telgarsky. 2014."},{"key":"e_1_3_2_2_6_1","volume-title":"Journal of Machine Learning Research 15, 1","author":"Tensor","year":"2014","unstructured":"Tensor decompositions for learning latent variable models. Journal of Machine Learning Research 15, 1 ( 2014 ), 2773\u20132832. Tensor decompositions for learning latent variable models. Journal of Machine Learning Research 15, 1 (2014), 2773\u20132832."},{"key":"e_1_3_2_2_7_1","volume-title":"Conference on Learning Theory (COLT).","author":"Anderson J.","unstructured":"J. Anderson , M. Belkin , N. Goyal , L. Rademacher , and J. R. Voss . 2014. The more, the merrier: the blessing of dimensionality for learning large Gaussian mixtures . In Conference on Learning Theory (COLT). J. Anderson, M. Belkin, N. Goyal, L. Rademacher, and J. R. Voss. 2014. The more, the merrier: the blessing of dimensionality for learning large Gaussian mixtures. In Conference on Learning Theory (COLT)."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"P. Awasthi and O. Sheffet. 2012. Improved spectral-norm bounds for clustering. Approximation Randomization and Combinatorial Optimization (2012) 37\u201349.  P. Awasthi and O. Sheffet. 2012. Improved spectral-norm bounds for clustering. Approximation Randomization and Combinatorial Optimization (2012) 37\u201349.","DOI":"10.1007\/978-3-642-32512-0_4"},{"key":"e_1_3_2_2_9_1","unstructured":"M. Balcan A. Blum and S. Vempala. 2008.  M. Balcan A. Blum and S. Vempala. 2008."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374474"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214006"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746605"},{"key":"e_1_3_2_2_13_1","unstructured":"Boaz Barak and Ankur Moitra. 2016.  Boaz Barak and Ankur Moitra. 2016."},{"key":"e_1_3_2_2_14_1","volume-title":"COLT (JMLR Workshop and Conference Proceedings)","volume":"49","author":"Tensor Noisy","unstructured":"Noisy Tensor Completion via the Sumof-Squares Hierarchy . In COLT (JMLR Workshop and Conference Proceedings) , Vol. 49 . JMLR.org, 417\u2013445. Noisy Tensor Completion via the Sumof-Squares Hierarchy. In COLT (JMLR Workshop and Conference Proceedings), Vol. 49. JMLR.org, 417\u2013445."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.16"},{"key":"e_1_3_2_2_16_1","unstructured":"T. Bernholt. 2006.  T. Bernholt. 2006."},{"key":"e_1_3_2_2_17_1","unstructured":"Robust estimators are hard to compute. Technical Report. Universit\u00e4t Dortmund.  Robust estimators are hard to compute. Technical Report. Universit\u00e4t Dortmund."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591881"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591881"},{"key":"e_1_3_2_2_20_1","volume-title":"Conference on Learning Theory (COLT).","author":"Bhaskara A.","unstructured":"A. Bhaskara , M. Charikar , and A. Vijayaraghavan . 2014. Uniqueness of tensor decompositions with applications to polynomial identifiability . In Conference on Learning Theory (COLT). A. Bhaskara, M. Charikar, and A. Vijayaraghavan. 2014. Uniqueness of tensor decompositions with applications to polynomial identifiability. In Conference on Learning Theory (COLT)."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"e_1_3_2_2_22_1","unstructured":"Emmanuel J. Cand\u00e8s Mark Rudelson Terence Tao and Roman Vershynin. 2005.  Emmanuel J. Cand\u00e8s Mark Rudelson Terence Tao and Roman Vershynin. 2005."},{"key":"e_1_3_2_2_23_1","unstructured":"Error Correction via Linear Programming. In FOCS. IEEE Computer Society 295\u2013308.  Error Correction via Linear Programming. In FOCS. IEEE Computer Society 295\u2013308."},{"key":"e_1_3_2_2_24_1","unstructured":"Moses Charikar Jacob Steinhardt and Gregory Valiant. 2017.  Moses Charikar Jacob Steinhardt and Gregory Valiant. 2017."},{"key":"e_1_3_2_2_25_1","unstructured":"Learning from untrusted data. In STOC. ACM 47\u201360.  Learning from untrusted data. In STOC. ACM 47\u201360."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055491"},{"key":"e_1_3_2_2_27_1","volume-title":"COLT (Proceedings of Machine Learning Research)","volume":"65","author":"Cherapanamjeri Yeshwanth","year":"2017","unstructured":"Yeshwanth Cherapanamjeri , Prateek Jain , and Praneeth Netrapalli . 2017 . Thresholding Based Outlier Robust PCA . In COLT (Proceedings of Machine Learning Research) , Vol. 65 . PMLR, 593\u2013628. Yeshwanth Cherapanamjeri, Prateek Jain, and Praneeth Netrapalli. 2017. Thresholding Based Outlier Robust PCA. In COLT (Proceedings of Machine Learning Research), Vol. 65. PMLR, 593\u2013628."},{"key":"e_1_3_2_2_28_1","unstructured":"Lieven De Lathauwer Jos\u00e9phine Castaing and Jean-Fran\u00e7ois Cardoso. 2007.  Lieven De Lathauwer Jos\u00e9phine Castaing and Jean-Fran\u00e7ois Cardoso. 2007."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2007.893943"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"crossref","unstructured":"1109\/TSP.2007.893943  1109\/TSP.2007.893943","DOI":"10.1055\/s-2007-968957"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"crossref","unstructured":"I. Diakonikolas G. Kamath D. Kane J. Li A. Moitra and A. Stewart. 2016. Robust Estimators in High Dimensions without the Computational Intractability. In Foundations of Computer Science (FOCS).  I. Diakonikolas G. Kamath D. Kane J. Li A. Moitra and A. Stewart. 2016. Robust Estimators in High Dimensions without the Computational Intractability. In Foundations of Computer Science (FOCS).","DOI":"10.1109\/FOCS.2016.85"},{"key":"e_1_3_2_2_32_1","unstructured":"I. Diakonikolas G. Kamath D. Kane J. Li A. Moitra and A. Stewart. 2017. Being Robust (in High Dimensions) Can Be Practical. arXiv (2017).  I. Diakonikolas G. Kamath D. Kane J. Li A. Moitra and A. Stewart. 2017. Being Robust (in High Dimensions) Can Be Practical. arXiv (2017)."},{"key":"e_1_3_2_2_33_1","volume-title":"Robust Estimators in High Dimensions without the Computational Intractability","author":"Diakonikolas Ilias","unstructured":"Ilias Diakonikolas , Gautam Kamath , Daniel M. Kane , Jerry Li , Ankur Moitra , and Alistair Stewart . 2016. Robust Estimators in High Dimensions without the Computational Intractability . In FOCS. IEEE Computer Society , 655\u2013664. Ilias Diakonikolas, Gautam Kamath, Daniel M. Kane, Jerry Li, Ankur Moitra, and Alistair Stewart. 2016. Robust Estimators in High Dimensions without the Computational Intractability. In FOCS. IEEE Computer Society, 655\u2013664."},{"key":"e_1_3_2_2_34_1","volume-title":"CoRR abs\/1703.00893","author":"Diakonikolas Ilias","year":"2017","unstructured":"Ilias Diakonikolas , Gautam Kamath , Daniel M. Kane , Jerry Li , Ankur Moitra , and Alistair Stewart . 2017. Being Robust (in High Dimensions) Can Be Practical . CoRR abs\/1703.00893 ( 2017 ). Ilias Diakonikolas, Gautam Kamath, Daniel M. Kane, Jerry Li, Ankur Moitra, and Alistair Stewart. 2017. Being Robust (in High Dimensions) Can Be Practical. CoRR abs\/1703.00893 (2017)."},{"key":"e_1_3_2_2_35_1","unstructured":"Ilias Diakonikolas Gautam Kamath Daniel M. Kane Jerry Li Ankur Moitra and Alistair Stewart. 2017.  Ilias Diakonikolas Gautam Kamath Daniel M. Kane Jerry Li Ankur Moitra and Alistair Stewart. 2017."},{"key":"e_1_3_2_2_36_1","volume-title":"Efficiently. CoRR abs\/1704.03866","author":"Gaussian Robustly Learning","year":"2017","unstructured":"Robustly Learning a Gaussian : Getting Optimal Error , Efficiently. CoRR abs\/1704.03866 ( 2017 ). Robustly Learning a Gaussian: Getting Optimal Error, Efficiently. CoRR abs\/1704.03866 (2017)."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746616"},{"key":"e_1_3_2_2_38_1","volume-title":"APPROX-RANDOM (LIPIcs)","volume":"40","author":"Ge Rong","year":"2015","unstructured":"Rong Ge and Tengyu Ma . 2015 . Decomposing Overcomplete 3rd Order Tensors using Sum-of-Squares Algorithms . In APPROX-RANDOM (LIPIcs) , Vol. 40 . Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 829\u2013849. Rong Ge and Tengyu Ma. 2015. Decomposing Overcomplete 3rd Order Tensors using Sum-of-Squares Algorithms. In APPROX-RANDOM (LIPIcs), Vol. 40. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 829\u2013849."},{"key":"e_1_3_2_2_39_1","unstructured":"Navin Goyal Santosh Vempala and Ying Xiao. 2013.  Navin Goyal Santosh Vempala and Ying Xiao. 2013."},{"key":"e_1_3_2_2_40_1","volume-title":"CoRR abs\/1306.5825","author":"Fourier","year":"2013","unstructured":"Fourier PCA. CoRR abs\/1306.5825 ( 2013 ). Fourier PCA. CoRR abs\/1306.5825 (2013)."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591875"},{"key":"e_1_3_2_2_42_1","unstructured":"David Gross. 2011.  David Gross. 2011."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2104999"},{"key":"e_1_3_2_2_44_1","unstructured":"F. R. Hampel E. M. Ronchetti P. J. Rousseeuw and W. A. Stahel. 2011.  F. R. Hampel E. M. Ronchetti P. J. Rousseeuw and W. A. Stahel. 2011."},{"key":"e_1_3_2_2_45_1","volume-title":"The Approach Based on Influence Functions","author":"Statistics Robust","unstructured":"Robust Statistics : The Approach Based on Influence Functions . Wiley . Robust Statistics: The Approach Based on Influence Functions. Wiley."},{"key":"e_1_3_2_2_46_1","volume-title":"Hopkins and Jerry Li","author":"Sam","year":"2017","unstructured":"Sam B. Hopkins and Jerry Li . 2017 . Sam B. Hopkins and Jerry Li. 2017."},{"key":"e_1_3_2_2_47_1","unstructured":"Mixture Models Robustness and Sum of Squares Proofs. (2017).  Mixture Models Robustness and Sum of Squares Proofs. (2017)."},{"key":"e_1_3_2_2_48_1","unstructured":"Samuel B. Hopkins Jonathan Shi and David Steurer. 2015.  Samuel B. Hopkins Jonathan Shi and David Steurer. 2015."},{"key":"e_1_3_2_2_49_1","volume-title":"COLT (JMLR Workshop and Conference Proceedings)","volume":"40","author":"Tensor","unstructured":"Tensor principal component analysis via sum-of-square proofs . In COLT (JMLR Workshop and Conference Proceedings) , Vol. 40 . JMLR.org, 956\u20131006. Tensor principal component analysis via sum-of-square proofs. In COLT (JMLR Workshop and Conference Proceedings), Vol. 40. JMLR.org, 956\u20131006."},{"key":"e_1_3_2_2_50_1","unstructured":"STOC\u201918 June 25\u201329 2018 Los Angeles CA USA Pravesh K. Kothari Jacob Steinhardt and David Steurer  STOC\u201918 June 25\u201329 2018 Los Angeles CA USA Pravesh K. Kothari Jacob Steinhardt and David Steurer"},{"key":"e_1_3_2_2_51_1","unstructured":"D. Hsu and S. M. Kakade. 2013.  D. Hsu and S. M. Kakade. 2013."},{"key":"e_1_3_2_2_52_1","unstructured":"Learning Mixtures of Spherical Gaussians: Moment Methods and Spectral Decompositions. In Innovations in Theoretical Computer Science (ITCS).  Learning Mixtures of Spherical Gaussians: Moment Methods and Spectral Decompositions. In Innovations in Theoretical Computer Science (ITCS)."},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/2422436.2422439"},{"key":"e_1_3_2_2_54_1","unstructured":"D. Hsu S. M. Kakade and T. Zhang. 2009.  D. Hsu S. M. Kakade and T. Zhang. 2009."},{"key":"e_1_3_2_2_55_1","volume-title":"Conference on Learning Theory (COLT).","author":"A","unstructured":"A spectral algorithm for learning hidden Markov models . In Conference on Learning Theory (COLT). A spectral algorithm for learning hidden Markov models. In Conference on Learning Theory (COLT)."},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/2422436.2422439"},{"key":"e_1_3_2_2_57_1","volume-title":"International Encyclopedia of Statistical Science","author":"Huber Peter J","unstructured":"Peter J Huber . 2011. Robust statistics . In International Encyclopedia of Statistical Science . Springer , 1248\u20131251. Peter J Huber. 2011. Robust statistics. In International Encyclopedia of Statistical Science. Springer, 1248\u20131251."},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806765"},{"key":"e_1_3_2_2_59_1","unstructured":"Adam Tauman Kalai Ankur Moitra and Gregory Valiant. 2010.  Adam Tauman Kalai Ankur Moitra and Gregory Valiant. 2010."},{"key":"e_1_3_2_2_60_1","unstructured":"Efficiently learning mixtures of two Gaussians. In STOC. ACM 553\u2013562.  Efficiently learning mixtures of two Gaussians. In STOC. ACM 553\u2013562."},{"key":"e_1_3_2_2_61_1","unstructured":"P. Kothari and D. Steurer. 2017. Outlier-robust moment-estimation via sum-ofsquares. arXiv (2017).  P. Kothari and D. Steurer. 2017. Outlier-robust moment-estimation via sum-ofsquares. arXiv (2017)."},{"key":"e_1_3_2_2_62_1","volume-title":"Kothari and Jacob Steinhardt","author":"Pravesh","year":"2017","unstructured":"Pravesh K. Kothari and Jacob Steinhardt . 2017 . Better Agnostic Clustering via Relaxed Tensor Norms . (2017). Pravesh K. Kothari and Jacob Steinhardt. 2017. Better Agnostic Clustering via Relaxed Tensor Norms. (2017)."},{"key":"e_1_3_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.35"},{"key":"e_1_3_2_2_64_1","unstructured":"K. A. Lai A. B. Rao and S. Vempala. 2016.  K. A. Lai A. B. Rao and S. Vempala. 2016."},{"key":"e_1_3_2_2_65_1","unstructured":"Agnostic Estimation of Mean and Covariance. In Foundations of Computer Science (FOCS).  Agnostic Estimation of Mean and Covariance. In Foundations of Computer Science (FOCS)."},{"key":"e_1_3_2_2_66_1","volume-title":"Agnostic Estimation of Mean and Covariance","author":"Lai Kevin A.","unstructured":"Kevin A. Lai , Anup B. Rao , and Santosh Vempala . 2016. Agnostic Estimation of Mean and Covariance . In FOCS. IEEE Computer Society , 665\u2013674. Kevin A. Lai, Anup B. Rao, and Santosh Vempala. 2016. Agnostic Estimation of Mean and Covariance. In FOCS. IEEE Computer Society, 665\u2013674."},{"key":"e_1_3_2_2_67_1","doi-asserted-by":"publisher","DOI":"10.1214\/009117906000000421"},{"key":"e_1_3_2_2_68_1","unstructured":"Tengyu Ma Jonathan Shi and David Steurer. 2016.  Tengyu Ma Jonathan Shi and David Steurer. 2016."},{"key":"e_1_3_2_2_69_1","unstructured":"Polynomial-Time Tensor Decompositions with Sum-of-Squares. In FOCS. IEEE Computer Society 438\u2013446.  Polynomial-Time Tensor Decompositions with Sum-of-Squares. In FOCS. IEEE Computer Society 438\u2013446."},{"key":"e_1_3_2_2_70_1","unstructured":"L. Mackey M. I. Jordan R. Y. Chen B. Farrell and J. A. Tropp. 2014.  L. Mackey M. I. Jordan R. Y. Chen B. Farrell and J. A. Tropp. 2014."},{"key":"e_1_3_2_2_71_1","volume-title":"The Annals of Probability 42, 3","author":"Matrix","year":"2014","unstructured":"Matrix concentration inequalities via the method of exchangeable pairs. The Annals of Probability 42, 3 ( 2014 ), 906\u2013945. Matrix concentration inequalities via the method of exchangeable pairs. The Annals of Probability 42, 3 (2014), 906\u2013945."},{"key":"e_1_3_2_2_72_1","unstructured":"M. Mahajan P. Nimbhorkar and K. Varadarajan. 2009.  M. Mahajan P. Nimbhorkar and K. Varadarajan. 2009."},{"key":"e_1_3_2_2_73_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00202-1_24"},{"key":"e_1_3_2_2_74_1","unstructured":"R. A. Maronna D. R. Martin and V. J. Yohai. 2006.  R. A. Maronna D. R. Martin and V. J. Yohai. 2006."},{"key":"e_1_3_2_2_75_1","volume-title":"Theory and Methods","author":"Statistics Robust","unstructured":"Robust Statistics : Theory and Methods . Wiley . Robust Statistics: Theory and Methods. Wiley."},{"key":"e_1_3_2_2_76_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.15"},{"key":"e_1_3_2_2_77_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.15"},{"key":"e_1_3_2_2_78_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060645"},{"key":"e_1_3_2_2_79_1","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.1894.0003"},{"key":"e_1_3_2_2_80_1","unstructured":"Aaron Potechin and David Steurer. 2017.  Aaron Potechin and David Steurer. 2017."},{"key":"e_1_3_2_2_81_1","volume-title":"COLT (Proceedings of Machine Learning Research)","volume":"65","author":"Exact","unstructured":"Exact tensor completion with sumof-squares . In COLT (Proceedings of Machine Learning Research) , Vol. 65 . PMLR, 1619\u20131673. Exact tensor completion with sumof-squares. In COLT (Proceedings of Machine Learning Research), Vol. 65. PMLR, 1619\u20131673."},{"key":"e_1_3_2_2_82_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2185803"},{"key":"e_1_3_2_2_83_1","doi-asserted-by":"crossref","unstructured":"O. Regev and A. Vijayaraghavan. 2017. On Learning Mixtures of Well-Separated Gaussians. In Foundations of Computer Science (FOCS).  O. Regev and A. Vijayaraghavan. 2017. On Learning Mixtures of Well-Separated Gaussians. In Foundations of Computer Science (FOCS).","DOI":"10.1109\/FOCS.2017.17"},{"key":"e_1_3_2_2_84_1","unstructured":"Jacob Steinhardt Moses Charikar and Gregory Valiant. 2017.  Jacob Steinhardt Moses Charikar and Gregory Valiant. 2017."},{"key":"e_1_3_2_2_85_1","volume-title":"A Criterion for Learning in the Presence of Arbitrary Outliers. CoRR abs\/1703.04940","author":"Resilience","year":"2017","unstructured":"Resilience : A Criterion for Learning in the Presence of Arbitrary Outliers. CoRR abs\/1703.04940 ( 2017 ). Resilience: A Criterion for Learning in the Presence of Arbitrary Outliers. CoRR abs\/1703.04940 (2017)."},{"key":"e_1_3_2_2_86_1","unstructured":"J. Steinhardt M. Charikar and G. Valiant. 2018.  J. Steinhardt M. Charikar and G. Valiant. 2018."},{"key":"e_1_3_2_2_87_1","unstructured":"Resilience: A Criterion for Learning in the Presence of Arbitrary Outliers. In Innovations in Theoretical Computer Science (ITCS).  Resilience: A Criterion for Learning in the Presence of Arbitrary Outliers. In Innovations in Theoretical Computer Science (ITCS)."},{"key":"e_1_3_2_2_88_1","unstructured":"John W. Tukey. 1975. Mathematics and the picturing of data. (1975) 523\u2013531.  John W. Tukey. 1975. Mathematics and the picturing of data. (1975) 523\u2013531."},{"key":"e_1_3_2_2_89_1","unstructured":"S. Vempala and G. Wang. 2002. A spectral algorithm for learning mixture models. In Foundations of Computer Science (FOCS).   S. Vempala and G. Wang. 2002. A spectral algorithm for learning mixture models. In Foundations of Computer Science (FOCS)."},{"key":"e_1_3_2_2_90_1","unstructured":"Santosh Vempala and Ying Xiao. 2015.  Santosh Vempala and Ying Xiao. 2015."},{"key":"e_1_3_2_2_91_1","volume-title":"COLT (JMLR Workshop and Conference Proceedings)","volume":"40","author":"Min Max","unstructured":"Max vs Min : Tensor Decomposition and ICA with nearly Linear Sample Complexity . In COLT (JMLR Workshop and Conference Proceedings) , Vol. 40 . JMLR.org, 1710\u20131723. Max vs Min: Tensor Decomposition and ICA with nearly Linear Sample Complexity. In COLT (JMLR Workshop and Conference Proceedings), Vol. 40. JMLR.org, 1710\u20131723."},{"key":"e_1_3_2_2_92_1","unstructured":"Abstract 1 Introduction 2 Results 2.1 Certifiably Subgaussian Distributions 2.2 Outlier-Robust Estimation 2.3 Distribution-Agnostic Robust Clustering References  Abstract 1 Introduction 2 Results 2.1 Certifiably Subgaussian Distributions 2.2 Outlier-Robust Estimation 2.3 Distribution-Agnostic Robust Clustering References"}],"event":{"name":"STOC '18: Symposium on Theory of Computing","location":"Los Angeles CA USA","acronym":"STOC '18","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3188745.3188970","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3188745.3188970","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:07Z","timestamp":1750208887000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3188745.3188970"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,20]]},"references-count":92,"alternative-id":["10.1145\/3188745.3188970","10.1145\/3188745"],"URL":"https:\/\/doi.org\/10.1145\/3188745.3188970","relation":{},"subject":[],"published":{"date-parts":[[2018,6,20]]},"assertion":[{"value":"2018-06-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}