APA-ийн эшлэл(7 дахь хэвлэлт)

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

Чикаго-гийн эшлэл (17 дахь хэвлэлт)

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

MLA -ийн эшлэл (9 дэх хэвлэлт)

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