The complexity of gradient descent: CLS = PPAD ∩ PLS
Egile Nagusiak: | Fearnley, J, Goldberg, P, Hollender, A, Savani, R |
---|---|
Formatua: | Conference item |
Hizkuntza: | English |
Argitaratua: |
Association for Computing Machinery
2021
|
Antzeko izenburuak
-
The complexity of gradient descent: CLS = PPAD∩PLS
nork: Fearnley, J, et al.
Argitaratua: (2022) -
Pure-Circuit: tight inapproximability for PPAD
nork: Deligkas, A, et al.
Argitaratua: (2024) -
Pure-circuit: strong inapproximability for PPAD
nork: Deligkas, A, et al.
Argitaratua: (2022) -
The Hairy Ball problem is PPAD-complete
nork: Goldberg, P, et al.
Argitaratua: (2019) -
The Hairy Ball problem is PPAD-complete
nork: Goldberg, PW, et al.
Argitaratua: (2021)