{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:47:08Z","timestamp":1750308428383,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":54,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T00:00:00Z","timestamp":1654732800000},"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":[[2022,6,9]]},"DOI":"10.1145\/3519935.3519970","type":"proceedings-article","created":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T15:29:32Z","timestamp":1654874972000},"page":"874-885","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Learning general halfspaces with general Massart noise under the Gaussian distribution"],"prefix":"10.1145","author":[{"given":"Ilias","family":"Diakonikolas","sequence":"first","affiliation":[{"name":"University of Wisconsin-Madison, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel M.","family":"Kane","sequence":"additional","affiliation":[{"name":"University of California at San Diego, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vasilis","family":"Kontonis","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Tzamos","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikos","family":"Zarifis","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,6,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022873112823"},{"volume-title":"Proceedings of The 28th Conference on Learning Theory, COLT 2015. 167\u2013190","author":"Awasthi P.","key":"e_1_3_2_1_2_1","unstructured":"P. Awasthi , M. F. Balcan , N. Haghtalab , and R. Urner . 2015. Efficient Learning of Linear Separators under Bounded Noise . In Proceedings of The 28th Conference on Learning Theory, COLT 2015. 167\u2013190 . P. Awasthi, M. F. Balcan, N. Haghtalab, and R. Urner. 2015. Efficient Learning of Linear Separators under Bounded Noise. In Proceedings of The 28th Conference on Learning Theory, COLT 2015. 167\u2013190."},{"volume-title":"Proceedings of the 29th Conference on Learning Theory, COLT 2016. 152\u2013192","author":"Awasthi P.","key":"e_1_3_2_1_3_1","unstructured":"P. Awasthi , M. F. Balcan , N. Haghtalab , and H. Zhang . 2016. Learning and 1-bit Compressed Sensing under Asymmetric Noise . In Proceedings of the 29th Conference on Learning Theory, COLT 2016. 152\u2013192 . P. Awasthi, M. F. Balcan, N. Haghtalab, and H. Zhang. 2016. Learning and 1-bit Compressed Sensing under Asymmetric Noise. In Proceedings of the 29th Conference on Learning Theory, COLT 2016. 152\u2013192."},{"key":"e_1_3_2_1_4_1","unstructured":"M.-F. Balcan and H. Zhang. 2017. Sample and computationally efficient learning algorithms under s-concave distributions. In Advances in Neural Information Processing Systems. 4796\u20134805.  M.-F. Balcan and H. Zhang. 2017. Sample and computationally efficient learning algorithms under s-concave distributions. In Advances in Neural Information Processing Systems. 4796\u20134805."},{"volume-title":"Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP. 280\u2013287","author":"Beigman E.","key":"e_1_3_2_1_5_1","unstructured":"E. Beigman and B. B. Klebanov . 2009. Learning with annotation noise . In Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP. 280\u2013287 . E. Beigman and B. B. Klebanov. 2009. Learning with annotation noise. In Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP. 280\u2013287."},{"key":"e_1_3_2_1_6_1","unstructured":"S. Chen F. Koehler A. Moitra and M. Yau. 2020. Classification Under Misspecification: Halfspaces Generalized Linear Models and Connections to Evolvability. In Advances in Neural Information Processing Systems NeurIPS.  S. Chen F. Koehler A. Moitra and M. Yau. 2020. Classification Under Misspecification: Halfspaces Generalized Linear Models and Connections to Evolvability. In Advances in Neural Information Processing Systems NeurIPS."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1984.10477109"},{"key":"e_1_3_2_1_8_1","volume-title":"Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA","author":"Dachman-Soled D.","year":"2015","unstructured":"D. Dachman-Soled , V. Feldman , L.-Y. Tan , A. Wan , and K. Wimmer . 2015. Approximate resilience, monotonicity, and the complexity of agnostic learning . In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015 , Piotr Indyk (Ed.). SIAM, 498\u2013511. D. Dachman-Soled, V. Feldman, L.-Y. Tan, A. Wan, and K. Wimmer. 2015. Approximate resilience, monotonicity, and the complexity of agnostic learning. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, Piotr Indyk (Ed.). SIAM, 498\u2013511."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897520"},{"key":"e_1_3_2_1_10_1","unstructured":"I. Diakonikolas T. Gouleakis and C. Tzamos. 2019. Distribution-Independent PAC Learning of Halfspaces with Massart Noise. In Advances in Neural Information Processing Systems 32 H. Wallach H. Larochelle A. Beygelzimer F. d\u2019Alch\u00e9 Buc E. Fox and R. Garnett (Eds.). Curran Associates Inc. 4751\u20134762.  I. Diakonikolas T. Gouleakis and C. Tzamos. 2019. Distribution-Independent PAC Learning of Halfspaces with Massart Noise. In Advances in Neural Information Processing Systems 32 H. Wallach H. Larochelle A. Beygelzimer F. d\u2019Alch\u00e9 Buc E. Fox and R. Garnett (Eds.). Curran Associates Inc. 4751\u20134762."},{"key":"e_1_3_2_1_11_1","unstructured":"I. Diakonikolas and D. M. Kane. 2020. Hardness of Learning Halfspaces with Massart Noise. CoRR abs\/2012.09720 (2020) arxiv:2012.09720.  I. Diakonikolas and D. M. Kane. 2020. Hardness of Learning Halfspaces with Massart Noise. CoRR abs\/2012.09720 (2020) arxiv:2012.09720."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"I. Diakonikolas D. M. Kane V. Kontonis C. Tzamos and N. Zarifis. 2020. A Polynomial Time Algorithm for Learning Halfspaces with Tsybakov Noise. arXiv arxiv:2010.01705.  I. Diakonikolas D. M. Kane V. Kontonis C. Tzamos and N. Zarifis. 2020. A Polynomial Time Algorithm for Learning Halfspaces with Tsybakov Noise. arXiv arxiv:2010.01705.","DOI":"10.1145\/3406325.3450998"},{"volume-title":"Proceedings of The 34th Conference on Learning Theory, COLT.","author":"Diakonikolas I.","key":"e_1_3_2_1_13_1","unstructured":"I. Diakonikolas , D. M. Kane , V. Kontonis , C. Tzamos , and N. Zarifis . 2021. Agnostic Proper Learning of Halfspaces under Gaussian Marginals . In Proceedings of The 34th Conference on Learning Theory, COLT. I. Diakonikolas, D. M. Kane, V. Kontonis, C. Tzamos, and N. Zarifis. 2021. Agnostic Proper Learning of Halfspaces under Gaussian Marginals. In Proceedings of The 34th Conference on Learning Theory, COLT."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"I. Diakonikolas D. M. Kane V. Kontonis C. Tzamos and N. Zarifis. 2021. Efficiently Learning Halfspaces with Tsybakov Noise. STOC.  I. Diakonikolas D. M. Kane V. Kontonis C. Tzamos and N. Zarifis. 2021. Efficiently Learning Halfspaces with Tsybakov Noise. STOC.","DOI":"10.1145\/3406325.3450998"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"I. Diakonikolas D. M. Kane V. Kontonis C. Tzamos and N. Zarifis. 2021. Learning General Halfspaces with General Massart Noise under the Gaussian Distribution. arxiv:2108.08767  I. Diakonikolas D. M. Kane V. Kontonis C. Tzamos and N. Zarifis. 2021. Learning General Halfspaces with General Massart Noise under the Gaussian Distribution. arxiv:2108.08767","DOI":"10.1145\/3519935.3519970"},{"volume-title":"Proceedings of The 34th Conference on Learning Theory, COLT.","author":"Diakonikolas I.","key":"e_1_3_2_1_16_1","unstructured":"I. Diakonikolas , D. M. Kane , T. Pittas , and N. Zarifis . 2021. The Optimality of Polynomial Regression for Agnostic Learning under Gaussian Marginals . In Proceedings of The 34th Conference on Learning Theory, COLT. I. Diakonikolas, D. M. Kane, T. Pittas, and N. Zarifis. 2021. The Optimality of Polynomial Regression for Agnostic Learning under Gaussian Marginals. In Proceedings of The 34th Conference on Learning Theory, COLT."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.16"},{"key":"e_1_3_2_1_18_1","volume-title":"Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020","author":"Diakonikolas I.","year":"2020","unstructured":"I. Diakonikolas , D. M. Kane , and N. Zarifis . 2020. Near-Optimal SQ Lower Bounds for Agnostically Learning Halfspaces and ReLUs under Gaussian Marginals . In Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020 , NeurIPS 2020 . I. Diakonikolas, D. M. Kane, and N. Zarifis. 2020. Near-Optimal SQ Lower Bounds for Agnostically Learning Halfspaces and ReLUs under Gaussian Marginals. In Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020."},{"key":"e_1_3_2_1_19_1","volume-title":"Learning Halfspaces with Massart Noise Under Structured Distributions. In Conference on Learning Theory, COLT 2020 (Proceedings of Machine Learning Research","volume":"1513","author":"Diakonikolas I.","unstructured":"I. Diakonikolas , V. Kontonis , C. Tzamos , and N. Zarifis . 2020 . Learning Halfspaces with Massart Noise Under Structured Distributions. In Conference on Learning Theory, COLT 2020 (Proceedings of Machine Learning Research , Vol. 125). PMLR, 1486\u2013 1513 . I. Diakonikolas, V. Kontonis, C. Tzamos, and N. Zarifis. 2020. Learning Halfspaces with Massart Noise Under Structured Distributions. In Conference on Learning Theory, COLT 2020 (Proceedings of Machine Learning Research, Vol. 125). PMLR, 1486\u20131513."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"I. Diakonikolas V. Kontonis C. Tzamos and N. Zarifis. 2020. Learning Halfspaces with Tsybakov Noise. arXiv arxiv:2006.06467.  I. Diakonikolas V. Kontonis C. Tzamos and N. Zarifis. 2020. Learning Halfspaces with Tsybakov Noise. arXiv arxiv:2006.06467.","DOI":"10.1145\/3406325.3450998"},{"volume-title":"New Results for Learning Noisy Parities and Halfspaces. In 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society, 563\u2013574","author":"Feldman V.","key":"e_1_3_2_1_21_1","unstructured":"V. Feldman , P. Gopalan , S. Khot , and A. K. Ponnuswami . 2006 . New Results for Learning Noisy Parities and Halfspaces. In 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society, 563\u2013574 . V. Feldman, P. Gopalan, S. Khot, and A. K. Ponnuswami. 2006. New Results for Learning Noisy Parities and Halfspaces. In 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society, 563\u2013574."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1504"},{"key":"e_1_3_2_1_23_1","volume-title":"Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020","author":"Goel S.","year":"2020","unstructured":"S. Goel , A. Gollakota , and A. R. Klivans . 2020. Statistical-Query Lower Bounds via Functional Gradients . In Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020 , NeurIPS 2020 . S. Goel, A. Gollakota, and A. R. Klivans. 2020. Statistical-Query Lower Bounds via Functional Gradients. In Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200426"},{"volume-title":"Proc. 47th IEEE Symposium on Foundations of Computer Science (FOCS). 543\u2013552","author":"Guruswami V.","key":"e_1_3_2_1_25_1","unstructured":"V. Guruswami and P. Raghavendra . 2006. Hardness of learning halfspaces with noise . In Proc. 47th IEEE Symposium on Foundations of Computer Science (FOCS). 543\u2013552 . V. Guruswami and P. Raghavendra. 2006. Hardness of learning halfspaces with noise. In Proc. 47th IEEE Symposium on Foundations of Computer Science (FOCS). 543\u2013552."},{"key":"e_1_3_2_1_26_1","unstructured":"S. Hanneke. 2009. Theoretical foundations of active learning. CARNEGIE-MELLON UNIV PITTSBURGH PA MACHINE LEARNING DEPT.  S. Hanneke. 2009. Theoretical foundations of active learning. CARNEGIE-MELLON UNIV PITTSBURGH PA MACHINE LEARNING DEPT."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/2789272.2912111"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90010-D"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/060649057"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00993468"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293351"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1162\/coli.2009.35.4.35402"},{"volume-title":"Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics. 438\u2013446","author":"Klebanov B. B.","key":"e_1_3_2_1_33_1","unstructured":"B. B. Klebanov and E. Beigman . 2010. Some empirical evidence for annotation noise in a benchmarked dataset . In Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics. 438\u2013446 . B. B. Klebanov and E. Beigman. 2010. Some empirical evidence for annotation noise in a benchmarked dataset. In Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics. 438\u2013446."},{"key":"e_1_3_2_1_34_1","unstructured":"W. Maass and G. Turan. 1994. How fast can a threshold gate learn? In Computational Learning Theory and Natural Learning Systems S. Hanson G. Drastal and R. Rivest (Eds.). MIT Press 381\u2013414.  W. Maass and G. Turan. 1994. How fast can a threshold gate learn? In Computational Learning Theory and Natural Learning Systems S. Hanson G. Drastal and R. Rivest (Eds.). MIT Press 381\u2013414."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"E. Mammen and A. B. Tsybakov. 1999. Smooth discrimination analysis. Ann. Statist. 27 6 (1999) 12 1808\u20131829.  E. Mammen and A. B. Tsybakov. 1999. Smooth discrimination analysis. Ann. Statist. 27 6 (1999) 12 1808\u20131829.","DOI":"10.1214\/aos\/1017939240"},{"key":"e_1_3_2_1_36_1","volume-title":"Conference on Learning Theory, COLT","author":"Mangoubi O.","year":"2019","unstructured":"O. Mangoubi and N. K. Vishnoi . 2019. Nonconvex sampling with the Metropolis-adjusted Langevin algorithm . In Conference on Learning Theory, COLT 2019 . 2259\u20132293. O. Mangoubi and N. K. Vishnoi. 2019. Nonconvex sampling with the Metropolis-adjusted Langevin algorithm. In Conference on Learning Theory, COLT 2019. 2259\u20132293."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"P. Massart and E. Nedelec. 2006. Risk bounds for statistical learning. Ann. Statist. 34 5 (2006) 10 2326\u20132366.  P. Massart and E. Nedelec. 2006. Risk bounds for statistical learning. Ann. Statist. 34 5 (2006) 10 2326\u20132366.","DOI":"10.1214\/009053606000000786"},{"key":"e_1_3_2_1_38_1","unstructured":"M. Minsky and S. Papert. 1968. Perceptrons: an introduction to computational geometry. MIT Press Cambridge MA.  M. Minsky and S. Papert. 1968. Perceptrons: an introduction to computational geometry. MIT Press Cambridge MA."},{"key":"e_1_3_2_1_39_1","volume-title":"Proceedings of the Symposium on Mathematical Theory of Automata. XII, 615\u2013622","author":"Novikoff A.","year":"1962","unstructured":"A. Novikoff . 1962 . On convergence proofs on perceptrons . In Proceedings of the Symposium on Mathematical Theory of Automata. XII, 615\u2013622 . A. Novikoff. 1962. On convergence proofs on perceptrons. In Proceedings of the Symposium on Mathematical Theory of Automata. XII, 615\u2013622."},{"volume-title":"Analysis of Boolean Functions","author":"O\u2019Donnell R.","key":"e_1_3_2_1_40_1","unstructured":"R. O\u2019Donnell . 2014. Analysis of Boolean Functions . Cambridge University Press . isbn:978-1-10-703832-5 R. O\u2019Donnell. 2014. Analysis of Boolean Functions. Cambridge University Press. isbn:978-1-10-703832-5"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1081"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1037\/h0042519"},{"key":"e_1_3_2_1_43_1","unstructured":"J. Shawe-Taylor and N. Cristianini. 2000. An introduction to support vector machines. Cambridge University Press.  J. Shawe-Taylor and N. Cristianini. 2000. An introduction to support vector machines. Cambridge University Press."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.5555\/93025.93060"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/130385.130433"},{"volume-title":"Pac Learning, Noise, and Geometry","author":"Sloan R. H.","key":"e_1_3_2_1_46_1","unstructured":"R. H. Sloan . 1996. Pac Learning, Noise, and Geometry . Birkh\u00e4user Boston, Boston , MA. 21\u201341. R. H. Sloan. 1996. Pac Learning, Noise, and Geometry. Birkh\u00e4user Boston, Boston, MA. 21\u201341."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1079120131"},{"volume-title":"Estimation of Dependences Based on Empirical Data: Springer Series in Statistics","author":"Vapnik V.","key":"e_1_3_2_1_48_1","unstructured":"V. Vapnik . 1982. Estimation of Dependences Based on Empirical Data: Springer Series in Statistics . Springer-Verlag , Berlin, Heidelberg . isbn:0387907335 V. Vapnik. 1982. Estimation of Dependences Based on Empirical Data: Springer Series in Statistics. Springer-Verlag, Berlin, Heidelberg. isbn:0387907335"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3264-1"},{"key":"e_1_3_2_1_50_1","volume-title":"Revisiting Perceptron: Efficient and Label-Optimal Learning of Halfspaces. In Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems","author":"Yan S.","year":"2017","unstructured":"S. Yan and C. Zhang . 2017 . Revisiting Perceptron: Efficient and Label-Optimal Learning of Halfspaces. In Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017 . 1056\u20131066. S. Yan and C. Zhang. 2017. Revisiting Perceptron: Efficient and Label-Optimal Learning of Halfspaces. In Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017. 1056\u20131066."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89583"},{"volume-title":"Proceedings of The 34th Conference on Learning Theory, COLT. arxiv:2102","author":"Zhang C.","key":"e_1_3_2_1_52_1","unstructured":"C. Zhang and Y. Li . 2021. Improved Algorithms for Efficient Active Learning Halfspaces with Massart and Tsybakov noise . In Proceedings of The 34th Conference on Learning Theory, COLT. arxiv:2102 .05312. C. Zhang and Y. Li. 2021. Improved Algorithms for Efficient Active Learning Halfspaces with Massart and Tsybakov noise. In Proceedings of The 34th Conference on Learning Theory, COLT. arxiv:2102.05312."},{"key":"e_1_3_2_1_53_1","unstructured":"C. Zhang J. Shen and P. Awasthi. 2020. Efficient active learning of sparse halfspaces with arbitrary bounded noise. In Advances in Neural Information Processing Systems NeurIPS.  C. Zhang J. Shen and P. Awasthi. 2020. Efficient active learning of sparse halfspaces with arbitrary bounded noise. In Advances in Neural Information Processing Systems NeurIPS."},{"volume-title":"Proceedings of the 30th Conference on Learning Theory, COLT 2017. 1980\u20132022","author":"Zhang Y.","key":"e_1_3_2_1_54_1","unstructured":"Y. Zhang , P. Liang , and M. Charikar . 2017. A Hitting Time Analysis of Stochastic Gradient Langevin Dynamics . In Proceedings of the 30th Conference on Learning Theory, COLT 2017. 1980\u20132022 . Y. Zhang, P. Liang, and M. Charikar. 2017. A Hitting Time Analysis of Stochastic Gradient Langevin Dynamics. In Proceedings of the 30th Conference on Learning Theory, COLT 2017. 1980\u20132022."}],"event":{"name":"STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Rome Italy","acronym":"STOC '22"},"container-title":["Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3519970","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519935.3519970","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:49:38Z","timestamp":1750268978000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3519970"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,9]]},"references-count":54,"alternative-id":["10.1145\/3519935.3519970","10.1145\/3519935"],"URL":"https:\/\/doi.org\/10.1145\/3519935.3519970","relation":{},"subject":[],"published":{"date-parts":[[2022,6,9]]},"assertion":[{"value":"2022-06-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}