The complexity of gradient descent: CLS = PPAD ∩ PLS-Reference-Cited by-同舟云学术

The complexity of gradient descent: CLS = PPAD ∩ PLS

Published:2021-06-15 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Fearnley John¹,Goldberg Paul W.²^ORCID,Hollender Alexandros²^ORCID,Savani Rahul¹^ORCID

Affiliation:

1. University of Liverpool, UK

2. University of Oxford, UK

Funder

EPSRC

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3406325.3451052

Reference36 articles.

1. Amir Ali Ahmadi and Jeffrey Zhang. 2020. Complexity aspects of local minima and related notions. Amir Ali Ahmadi and Jeffrey Zhang. 2020. Complexity aspects of local minima and related notions.

2. Amir Ali Ahmadi and Jeffrey Zhang. 2020. On the complexity of finding a local minimizer of a quadratic function over a polytope. Amir Ali Ahmadi and Jeffrey Zhang. 2020. On the complexity of finding a local minimizer of a quadratic function over a polytope.

3. Settling the complexity of Nash equilibrium in congestion games

4. The relative complexity of NP search problems

5. Propositional proofs and reductions between NP search problems

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Separations in Proof Complexity and TFNP;Journal of the ACM;2024-08

2. Further Collapses in \(\boldsymbol{\mathsf{TFNP}}\);SIAM Journal on Computing;2024-05-02

3. PPAD-complete approximate pure Nash equilibria in Lipschitz games;Theoretical Computer Science;2023-11

4. Cloud-based Collaborative Agricultural Learning with Flexible Model Size and Adaptive Batch Number;ACM Transactions on Sensor Networks;2023-10-21

5. Satiation in Fisher Markets and Approximation of Nash Social Welfare;Mathematics of Operations Research;2023-07-18