Gradient Descent

Gradient Descent is an iterative optimization algorithm that belongs to the class of first-order methods, distinguished by its use of the negative gradient of the objective function to update parameters in the direction of steepest descent for minimizing loss in machine learning models.

7.8K

Publications

821.9K

Citations

17.1K

Authors

3.1K

Institutions

Publications per year

2017–2026

4.2K

Authors

17.1K

  1. YB
    Yoshua Bengio

    Université de Montréal, Canada

    35 publications · 26.1K citations

    27

    h-index

  2. MI
    Michael I. Jordan

    University of California, Berkeley, United States

    36 publications · 3K citations

    27

    h-index

  3. JD
    Jason D. Lee

    University of Southern California, United States

    33 publications · 2.6K citations

    24

    h-index

  4. ZA
    Zeyuan Allen-Zhu

    Princeton University, United States

    26 publications · 2.5K citations

    22

    h-index

  5. QG
    Quanquan Gu

    University of California, Los Angeles, United States

    32 publications · 2.4K citations

    22

    h-index

1–5 of 17.1K

Venues

  1. arXiv (Cornell University)

    Repository · 1.4K publications · 136.5K citations

    138

    h-index

  2. IEEE Transactions on Neural Networks

    91 publications · 18.3K citations

    55

    h-index

  3. SIAM Journal on Optimization

    95 publications · 13.8K citations

    52

    h-index

  4. 45

    h-index

  5. Neural Information Processing Systems

    Conference · 98 publications · 9.9K citations

    44

    h-index

1–5