The complexity of gradient descent: CLS = PPAD ∩ PLS
Auteurs principaux: | Fearnley, J, Goldberg, P, Hollender, A, Savani, R |
---|---|
Format: | Conference item |
Langue: | English |
Publié: |
Association for Computing Machinery
2021
|
Documents similaires
-
The complexity of gradient descent: CLS = PPAD∩PLS
par: Fearnley, J, et autres
Publié: (2022) -
Pure-Circuit: tight inapproximability for PPAD
par: Deligkas, A, et autres
Publié: (2024) -
Pure-circuit: strong inapproximability for PPAD
par: Deligkas, A, et autres
Publié: (2022) -
The Hairy Ball problem is PPAD-complete
par: Goldberg, P, et autres
Publié: (2019) -
The Hairy Ball problem is PPAD-complete
par: Goldberg, PW, et autres
Publié: (2021)