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.
एमएलए (9वां संस्करण) प्रशस्ति पत्रFearnley, J., et al. The Complexity of Gradient Descent: CLS = PPAD ∩ PLS. Association for Computing Machinery, 2021.
चेतावनी: ये उद्धरण हमेशा 100% सटीक नहीं हो सकते हैं.