The complexity of gradient descent: CLS = PPAD ∩ PLS
Príomhchruthaitheoirí: | Fearnley, J, Goldberg, P, Hollender, A, Savani, R |
---|---|
Formáid: | Conference item |
Teanga: | English |
Foilsithe / Cruthaithe: |
Association for Computing Machinery
2021
|
Míreanna comhchosúla
-
The complexity of gradient descent: CLS = PPAD∩PLS
de réir: Fearnley, J, et al.
Foilsithe / Cruthaithe: (2022) -
Pure-Circuit: tight inapproximability for PPAD
de réir: Deligkas, A, et al.
Foilsithe / Cruthaithe: (2024) -
Pure-circuit: strong inapproximability for PPAD
de réir: Deligkas, A, et al.
Foilsithe / Cruthaithe: (2022) -
The Hairy Ball problem is PPAD-complete
de réir: Goldberg, P, et al.
Foilsithe / Cruthaithe: (2019) -
The Hairy Ball problem is PPAD-complete
de réir: Goldberg, PW, et al.
Foilsithe / Cruthaithe: (2021)