The complexity of gradient descent: CLS = PPAD ∩ PLS
Huvudupphovsmän: | Fearnley, J, Goldberg, P, Hollender, A, Savani, R |
---|---|
Materialtyp: | Conference item |
Språk: | English |
Publicerad: |
Association for Computing Machinery
2021
|
Liknande verk
-
The complexity of gradient descent: CLS = PPAD∩PLS
av: Fearnley, J, et al.
Publicerad: (2022) -
Pure-Circuit: tight inapproximability for PPAD
av: Deligkas, A, et al.
Publicerad: (2024) -
Pure-circuit: strong inapproximability for PPAD
av: Deligkas, A, et al.
Publicerad: (2022) -
The Hairy Ball problem is PPAD-complete
av: Goldberg, P, et al.
Publicerad: (2019) -
The Hairy Ball problem is PPAD-complete
av: Goldberg, PW, et al.
Publicerad: (2021)