The complexity of gradient descent: CLS = PPAD ∩ PLS
Váldodahkkit: | Fearnley, J, Goldberg, P, Hollender, A, Savani, R |
---|---|
Materiálatiipa: | Conference item |
Giella: | English |
Almmustuhtton: |
Association for Computing Machinery
2021
|
Geahča maid
-
The complexity of gradient descent: CLS = PPAD∩PLS
Dahkki: Fearnley, J, et al.
Almmustuhtton: (2022) -
Pure-Circuit: tight inapproximability for PPAD
Dahkki: Deligkas, A, et al.
Almmustuhtton: (2024) -
Pure-circuit: strong inapproximability for PPAD
Dahkki: Deligkas, A, et al.
Almmustuhtton: (2022) -
The Hairy Ball problem is PPAD-complete
Dahkki: Goldberg, P, et al.
Almmustuhtton: (2019) -
The Hairy Ball problem is PPAD-complete
Dahkki: Goldberg, PW, et al.
Almmustuhtton: (2021)