The complexity of gradient descent: CLS = PPAD ∩ PLS
Autors principals: | Fearnley, J, Goldberg, P, Hollender, A, Savani, R |
---|---|
Format: | Conference item |
Idioma: | English |
Publicat: |
Association for Computing Machinery
2021
|
Ítems similars
-
The complexity of gradient descent: CLS = PPAD∩PLS
per: Fearnley, J, et al.
Publicat: (2022) -
Pure-Circuit: tight inapproximability for PPAD
per: Deligkas, A, et al.
Publicat: (2024) -
Pure-circuit: strong inapproximability for PPAD
per: Deligkas, A, et al.
Publicat: (2022) -
The Hairy Ball problem is PPAD-complete
per: Goldberg, P, et al.
Publicat: (2019) -
The Hairy Ball problem is PPAD-complete
per: Goldberg, PW, et al.
Publicat: (2021)