Fearnley, J., Goldberg, P., Hollender, A., & Savani, R. (2021). The complexity of gradient descent: CLS = PPAD ∩ PLS. Association for Computing Machinery.
Chicago-čujuhus (17. p.)Fearnley, J., P. Goldberg, A. Hollender, juo R. Savani. The Complexity of Gradient Descent: CLS = PPAD ∩ PLS. Association for Computing Machinery, 2021.
MLA-čujuhus (9. p.)Fearnley, J., et al. The Complexity of Gradient Descent: CLS = PPAD ∩ PLS. Association for Computing Machinery, 2021.
Muitte dárkkistit čujuhemiid riektatvuođa, ovdal go geavahat daid iežat deavsttas.