The complexity of gradient descent: CLS = PPAD ∩ PLS
Principais autores: | Fearnley, J, Goldberg, P, Hollender, A, Savani, R |
---|---|
Formato: | Conference item |
Idioma: | English |
Publicado em: |
Association for Computing Machinery
2021
|
Registros relacionados
-
The complexity of gradient descent: CLS = PPAD∩PLS
por: Fearnley, J, et al.
Publicado em: (2022) -
Pure-Circuit: tight inapproximability for PPAD
por: Deligkas, A, et al.
Publicado em: (2024) -
Pure-circuit: strong inapproximability for PPAD
por: Deligkas, A, et al.
Publicado em: (2022) -
The Hairy Ball problem is PPAD-complete
por: Goldberg, P, et al.
Publicado em: (2019) -
The Hairy Ball problem is PPAD-complete
por: Goldberg, PW, et al.
Publicado em: (2021)