The complexity of gradient descent: CLS = PPAD ∩ PLS
Main Authors: | Fearnley, J, Goldberg, P, Hollender, A, Savani, R |
---|---|
Format: | Conference item |
Sprog: | English |
Udgivet: |
Association for Computing Machinery
2021
|
Lignende værker
-
The complexity of gradient descent: CLS = PPAD∩PLS
af: Fearnley, J, et al.
Udgivet: (2022) -
Pure-Circuit: tight inapproximability for PPAD
af: Deligkas, A, et al.
Udgivet: (2024) -
Pure-circuit: strong inapproximability for PPAD
af: Deligkas, A, et al.
Udgivet: (2022) -
The Hairy Ball problem is PPAD-complete
af: Goldberg, P, et al.
Udgivet: (2019) -
The Hairy Ball problem is PPAD-complete
af: Goldberg, PW, et al.
Udgivet: (2021)