The complexity of gradient descent: CLS = PPAD ∩ PLS
Main Authors: | Fearnley, J, Goldberg, P, Hollender, A, Savani, R |
---|---|
格式: | Conference item |
語言: | English |
出版: |
Association for Computing Machinery
2021
|
相似書籍
-
The complexity of gradient descent: CLS = PPAD∩PLS
由: Fearnley, J, et al.
出版: (2022) -
Pure-Circuit: tight inapproximability for PPAD
由: Deligkas, A, et al.
出版: (2024) -
Pure-circuit: strong inapproximability for PPAD
由: Deligkas, A, et al.
出版: (2022) -
The Hairy Ball problem is PPAD-complete
由: Goldberg, P, et al.
出版: (2019) -
The Hairy Ball problem is PPAD-complete
由: Goldberg, PW, et al.
出版: (2021)