{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:10:47Z","timestamp":1750219847420,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":58,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T00:00:00Z","timestamp":1685664000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-2107547,CCF-2107079,CCF-2144298"],"award-info":[{"award-number":["CCF-2107547,CCF-2107079,CCF-2144298"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,2]]},"DOI":"10.1145\/3564246.3585191","type":"proceedings-article","created":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T17:34:20Z","timestamp":1684258460000},"page":"1741-1754","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A Strongly Polynomial Algorithm for Approximate Forster Transforms and Its Application to Halfspace Learning"],"prefix":"10.1145","author":[{"given":"Ilias","family":"Diakonikolas","sequence":"first","affiliation":[{"name":"University of Wisconsin-Madison, USA"}]},{"given":"Christos","family":"Tzamos","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, USA \/ University of Athens, Greece"}]},{"given":"Daniel M.","family":"Kane","sequence":"additional","affiliation":[{"name":"University of California at San Diego, San Diego, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,6,2]]},"reference":[{"volume-title":"Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018. ACM, 172\u2013181","author":"Allen-Zhu Z.","key":"e_1_3_2_1_1_1","unstructured":"Z. Allen-Zhu , A. Garg , Y. Li , R. M. de Oliveira , and A. Wigderson . 2018. Operator scaling via geodesically convex optimization, invariant theory and polynomial identity testing . In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018. ACM, 172\u2013181 . Z. Allen-Zhu, A. Garg, Y. Li, R. M. de Oliveira, and A. Wigderson. 2018. Operator scaling via geodesically convex optimization, invariant theory and polynomial identity testing. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018. ACM, 172\u2013181."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00116829"},{"key":"e_1_3_2_1_3_1","unstructured":"S. Artstein-Avidan H. Kaplan and M. Sharir. 2020. On Radial Isotropic Position: Theory and Algorithms. CoRR abs\/2005.04918 (2020) arxiv:2005.04918. arxiv:2005.04918 \t\t\t\t  S. Artstein-Avidan H. Kaplan and M. Sharir. 2020. On Radial Isotropic Position: Theory and Algorithms. CoRR abs\/2005.04918 (2020) arxiv:2005.04918. arxiv:2005.04918"},{"key":"e_1_3_2_1_4_1","volume-title":"On a reverse form of the Brascamp-Lieb inequality. Inventiones mathematicae, 134","author":"Barthe F.","year":"1998","unstructured":"F. Barthe . 1998. On a reverse form of the Brascamp-Lieb inequality. Inventiones mathematicae, 134 ( 1998 ), 335\u2013361. F. Barthe. 1998. On a reverse form of the Brascamp-Lieb inequality. Inventiones mathematicae, 134 (1998), 335\u2013361."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-004-2878-4"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00013833"},{"volume-title":"37th Annual Symposium on Foundations of Computer Science, FOCS \u201996","author":"Blum A.","key":"e_1_3_2_1_7_1","unstructured":"A. Blum , A. M. Frieze , R. Kannan , and S. Vempala . 1996. A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions . In 37th Annual Symposium on Foundations of Computer Science, FOCS \u201996 . 330\u2013338. A. Blum, A. M. Frieze, R. Kannan, and S. Vempala. 1996. A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions. In 37th Annual Symposium on Foundations of Computer Science, FOCS \u201996. 330\u2013338."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/76359.76371"},{"key":"e_1_3_2_1_9_1","volume-title":"59th IEEE Annual Symposium on Foundations of Computer Science, FOCS","author":"B\u00fcrgisser P.","year":"2018","unstructured":"P. B\u00fcrgisser , C. Franks , A. Garg , R. M. de Oliveira , Michael Walter , and A. Wigderson . 2018. Efficient Algorithms for Tensor Scaling, Quantum Marginals, and Moment Polytopes . In 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018 . IEEE Computer Society, 883\u2013897. P. B\u00fcrgisser, C. Franks, A. Garg, R. M. de Oliveira, Michael Walter, and A. Wigderson. 2018. Efficient Algorithms for Tensor Scaling, Quantum Marginals, and Moment Polytopes. In 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018. IEEE Computer Society, 883\u2013897."},{"key":"e_1_3_2_1_10_1","volume-title":"Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020","author":"Chen S.","year":"2020","unstructured":"S. Chen , F. Koehler , A. Moitra , and M. Yau . 2020. Classification Under Misspecification: Halfspaces, Generalized Linear Models, and Evolvability . In Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020 , NeurIPS 2020 . S. Chen, F. Koehler, A. Moitra, and M. Yau. 2020. Classification Under Misspecification: Halfspaces, Generalized Linear Models, and Evolvability. In Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1997.646140"},{"volume-title":"Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020. ACM, 761\u2013774","author":"Dadush D.","key":"e_1_3_2_1_12_1","unstructured":"D. Dadush , S. Huiberts , B. Natura , and L. A. V\u00e9gh . 2020. A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix . In Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020. ACM, 761\u2013774 . D. Dadush, S. Huiberts, B. Natura, and L. A. V\u00e9gh. 2020. A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. In Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020. ACM, 761\u2013774."},{"key":"e_1_3_2_1_13_1","volume-title":"Approximate Solvers. In 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS","author":"Dadush D.","year":"2020","unstructured":"D. Dadush , B. Natura , and L. A. V\u00e9gh . 2020. Revisiting Tardos\u2019s Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers. In 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020 . IEEE, 931\u2013942. D. Dadush, B. Natura, and L. A. V\u00e9gh. 2020. Revisiting Tardos\u2019s Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers. In 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020. IEEE, 931\u2013942."},{"key":"e_1_3_2_1_14_1","volume-title":"Distribution-Independent PAC Learning of Halfspaces with Massart Noise. In Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019","author":"Diakonikolas I.","year":"2019","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: Annual Conference on Neural Information Processing Systems 2019 , NeurIPS 2019 , Hanna M. Wallach, Hugo Larochelle, Alina Beygelzimer, Florence d\u2019Alch\u00e9-Buc, Emily B. Fox, and Roman Garnett (Eds.). 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: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, Hanna M. Wallach, Hugo Larochelle, Alina Beygelzimer, Florence d\u2019Alch\u00e9-Buc, Emily B. Fox, and Roman Garnett (Eds.). 4751\u20134762."},{"key":"e_1_3_2_1_15_1","unstructured":"I. Diakonikolas and D. M. Kane. 2020. Near-Optimal Statistical Query Hardness of Learning Halfspaces with Massart Noise. CoRR abs\/2012.09720 (2020) arxiv:2012.09720. arxiv:2012.09720 Conference version in COLT\u201922. \t\t\t\t  I. Diakonikolas and D. M. Kane. 2020. Near-Optimal Statistical Query Hardness of Learning Halfspaces with Massart Noise. CoRR abs\/2012.09720 (2020) arxiv:2012.09720. arxiv:2012.09720 Conference version in COLT\u201922."},{"volume-title":"Conference version in NeurIPS\u201922","author":"Diakonikolas I.","key":"e_1_3_2_1_16_1","unstructured":"I. Diakonikolas , D. M. Kane , P. Manurangsi , and L. Ren . 2022. Cryptographic Hardness of Learning Halfspaces with Massart Noise. CoRR, abs\/2207.14266 (2022), https:\/\/doi.org\/10.48550\/arXiv.2207.14266 arXiv:2207.14266 . Conference version in NeurIPS\u201922 . 10.48550\/arXiv.2207.14266 I. Diakonikolas, D. M. Kane, P. Manurangsi, and L. Ren. 2022. Cryptographic Hardness of Learning Halfspaces with Massart Noise. CoRR, abs\/2207.14266 (2022), https:\/\/doi.org\/10.48550\/arXiv.2207.14266 arXiv:2207.14266. Conference version in NeurIPS\u201922."},{"key":"e_1_3_2_1_17_1","unstructured":"I. Diakonikolas D. M. Kane and C. Tzamos. 2021. Forster Decomposition and Learning Halfspaces with Noise. CoRR abs\/2107.05582 (2021) arXiv:2107.05582. arxiv:2107.05582 Conference version appeared in NeurIPS\u201921. \t\t\t\t  I. Diakonikolas D. M. Kane and C. Tzamos. 2021. Forster Decomposition and Learning Halfspaces with Noise. CoRR abs\/2107.05582 (2021) arXiv:2107.05582. arxiv:2107.05582 Conference version appeared in NeurIPS\u201921."},{"key":"e_1_3_2_1_18_1","unstructured":"I. Diakonikolas J. Park and C. Tzamos. 2021. ReLU Regression with Massart Noise. CoRR abs\/2109.04623 (2021) arXiv:2109.04623. arxiv:2109.04623 Conference version appeared in NeurIPS\u201921. \t\t\t\t  I. Diakonikolas J. Park and C. Tzamos. 2021. ReLU Regression with Massart Noise. CoRR abs\/2109.04623 (2021) arXiv:2109.04623. arxiv:2109.04623 Conference version appeared in NeurIPS\u201921."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2003.07.013"},{"volume-title":"Proceedings of the 36th Annual ACM Symposium on Theory of Computing. 315\u2013320","author":"Dunagan J.","key":"e_1_3_2_1_20_1","unstructured":"J. Dunagan and S. Vempala . 2004. A simple polynomial-time rescaling algorithm for solving linear programs . In Proceedings of the 36th Annual ACM Symposium on Theory of Computing. 315\u2013320 . J. Dunagan and S. Vempala. 2004. A simple polynomial-time rescaling algorithm for solving linear programs. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing. 315\u2013320."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2017.v013a011"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(02)00019-3"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1504"},{"key":"e_1_3_2_1_24_1","volume-title":"Recent progress on scaling algorithms and applications. Bull. EATCS, 125","author":"Garg A.","year":"2018","unstructured":"A. Garg and R. M. de Oliveira . 2018. Recent progress on scaling algorithms and applications. Bull. EATCS, 125 ( 2018 ), http:\/\/eatcs.org\/beatcs\/index.php\/beatcs\/article\/view\/533 A. Garg and R. M. de Oliveira. 2018. Recent progress on scaling algorithms and applications. Bull. EATCS, 125 (2018), http:\/\/eatcs.org\/beatcs\/index.php\/beatcs\/article\/view\/533"},{"volume-title":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017. ACM, 397\u2013409","author":"Garg A.","key":"e_1_3_2_1_25_1","unstructured":"A. Garg , L. Gurvits , R. M. de Oliveira , and A. Wigderson . 2017. Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling . In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017. ACM, 397\u2013409 . A. Garg, L. Gurvits, R. M. de Oliveira, and A. Wigderson. 2017. Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017. ACM, 397\u2013409."},{"volume-title":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019. ACM, 54\u201365","author":"Garg J.","key":"e_1_3_2_1_26_1","unstructured":"J. Garg and L. A. V\u00e9gh . 2019. A strongly polynomial algorithm for linear exchange markets . In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019. ACM, 54\u201365 . J. Garg and L. A. V\u00e9gh. 2019. A strongly polynomial algorithm for linear exchange markets. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019. ACM, 54\u201365."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/76359.76368"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200426"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"M. Gr\u00f6tschel L. Lov\u00e1sz and A. Schrijver. 1988. Geometric Algorithms and Combinatorial Optimization. 2 Springer. \t\t\t\t  M. Gr\u00f6tschel L. Lov\u00e1sz and A. Schrijver. 1988. Geometric Algorithms and Combinatorial Optimization. 2 Springer.","DOI":"10.1007\/978-3-642-97881-4"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-001-0083-2"},{"key":"e_1_3_2_1_31_1","volume-title":"The Paulsen Problem Made Simple. In 10th Innovations in Theoretical Computer Science Conference, ITCS 2019","volume":"6","author":"Hamilton L.","year":"2019","unstructured":"L. Hamilton and A. Moitra . 2019 . The Paulsen Problem Made Simple. In 10th Innovations in Theoretical Computer Science Conference, ITCS 2019 , January 10-12, 2019 (LIPIcs, Vol. 124). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 41:1\u201341: 6 . L. Hamilton and A. Moitra. 2019. The Paulsen Problem Made Simple. In 10th Innovations in Theoretical Computer Science Conference, ITCS 2019, January 10-12, 2019 (LIPIcs, Vol. 124). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 41:1\u201341:6."},{"key":"e_1_3_2_1_32_1","volume-title":"Algorithms and Hardness for Robust Subspace Recovery. In COLT","author":"Hardt M.","year":"2013","unstructured":"M. Hardt and A. Moitra . 2013 . Algorithms and Hardness for Robust Subspace Recovery. In COLT 2013 . 354\u2013375. M. Hardt and A. Moitra. 2013. Algorithms and Hardness for Robust Subspace Recovery. In COLT 2013. 354\u2013375."},{"key":"e_1_3_2_1_33_1","volume-title":"Point Location and Active Learning: Learning Halfspaces Almost Optimally. In 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS","author":"Hopkins M.","year":"2020","unstructured":"M. Hopkins , D. Kane , S. Lovett , and G. Mahajan . 2020 . Point Location and Active Learning: Learning Halfspaces Almost Optimally. In 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020 . IEEE, 1034\u20131044. M. Hopkins, D. Kane, S. Lovett, and G. Mahajan. 2020. Point Location and Active Learning: Learning Halfspaces Almost Optimally. In 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020. IEEE, 1034\u20131044."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"M. Kearns and U. Vazirani. 1994. An Introduction to Computational Learning Theory. MIT Press Cambridge MA. \t\t\t\t  M. Kearns and U. Vazirani. 1994. An Introduction to Computational Learning Theory. MIT Press Cambridge MA.","DOI":"10.7551\/mitpress\/3897.001.0001"},{"volume-title":"Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018. ACM, 182\u2013189","author":"Kwok T. C.","key":"e_1_3_2_1_35_1","unstructured":"T. C. Kwok , L. C. Lau , Y. T. Lee , and A. Ramachandran . 2018. The Paulsen problem, continuous operator scaling, and smoothed analysis . In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018. ACM, 182\u2013189 . T. C. Kwok, L. C. Lau, Y. T. Lee, and A. Ramachandran. 2018. The Paulsen problem, continuous operator scaling, and smoothed analysis. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018. ACM, 182\u2013189."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004930070007"},{"key":"e_1_3_2_1_37_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. \t\t\t\t  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_38_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. \t\t\t\t  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_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212022"},{"key":"e_1_3_2_1_40_1","unstructured":"M. Minsky and S. Papert. 1968. Perceptrons: an introduction to computational geometry. MIT Press Cambridge MA. \t\t\t\t  M. Minsky and S. Papert. 1968. Perceptrons: an introduction to computational geometry. MIT Press Cambridge MA."},{"key":"e_1_3_2_1_41_1","unstructured":"R. Nasser and S. Tiegel. 2022. Optimal SQ Lower Bounds for Learning Halfspaces with Massart Noise. CoRR abs\/2201.09818 (2022) arxiv:2201.09818. arxiv:2201.09818 Conference version in COLT\u201922. \t\t\t\t  R. Nasser and S. Tiegel. 2022. Optimal SQ Lower Bounds for Learning Halfspaces with Massart Noise. CoRR abs\/2201.09818 (2022) arxiv:2201.09818. arxiv:2201.09818 Conference version in COLT\u201922."},{"key":"e_1_3_2_1_42_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_43_1","unstructured":"R. O\u2019Donnell . 2014. Analysis of Boolean Functions . Cambridge University Press . isbn:978-1-10-703832-5 http:\/\/www.cambridge.org\/de\/academic\/subjects\/computer-science\/algorithmics-complexity-computer-algebra-and-computational-g\/analysis-boolean-functions R. O\u2019Donnell. 2014. Analysis of Boolean Functions. Cambridge University Press. isbn:978-1-10-703832-5 http:\/\/www.cambridge.org\/de\/academic\/subjects\/computer-science\/algorithmics-complexity-computer-algebra-and-computational-g\/analysis-boolean-functions"},{"volume-title":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017. ACM, 100\u2013111","author":"Olver N.","key":"e_1_3_2_1_44_1","unstructured":"N. Olver and L. A. V\u00e9gh . 2017. A simpler and faster strongly polynomial algorithm for generalized flow maximization . In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017. ACM, 100\u2013111 . N. Olver and L. A. V\u00e9gh. 2017. A simpler and faster strongly polynomial algorithm for generalized flow maximization. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017. ACM, 100\u2013111."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3383454"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.41.2.338"},{"volume-title":"The Symmetric Eigenvalue Problem","author":"Parlett B. N.","key":"e_1_3_2_1_47_1","unstructured":"B. N. Parlett . 1998. The Symmetric Eigenvalue Problem . Society for Industrial and Applied Mathematics , Philadelphia . isbn:0898714028 B. N. Parlett. 1998. The Symmetric Eigenvalue Problem. Society for Industrial and Applied Mathematics, Philadelphia. isbn:0898714028"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1037\/h0042519"},{"key":"e_1_3_2_1_49_1","unstructured":"J. Shawe-Taylor and N. Cristianini. 2000. An introduction to support vector machines. Cambridge University Press. \t\t\t\t  J. Shawe-Taylor and N. Cristianini. 2000. An introduction to support vector machines. Cambridge University Press."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF03025291"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579369"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.5555\/2780615.2780622"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/800057.808710"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3264-1"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.5555\/3114198.3114682"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591806"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1137\/140978296"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89583"}],"event":{"name":"STOC '23: 55th Annual ACM Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Orlando FL USA","acronym":"STOC '23"},"container-title":["Proceedings of the 55th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564246.3585191","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3564246.3585191","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3564246.3585191","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:01Z","timestamp":1750178821000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564246.3585191"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,2]]},"references-count":58,"alternative-id":["10.1145\/3564246.3585191","10.1145\/3564246"],"URL":"https:\/\/doi.org\/10.1145\/3564246.3585191","relation":{},"subject":[],"published":{"date-parts":[[2023,6,2]]},"assertion":[{"value":"2023-06-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}