The complexity of gradient descent: CLS = PPAD ∩ PLS
Prif Awduron: | Fearnley, J, Goldberg, P, Hollender, A, Savani, R |
---|---|
Fformat: | Conference item |
Iaith: | English |
Cyhoeddwyd: |
Association for Computing Machinery
2021
|
Eitemau Tebyg
-
The complexity of gradient descent: CLS = PPAD∩PLS
gan: Fearnley, J, et al.
Cyhoeddwyd: (2022) -
Pure-Circuit: tight inapproximability for PPAD
gan: Deligkas, A, et al.
Cyhoeddwyd: (2024) -
Pure-circuit: strong inapproximability for PPAD
gan: Deligkas, A, et al.
Cyhoeddwyd: (2022) -
The Hairy Ball problem is PPAD-complete
gan: Goldberg, P, et al.
Cyhoeddwyd: (2019) -
The Hairy Ball problem is PPAD-complete
gan: Goldberg, PW, et al.
Cyhoeddwyd: (2021)