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
Variants
Method Of Steepest Descent
7.8K
Adam: A Method for Stochastic Optimization
Diederik P. Kingma, Jimmy Ba · UvA-DARE (University of Amsterdam) · 2014 · 84.8K citations · Full text
Greedy function approximation: A gradient boosting machine.
Jerome H. Friedman · The Annals of Statistics · 2001 · 29K citations · Full text
1–5 of 7.8K
17.1K
27
h-index
27
h-index
24
h-index
22
h-index
22
h-index
1–5 of 17.1K
3.1K
University of California, Berkeley
Berkeley, United States
64 h-index
305 publications
58.8K citations
Massachusetts Institute of Technology
Cambridge, United States
59 h-index
266 publications
31.9K citations
Google (United States)
Mountain View, United States
57 h-index
337 publications
101.8K citations
Carnegie Mellon University
Pittsburgh, United States
56 h-index
257 publications
34.5K citations
Stanford University
Stanford, United States
53 h-index
235 publications
127K citations
Princeton University
Princeton, United States
50 h-index
196 publications
24.7K citations
Tsinghua University
Beijing, China
42 h-index
295 publications
25.7K citations

Chinese Academy of Sciences
Beijing, China
41 h-index
263 publications
11.2K citations
1–8 of 3.1K
Repository · 1.4K publications · 136.5K citations
138
h-index
91 publications · 18.3K citations
55
h-index
95 publications · 13.8K citations
52
h-index
97 publications · 6.5K citations
45
h-index
Conference · 98 publications · 9.9K citations
44
h-index
1–5