Conference item
The complexity of gradient descent: CLS = PPAD ∩ PLS
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Submitted manuscript under review, Accepted manuscript, 970.9KB, Terms of use)
-
- Publisher copy:
- 10.1145/3406325.3451052
Authors
- Publisher:
- Association for Computing Machinery
- Journal:
- Proceedings of the ACM Symposium on Theory of Computing More from this journal
- Pages:
- 46–59
- Publication date:
- 2021-06-15
- Acceptance date:
- 2021-02-06
- Event title:
- 53rd Annual ACM Symposium on Theory of Computing
- Event location:
- Online
- Event website:
- http://acm-stoc.org/stoc2021/
- Event start date:
- 2021-06-21
- Event end date:
- 2021-06-25
- DOI:
- ISBN:
- 978-1-4503-8053-9
- Language:
-
English
- Keywords:
- Pubs id:
-
1160437
- Local pid:
-
pubs:1160437
- Deposit date:
-
2021-02-09
Terms of use
- Copyright holder:
- Fearnley et al.
- Copyright date:
- 2021
- Rights statement:
- © 2021 Copyright held by the owner/author(s). Publication rights licensed to ACM.
- Notes:
- This paper will be presented at the 53rd Annual ACM Symposium on Theory of Computing (STOC 2021), 21st–25th June 2021, Online. This is the accepted manuscript version of the article. The final version is available from Association for Computing Machinery at: https://doi.org/10.1145/3406325.3451052
If you are the owner of this record, you can report an update to it here: Report update to this record