{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T17:19:15Z","timestamp":1730222355873,"version":"3.28.0"},"reference-count":43,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1109\/focs46700.2020.00022","type":"proceedings-article","created":{"date-parts":[[2021,3,17]],"date-time":"2021-03-17T15:21:26Z","timestamp":1615994486000},"page":"141-148","source":"Crossref","is-referenced-by-count":3,"title":["List Decodable Mean Estimation in Nearly Linear Time"],"prefix":"10.1109","author":[{"given":"Yeshwanth","family":"Cherapanamjeri","sequence":"first","affiliation":[]},{"given":"Sidhanth","family":"Mohanty","sequence":"additional","affiliation":[]},{"given":"Morris","family":"Yau","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref39","DOI":"10.1137\/0613006"},{"year":"2005","author":"dattorro","journal-title":"Convex Optimization and Euclidean Distance Geometry","key":"ref38"},{"year":"2020","author":"bakshi","journal-title":"List-decodable subspace recovery via sum-of-squares","key":"ref33"},{"year":"2020","author":"raghavendra","journal-title":"List decodable subspace recovery","key":"ref32"},{"year":"0","author":"karmalkar","journal-title":"NeurIPS","article-title":"List-decodable linear regression","key":"ref31"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1137\/1.9781611975994.10"},{"doi-asserted-by":"publisher","key":"ref37","DOI":"10.1137\/1.9781611975994.45"},{"doi-asserted-by":"publisher","key":"ref36","DOI":"10.1006\/jcss.2001.1773"},{"doi-asserted-by":"publisher","key":"ref35","DOI":"10.1006\/jagm.1995.1034"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1145\/2312005.2312026"},{"key":"ref10","first-page":"1824","article-title":"Using optimization to obtain a width-independent, parallel, simpler, and faster positive SDP solver","author":"zhu","year":"2016","journal-title":"Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms SODA 2016"},{"doi-asserted-by":"publisher","key":"ref40","DOI":"10.1145\/2837020"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1145\/3357713.3384338"},{"year":"1975","author":"tukey","journal-title":"Mathematics and the picturing of data","key":"ref12"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1214\/aoms\/1177693054"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/FOCS.2016.85"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/FOCS.2016.76"},{"year":"2018","author":"klivans","journal-title":"Efficient algorithms for outlier-robust regression","key":"ref16"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1137\/1.9781611975482.170"},{"key":"ref18","first-page":"169","article-title":"Computationally efficient robust sparse estimation in high dimensions","volume":"65","author":"balakrishnan","year":"2017","journal-title":"Proceedings of the 2017 Conference on Learning Theory PMLR"},{"key":"ref19","first-page":"10 689","article-title":"Outlier-robust high-dimensional sparse estimation via iterative filtering","author":"diakonikolas","year":"2019","journal-title":"Advances in Neural IInformation Processing Systems"},{"year":"2017","author":"kothari","journal-title":"Better agnostic clustering via relaxed tensor norms","key":"ref28"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1214\/aoms\/1177703732"},{"year":"2019","author":"diakonikolas","journal-title":"Recent advances in algorithmic high-dimensional robust statistics","key":"ref27"},{"year":"1960","author":"tukey","journal-title":"A Survey of Sampling From Contaminated Distribution","key":"ref3"},{"year":"1986","author":"hampel","journal-title":"The Approach Based on Influence Functions","article-title":"Robust statistics","key":"ref6"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1145\/3188745.3188748"},{"year":"2011","author":"huber","journal-title":"Robust Statistics","first-page":"1248","key":"ref5"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1145\/3188745.3188758"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1145\/1374376.1374474","article-title":"A discriminative framework for clustering via similarity functions","author":"balcan","year":"2008","journal-title":"Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing"},{"year":"2020","author":"cherapanamjeri","journal-title":"List decodable mean estimation in nearly linear time","key":"ref2"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.4086\/toc.2012.v008a006"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1145\/3055399.3055491"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1137\/1.9781611975482.171"},{"key":"ref22","first-page":"727","article-title":"Faster algorithms for high-dimensional robust covariance estimation","volume":"99","author":"cheng","year":"2019","journal-title":"Proceedings of the Thirty-Second Conference on Learning Theory"},{"key":"ref21","first-page":"6067","article-title":"Quantum entropy scoring for fast robust mean estimation and improved outlier detection","author":"dong","year":"2019","journal-title":"Advances in Neural IInformation Processing Systems"},{"key":"ref42","first-page":"974","article-title":"Even faster SVD decomposition yet without agonizing pain","author":"zhu","year":"2016","journal-title":"Advances in Neural Information Processing Systems 29 Annual Conference on Neural Information Processing Systems 2016"},{"key":"ref24","first-page":"1649","article-title":"How hard is robust mean estimation?","volume":"99","author":"hopkins","year":"2019","journal-title":"Proceedings of the Thirty-Second Conference on Learning Theory"},{"key":"ref41","article-title":"Introduction to online convex optimization","volume":"abs 1909 5207","author":"hazan","year":"2019","journal-title":"CoRR"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1109\/FOCS.2017.16"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1145\/3188745.3188970"},{"key":"ref43","first-page":"1396","article-title":"Randomized block krylov methods for stronger and faster approximate singular value decomposition","author":"musco","year":"2015","journal-title":"Advances in Neural Information Processing Systems 28 Annual Conference on Neural Information Processing Systems 2015"},{"key":"ref25","first-page":"10304","article-title":"Robust learning of fixed-structure bayesian networks","author":"cheng","year":"2018","journal-title":"Proceedings of the 32Nd International Conference on Neural Information Processing Systems"}],"event":{"name":"2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)","start":{"date-parts":[[2020,11,16]]},"location":"Durham, NC, USA","end":{"date-parts":[[2020,11,19]]}},"container-title":["2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9317865\/9317869\/09317960.pdf?arnumber=9317960","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T21:48:51Z","timestamp":1656452931000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9317960\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11]]},"references-count":43,"URL":"https:\/\/doi.org\/10.1109\/focs46700.2020.00022","relation":{},"subject":[],"published":{"date-parts":[[2020,11]]}}}
