The Complexity of Gradient Descent: CLS = PPAD boolean AND PLS



Fearnley, John, Goldberg, Paul W, Hollender, Alexandros and Savani, Rahul ORCID: 0000-0003-1262-7831
(2021) The Complexity of Gradient Descent: CLS = PPAD boolean AND PLS. .

This is the latest version of this item.

[img] Text
2011.01929v1.pdf - Submitted Version

Download (1MB) | Preview
[img] Text
stoc-elements.pdf - Accepted Version

Download (880kB) | Preview
Item Type: Conference or Workshop Item (Unspecified)
Uncontrolled Keywords: TFNP, computational complexity, continuous optimization
Divisions: Faculty of Science and Engineering > School of Electrical Engineering, Electronics and Computer Science
Depositing User: Symplectic Admin
Date Deposited: 21 Jun 2021 08:22
Last Modified: 13 Aug 2022 12:07
DOI: 10.1145/3406325.3451052
Open Access URL: https://dl.acm.org/doi/pdf/10.1145/3406325.3451052
Related URLs:
URI: https://livrepository.liverpool.ac.uk/id/eprint/3126955

Available Versions of this Item