{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:51:22Z","timestamp":1781077882311,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"EPSRC","award":["PhD studentship 1892947"],"award-info":[{"award-number":["PhD studentship 1892947"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,15]]},"DOI":"10.1145\/3406325.3451052","type":"proceedings-article","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T01:26:13Z","timestamp":1623806773000},"page":"46-59","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["The complexity of gradient descent: CLS = PPAD \u2229 PLS"],"prefix":"10.1145","author":[{"given":"John","family":"Fearnley","sequence":"first","affiliation":[{"name":"University of Liverpool, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5436-7890","authenticated-orcid":false,"given":"Paul W.","family":"Goldberg","sequence":"additional","affiliation":[{"name":"University of Oxford, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5255-9349","authenticated-orcid":false,"given":"Alexandros","family":"Hollender","sequence":"additional","affiliation":[{"name":"University of Oxford, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1262-7831","authenticated-orcid":false,"given":"Rahul","family":"Savani","sequence":"additional","affiliation":[{"name":"University of Liverpool, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Amir Ali Ahmadi and Jeffrey Zhang. 2020. Complexity aspects of local minima and related notions."},{"key":"e_1_3_2_1_2_1","unstructured":"Amir Ali Ahmadi and Jeffrey Zhang. 2020. On the complexity of finding a local minimizer of a quadratic function over a polytope."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451039"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/225058.225147"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2012.01.015"},{"key":"e_1_3_2_1_6_1","first-page":"1847","article-title":"M\u00e9thode g\u00e9n\u00e9rale pour la r\u00e9solution des syst\\`emes d'\u00e9quations simultan\u00e9es","volume":"25","author":"Cauchy Augustin-Louis","year":"1847","unstructured":"Augustin-Louis Cauchy. 1847. M\u00e9thode g\u00e9n\u00e9rale pour la r\u00e9solution des syst\\`emes d'\u00e9quations simultan\u00e9es. C. R. Acad. Sci. Paris, 25, 1847. Pages 536\u2013538.","journal-title":"C. R. Acad. Sci. Paris"},{"key":"e_1_3_2_1_7_1","volume-title":"Proceedings of the 32nd Conference on Learning Theory (COLT). Pages 624\u2013662","author":"Chatziafratis Vaggos","unstructured":"Vaggos Chatziafratis, Tim Roughgarden, and Joshua R. Wang. 2019. On the Computational Power of Online Gradient Descent. In Proceedings of the 32nd Conference on Learning Theory (COLT). Pages 624\u2013662. http:\/\/proceedings.mlr.press\/v99\/chatziafratis19a.html"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.29"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.07.052"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516512.1516516"},{"key":"e_1_3_2_1_11_1","unstructured":"Chuangyin Dang Qi Qi and Yinyu Ye. 2020. Computations and Complexities of Tarski's Fixed Points and Supermodular Games."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/070699652"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973082.62"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451125"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188968"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2020.18"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007445"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"John Fearnley Paul W. Goldberg Alexandros Hollender and Rahul Savani. 2020. The Complexity of Gradient Descent: CLS = PPAD \\cap PLS.","DOI":"10.1145\/3406325.3451052"},{"key":"e_1_3_2_1_19_1","volume-title":"CLS: New Problems and Completeness.","author":"Fearnley John","year":"2017","unstructured":"John Fearnley, Spencer Gordon, Ruta Mehta, and Rahul Savani. 2017. CLS: New Problems and Completeness."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2020.05.007"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746558"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.STACS.2021.29"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2019.65"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.88"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2021.03.004"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3418526"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90046-3"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/120874655"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(91)90200-L"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.87"},{"key":"e_1_3_2_1_31_1","unstructured":"Tsuyoshi Morioka. 2001. Classification of search problems and their definability in bounded arithmetic. https:\/\/www.collectionscanada.ca\/obj\/s4\/f2\/dsk3\/ftp04\/MQ58775.pdf"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592948"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/0221030"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80063-7"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729586"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/0168-9274(95)00014-L"}],"event":{"name":"STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing","location":"Virtual Italy","acronym":"STOC '21","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451052","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451052","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:44Z","timestamp":1750197704000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451052"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":36,"alternative-id":["10.1145\/3406325.3451052","10.1145\/3406325"],"URL":"https:\/\/doi.org\/10.1145\/3406325.3451052","relation":{},"subject":[],"published":{"date-parts":[[2021,6,15]]},"assertion":[{"value":"2021-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}