Dyfyniad APA

Fearnley, J., Goldberg, P., Hollender, A., & Savani, R. (2021). The complexity of gradient descent: CLS = PPAD ∩ PLS. Association for Computing Machinery.

Dyfyniad Arddull Chicago

Fearnley, J., P. Goldberg, A. Hollender, and R. Savani. The Complexity of Gradient Descent: CLS = PPAD ∩ PLS. Association for Computing Machinery, 2021.

Dyfyniad MLA

Fearnley, J., et al. The Complexity of Gradient Descent: CLS = PPAD ∩ PLS. Association for Computing Machinery, 2021.

Rhybudd: Mae'n bosib nad yw'r dyfyniadau hyn bob amser yn 100% cywir.