{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:25:02Z","timestamp":1750220702860,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":84,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T00:00:00Z","timestamp":1592784000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100006063","name":"Paul and Daisy Soros Fellowships for New Americans","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006063","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006112","name":"Microsoft Research","doi-asserted-by":"publisher","award":["Trustworthy AI Grant"],"award-info":[{"award-number":["Trustworthy AI Grant"]}],"id":[{"id":"10.13039\/100006112","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000008","name":"David and Lucile Packard Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000008","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014718","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CAREER Award CCF-1453261, Large CCF-1565235"],"award-info":[{"award-number":["CAREER Award CCF-1453261, Large CCF-1565235"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100015089","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["Young Investigator Award"],"award-info":[{"award-number":["Young Investigator Award"]}],"id":[{"id":"10.13039\/100015089","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Alfred P. Sloan Foundation"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,22]]},"DOI":"10.1145\/3357713.3384337","type":"proceedings-article","created":{"date-parts":[[2020,6,7]],"date-time":"2020-06-07T01:45:25Z","timestamp":1591494325000},"page":"960-973","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Efficiently learning structured distributions from untrusted batches"],"prefix":"10.1145","author":[{"given":"Sitan","family":"Chen","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jerry","family":"Li","sequence":"additional","affiliation":[{"name":"Microsoft Research, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ankur","family":"Moitra","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"J. Acharya I. Diakonikolas C. Hegde J. Li and L. Schmidt. 2015. Fast and Near-Optimal Algorithms for Approximating Distributions by Histograms. In PODS.  J. Acharya I. Diakonikolas C. Hegde J. Li and L. Schmidt. 2015. Fast and Near-Optimal Algorithms for Approximating Distributions by Histograms. In PODS.","DOI":"10.1145\/2745754.2745772"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.83"},{"volume-title":"Proceedings of the Eighteenth Annual Conference on Learning Theory (COLT). 458\u2013469","author":"Achlioptas D.","key":"e_1_3_2_1_3_1","unstructured":"D. Achlioptas and F. McSherry . 2005. On Spectral Learning of Mixtures of Distributions . In Proceedings of the Eighteenth Annual Conference on Learning Theory (COLT). 458\u2013469 . D. Achlioptas and F. McSherry. 2005. On Spectral Learning of Mixtures of Distributions. In Proceedings of the Eighteenth Annual Conference on Learning Theory (COLT). 458\u2013469."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1080\/00401706.1960.10489888"},{"volume-title":"Proceedings of the 33rd Symposium on Theory of Computing. 247\u2013257","author":"Arora S.","key":"e_1_3_2_1_5_1","unstructured":"S. Arora and R. Kannan . 2001. Learning mixtures of arbitrary Gaussians . In Proceedings of the 33rd Symposium on Theory of Computing. 247\u2013257 . S. Arora and R. Kannan. 2001. Learning mixtures of arbitrary Gaussians. In Proceedings of the 33rd Symposium on Theory of Computing. 247\u2013257."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1214\/08-AOS609"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1214\/009053607000000262"},{"key":"e_1_3_2_1_8_1","volume-title":"Conference on Learning Theory. 169\u2013212","author":"Balakrishnan Sivaraman","year":"2017","unstructured":"Sivaraman Balakrishnan , Simon S Du , Jerry Li , and Aarti Singh . 2017 . Computationally efficient robust sparse estimation in high dimensions . In Conference on Learning Theory. 169\u2013212 . Sivaraman Balakrishnan, Simon S Du, Jerry Li, and Aarti Singh. 2017. Computationally efficient robust sparse estimation in high dimensions. In Conference on Learning Theory. 169\u2013212."},{"volume-title":"Statistical inference under order restrictions: The theory and application of isotonic regression","author":"Barlow Richard E","key":"e_1_3_2_1_9_1","unstructured":"Richard E Barlow , David J Bartholomew , James M Bremner , and H Daniel Brunk . 1972. Statistical inference under order restrictions: The theory and application of isotonic regression . Wiley New York . Richard E Barlow, David J Bartholomew, James M Bremner, and H Daniel Brunk. 1972. Statistical inference under order restrictions: The theory and application of isotonic regression. Wiley New York."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176350488"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177728420"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706621"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/91.1.113"},{"key":"e_1_3_2_1_14_1","unstructured":"S. Chan I. Diakonikolas R. Servedio and X. Sun. 2014. Near-Optimal Density Estimation in Near-Linear Time Using Variable-Width Histograms. In NIPS. 1844\u20131852.  S. Chan I. Diakonikolas R. Servedio and X. Sun. 2014. Near-Optimal Density Estimation in Near-Linear Time Using Variable-Width Histograms. In NIPS. 1844\u20131852."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973105.100"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591848"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055491"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Sitan Chen Jerry Li and Ankur Moitra. 2020. Learning Structured Distributions From Untrusted Batches: Faster and Simpler. arXiv preprint arXiv:2002.10435.  Sitan Chen Jerry Li and Ankur Moitra. 2020. Learning Structured Distributions From Untrusted Batches: Faster and Simpler. arXiv preprint arXiv:2002.10435.","DOI":"10.1145\/3357713.3384337"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316375"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591867"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814639"},{"volume-title":"Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence. 143\u2013151","author":"Dasgupta S.","key":"e_1_3_2_1_22_1","unstructured":"S. Dasgupta and L. Schulman . 2000. A two-round variant of EM for Gaussian mixtures . In Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence. 143\u2013151 . S. Dasgupta and L. Schulman. 2000. A two-round variant of EM for Gaussian mixtures. In Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence. 143\u2013151."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897519"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"C. Daskalakis I. Diakonikolas R. O\u2019Donnell R.A. Servedio and L. Tan. 2013. Learning Sums of Independent Integer Random Variables. In FOCS. 217\u2013226.  C. Daskalakis I. Diakonikolas R. O\u2019Donnell R.A. Servedio and L. Tan. 2013. Learning Sums of Independent Integer Random Variables. In FOCS. 217\u2013226.","DOI":"10.1109\/FOCS.2013.31"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"C. Daskalakis I. Diakonikolas and R.A. Servedio. 2012. Learning k-modal distributions via testing. In SODA. 1371\u20131385.  C. Daskalakis I. Diakonikolas and R.A. Servedio. 2012. Learning k-modal distributions via testing. In SODA. 1371\u20131385.","DOI":"10.1137\/1.9781611973099.108"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"C. Daskalakis I. Diakonikolas and R.A. Servedio. 2012. Learning Poisson Binomial Distributions. In STOC. 709\u2013728.  C. Daskalakis I. Diakonikolas and R.A. Servedio. 2012. Learning Poisson Binomial Distributions. In STOC. 709\u2013728.","DOI":"10.1145\/2213977.2214042"},{"volume-title":"Combinatorial Methods in Density Estimation","author":"Devroye Luc","key":"e_1_3_2_1_27_1","unstructured":"Luc Devroye and Gabor Lugosi . 2001. Combinatorial Methods in Density Estimation . Springer Science & Business Media . Luc Devroye and Gabor Lugosi. 2001. Combinatorial Methods in Density Estimation. Springer Science & Business Media."},{"key":"e_1_3_2_1_28_1","volume-title":"Learning Structured Distributions.. Handbook of Big Data, 267","author":"Diakonikolas Ilias","year":"2016","unstructured":"Ilias Diakonikolas . 2016. Learning Structured Distributions.. Handbook of Big Data, 267 ( 2016 ). Ilias Diakonikolas. 2016. Learning Structured Distributions.. Handbook of Big Data, 267 (2016)."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1126680"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/3305381.3305485"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897552"},{"key":"e_1_3_2_1_32_1","volume-title":"Conference on Learning Theory. 831\u2013849","author":"Diakonikolas Ilias","year":"2016","unstructured":"Ilias Diakonikolas , Daniel M Kane , and Alistair Stewart . 2016 . Optimal learning via the fourier transform for sums of independent integer random variables . In Conference on Learning Theory. 831\u2013849 . Ilias Diakonikolas, Daniel M Kane, and Alistair Stewart. 2016. Optimal learning via the fourier transform for sums of independent integer random variables. In Conference on Learning Theory. 831\u2013849."},{"key":"e_1_3_2_1_33_1","volume-title":"Conference on Learning Theory. 850\u2013878","author":"Diakonikolas Ilias","year":"2016","unstructured":"Ilias Diakonikolas , Daniel M Kane , and Alistair Stewart . 2016 . Properly learning poisson binomial distributions in almost polynomial time . In Conference on Learning Theory. 850\u2013878 . Ilias Diakonikolas, Daniel M Kane, and Alistair Stewart. 2016. Properly learning poisson binomial distributions in almost polynomial time. In Conference on Learning Theory. 850\u2013878."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188758"},{"key":"e_1_3_2_1_35_1","first-page":"371","article-title":"Wavelet shrinkage: asymptopia","author":"Donoho D. L.","year":"1995","unstructured":"D. L. Donoho , I. M. Johnstone , G. Kerkyacharian , and D. Picard . 1995 . Wavelet shrinkage: asymptopia . Journal of the Royal Statistical Society, Ser. B , 371 \u2013 394 . D. L. Donoho, I. M. Johnstone, G. Kerkyacharian, and D. Picard. 1995. Wavelet shrinkage: asymptopia. Journal of the Royal Statistical Society, Ser. B, 371\u2013394.","journal-title":"Journal of the Royal Statistical Society, Ser. B"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1032894451"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.3150\/08-BEJ141"},{"key":"e_1_3_2_1_38_1","volume-title":"FOCS","author":"Feldman J.","year":"2005","unstructured":"J. Feldman , R. O\u2019Donnell , and R. Servedio . 2005. Learning mixtures of product distributions over discrete domains . In FOCS 2005 . 501\u2013510. J. Feldman, R. O\u2019Donnell, and R. Servedio. 2005. Learning mixtures of product distributions over discrete domains. In FOCS 2005. 501\u2013510."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.2307\/3315785"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11425-009-0102-y"},{"key":"e_1_3_2_1_41_1","first-page":"125","article-title":"On the theory of mortality measurement","volume":"39","author":"Grenander U.","year":"1956","unstructured":"U. Grenander . 1956 . On the theory of mortality measurement . Skand. Aktuarietidskr. , 39 (1956), 125 \u2013 153 . U. Grenander. 1956. On the theory of mortality measurement. Skand. Aktuarietidskr., 39 (1956), 125\u2013153.","journal-title":"Skand. Aktuarietidskr."},{"key":"e_1_3_2_1_42_1","volume-title":"Proc. of the Berkeley Conference in Honor of Jerzy Neyman and Jack Kiefer. 539\u2013555","author":"Groeneboom P.","year":"1985","unstructured":"P. Groeneboom . 1985 . Estimating a monotone density . In Proc. of the Berkeley Conference in Honor of Jerzy Neyman and Jack Kiefer. 539\u2013555 . P. Groeneboom. 1985. Estimating a monotone density. In Proc. of the Berkeley Conference in Honor of Jerzy Neyman and Jack Kiefer. 539\u2013555."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176343640"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1954.10483523"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188748"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1065719"},{"volume-title":"Breakthroughs in statistics","author":"Huber Peter J","key":"e_1_3_2_1_47_1","unstructured":"Peter J Huber . 1992. Robust estimation of a location parameter . In Breakthroughs in statistics . Springer , 492\u2013518. Peter J Huber. 1992. Robust estimation of a location parameter. In Breakthroughs in statistics. Springer, 492\u2013518."},{"key":"e_1_3_2_1_48_1","unstructured":"Ayush Jain and Alon Orlitsky. 2019. Robust Learning of Discrete Distributions from Batches. arXiv preprint arXiv:1911.08532.  Ayush Jain and Alon Orlitsky. 2019. Robust Learning of Discrete Distributions from Batches. arXiv preprint arXiv:1911.08532."},{"key":"e_1_3_2_1_49_1","unstructured":"Ayush Jain and Alon Orlitsky. 2020. A General Method for Robust Learning from Batches. arXiv preprint arXiv:2002.11099.  Ayush Jain and Alon Orlitsky. 2020. A General Method for Robust Learning from Batches. arXiv preprint arXiv:2002.11099."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1214\/09-EJS526"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"crossref","unstructured":"A. T. Kalai A. Moitra and G. Valiant. 2010. Efficiently learning mixtures of two Gaussians. In STOC. 553\u2013562.  A. T. Kalai A. Moitra and G. Valiant. 2010. Efficiently learning mixtures of two Gaussians. In STOC. 553\u2013562.","DOI":"10.1145\/1806689.1806765"},{"key":"e_1_3_2_1_52_1","unstructured":"Sushrut Karmalkar Pravesh Kothari and Adam Klivans. 2019. List-Decodable Linear Regression. arXiv preprint arXiv:1905.05679.  Sushrut Karmalkar Pravesh Kothari and Adam Klivans. 2019. List-Decodable Linear Regression. arXiv preprint arXiv:1905.05679."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.2307\/3318521"},{"key":"e_1_3_2_1_54_1","volume-title":"Efficient Algorithms for Outlier-Robust Regression. In Conference On Learning Theory. 1420\u20131430","author":"Klivans Adam","year":"2018","unstructured":"Adam Klivans , Pravesh K Kothari , and Raghu Meka . 2018 . Efficient Algorithms for Outlier-Robust Regression. In Conference On Learning Theory. 1420\u20131430 . Adam Klivans, Pravesh K Kothari, and Raghu Meka. 2018. Efficient Algorithms for Outlier-Robust Regression. In Conference On Learning Theory. 1420\u20131430."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1214\/10-AOS814"},{"key":"e_1_3_2_1_56_1","volume-title":"Ananda Theertha Suresh, and Dave Bacon","author":"Kone\u010dn\u1ef3 Jakub","year":"2016","unstructured":"Jakub Kone\u010dn\u1ef3 , H Brendan McMahan , Felix X Yu , Peter Richt\u00e1rik , Ananda Theertha Suresh, and Dave Bacon . 2016 . Federated learning: Strategies for improving communication efficiency. arXiv preprint arXiv:1610.05492. Jakub Kone\u010dn\u1ef3, H Brendan McMahan, Felix X Yu, Peter Richt\u00e1rik, Ananda Theertha Suresh, and Dave Bacon. 2016. Federated learning: Strategies for improving communication efficiency. arXiv preprint arXiv:1610.05492."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188970"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.76"},{"key":"e_1_3_2_1_59_1","first-page":"1502","article-title":"Estimation of moments of sums of independent real random variables","volume":"25","author":"Rafa\u0142 Lata\u0142","year":"1997","unstructured":"Rafa\u0142 Lata\u0142 a. 1997 . Estimation of moments of sums of independent real random variables . The Annals of Probability , 25 , 3 (1997), 1502 \u2013 1513 . Rafa\u0142 Lata\u0142 a. 1997. Estimation of moments of sums of independent real random variables. The Annals of Probability, 25, 3 (1997), 1502\u20131513.","journal-title":"The Annals of Probability"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2013.v009a008"},{"key":"e_1_3_2_1_61_1","volume-title":"Conference on Learning Theory. 1302\u20131382","author":"Li Jerry","year":"2017","unstructured":"Jerry Li and Ludwig Schmidt . 2017 . Robust and proper learning for mixtures of gaussians via systems of polynomial inequalities . In Conference on Learning Theory. 1302\u20131382 . Jerry Li and Ludwig Schmidt. 2017. Robust and proper learning for mixtures of gaussians via systems of polynomial inequalities. In Conference on Learning Theory. 1302\u20131382."},{"key":"e_1_3_2_1_63_1","volume-title":"Proceedings of the 20th International Conference on Artificial Intelligence and Statistics (AISTATS). arxiv:1602","author":"McMahan H. Brendan","year":"2017","unstructured":"H. Brendan McMahan , Eider Moore , Daniel Ramage , Seth Hampson , and Blaise Aguera y Arcas . 2017 . Communication-Efficient Learning of Deep Networks from Decentralized Data . In Proceedings of the 20th International Conference on Artificial Intelligence and Statistics (AISTATS). arxiv:1602 .05629 H. Brendan McMahan, Eider Moore, Daniel Ramage, Seth Hampson, and Blaise Aguera y Arcas. 2017. Communication-Efficient Learning of Deep Networks from Decentralized Data. In Proceedings of the 20th International Conference on Artificial Intelligence and Statistics (AISTATS). arxiv:1602.05629"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"crossref","unstructured":"A. Moitra and G. Valiant. 2010. Settling the polynomial learnability of mixtures of Gaussians. In FOCS. 93\u2013102.  A. Moitra and G. Valiant. 2010. Settling the polynomial learnability of mixtures of Gaussians. In FOCS. 93\u2013102.","DOI":"10.1109\/FOCS.2010.15"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1111\/insr.12185"},{"key":"e_1_3_2_1_66_1","unstructured":"Mingda Qiao and Gregory Valiant. 2017. Learning discrete distributions from untrusted batches. arXiv preprint arXiv:1711.08113.  Mingda Qiao and Gregory Valiant. 2017. Learning discrete distributions from untrusted batches. arXiv preprint arXiv:1711.08113."},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"crossref","unstructured":"Prasad Raghavendra Tselil Schramm and David Steurer. 2018. High-dimensional estimation via sum-of-squares proofs. arXiv preprint arXiv:1807.11419.  Prasad Raghavendra Tselil Schramm and David Steurer. 2018. High-dimensional estimation via sum-of-squares proofs. arXiv preprint arXiv:1807.11419.","DOI":"10.1142\/9789813272880_0186"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"crossref","unstructured":"Prasad Raghavendra and Morris Yau. 2019. List Decodable Learning via Sum of Squares. arXiv preprint arXiv:1905.04660.  Prasad Raghavendra and Morris Yau. 2019. List Decodable Learning via Sum of Squares. arXiv preprint arXiv:1905.04660.","DOI":"10.1137\/1.9781611975994.10"},{"key":"e_1_3_2_1_69_1","first-page":"23","article-title":"Estimation of a unimodal density","volume":"31","author":"Prakasa Rao B.L.S.","year":"1969","unstructured":"B.L.S. Prakasa Rao . 1969 . Estimation of a unimodal density . Sankhya Ser. A , 31 (1969), 23 \u2013 36 . B.L.S. Prakasa Rao. 1969. Estimation of a unimodal density. Sankhya Ser. A, 31 (1969), 23\u201336.","journal-title":"Sankhya Ser. A"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1137\/1026034"},{"key":"e_1_3_2_1_71_1","unstructured":"Jacob Steinhardt. 2018. Robust Learning: Information Theory and Algorithms. Ph.D. Dissertation. Stanford University.  Jacob Steinhardt. 2018. Robust Learning: Information Theory and Algorithms. Ph.D. Dissertation. Stanford University."},{"key":"e_1_3_2_1_72_1","volume-title":"Resilience: A Criterion for Learning in the Presence of Arbitrary Outliers. In 9th Innovations in Theoretical Computer Science Conference (ITCS","author":"Steinhardt Jacob","year":"2018","unstructured":"Jacob Steinhardt , Moses Charikar , and Gregory Valiant . 2018 . Resilience: A Criterion for Learning in the Presence of Arbitrary Outliers. In 9th Innovations in Theoretical Computer Science Conference (ITCS 2018). Jacob Steinhardt, Moses Charikar, and Gregory Valiant. 2018. Resilience: A Criterion for Learning in the Presence of Arbitrary Outliers. In 9th Innovations in Theoretical Computer Science Conference (ITCS 2018)."},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176325361"},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1031594728"},{"key":"e_1_3_2_1_75_1","unstructured":"Kevin Tian Weihao Kong and Gregory Valiant. 2017. Learning populations of parameters. In Advances in Neural Information Processing Systems. 5778\u20135787.  Kevin Tian Weihao Kong and Gregory Valiant. 2017. Learning populations of parameters. In Advances in Neural Information Processing Systems. 5778\u20135787."},{"volume-title":"Theory of approximation of functions of a real variable. 34","author":"Timan Aleksandr Filippovich","key":"e_1_3_2_1_76_1","unstructured":"Aleksandr Filippovich Timan . 2014. Theory of approximation of functions of a real variable. 34 , Elsevier . Aleksandr Filippovich Timan. 2014. Theory of approximation of functions of a real variable. 34, Elsevier."},{"key":"e_1_3_2_1_77_1","unstructured":"John W Tukey. 1960. A survey of sampling from contaminated distributions. Contributions to probability and statistics 448\u2013485.  John W Tukey. 1960. A survey of sampling from contaminated distributions. Contributions to probability and statistics 448\u2013485."},{"key":"e_1_3_2_1_78_1","volume-title":"Proceedings of the International Congress of Mathematicians","author":"Tukey John W","year":"1975","unstructured":"John W Tukey . 1975 . Mathematics and the picturing of data . In Proceedings of the International Congress of Mathematicians , Vancouver , 1975. 2, 523\u2013531. John W Tukey. 1975. Mathematics and the picturing of data. In Proceedings of the International Congress of Mathematicians, Vancouver, 1975. 2, 523\u2013531."},{"key":"e_1_3_2_1_79_1","unstructured":"Vladimir Vapnik and Alexey Chervonenkis. 1974. Theory of pattern recognition.  Vladimir Vapnik and Alexey Chervonenkis. 1974. Theory of pattern recognition."},{"volume-title":"Proceedings of the 43rd Annual Symposium on Foundations of Computer Science. 113\u2013122","author":"Vempala S.","key":"e_1_3_2_1_80_1","unstructured":"S. Vempala and G. Wang . 2002. A Spectral Algorithm for learning mixtures of distributions . In Proceedings of the 43rd Annual Symposium on Foundations of Computer Science. 113\u2013122 . S. Vempala and G. Wang. 2002. A Spectral Algorithm for learning mixtures of distributions. In Proceedings of the 43rd Annual Symposium on Foundations of Computer Science. 113\u2013122."},{"key":"e_1_3_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1214\/09-STS303"},{"key":"e_1_3_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177697085"},{"key":"e_1_3_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177697085"},{"key":"e_1_3_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1983.10477977"},{"key":"e_1_3_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.903139"}],"event":{"name":"STOC '20: 52nd Annual ACM SIGACT Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Chicago IL USA","acronym":"STOC '20"},"container-title":["Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384337","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357713.3384337","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357713.3384337","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:32:57Z","timestamp":1750199577000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384337"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,22]]},"references-count":84,"alternative-id":["10.1145\/3357713.3384337","10.1145\/3357713"],"URL":"https:\/\/doi.org\/10.1145\/3357713.3384337","relation":{},"subject":[],"published":{"date-parts":[[2020,6,22]]},"assertion":[{"value":"2020-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}