Batch Gradient Descent
Batch Gradient Descent is a gradient-based optimization algorithm that, as a member of the family of first-order iterative optimization methods, computes the gradient of the objective function with respect to the model parameters using the entire training dataset at each iteration, thereby distinguishing itself from stochastic and mini-batch variants by its full-batch gradient computation.
165
Publications
10.7K
Citations
445
Authors
198
Institutions
Publications per year
2017–2026
105
Variants
Vanilla Gradient Descent
Parents
165
Efficient projections onto the<i>l</i><sub>1</sub>-ball for learning in high dimensions
John C. Duchi, Shai Shalev‐Shwartz, Yoram Singer et al. · 2008 · 1.2K citations
Efficient Online and Batch Learning Using Forward Backward Splitting
John C. Duchi, Yoram Singer · 2009 · 507 citations
A Proof of Local Convergence for the Adam Optimizer
Sebastian Bock, Martin Weis · 2019 · 325 citations
1–5 of 165
445
6
h-index
5
h-index
4
h-index
4
h-index
4
h-index
1–5 of 445
198
Dalian University of Technology
Dalian, China
9 h-index
24 publications
890 citations
Carnegie Mellon University
Pittsburgh, United States
8 h-index
18 publications
1.3K citations
Google (United States)
Mountain View, United States
5 h-index
8 publications
4.4K citations

Sun Yat-sen University
Guangzhou, China
5 h-index
6 publications
100 citations
Tsinghua University
Beijing, China
4 h-index
4 publications
307 citations
Stanford University
Stanford, United States
4 h-index
5 publications
231 citations
Princeton University
Princeton, United States
4 h-index
6 publications
129 citations

Dalian Maritime University
Dalian, China
4 h-index
7 publications
160 citations
1–8 of 198
Repository · 51 publications · 3K citations
28
h-index
6 publications · 184 citations
5
h-index
4 publications · 686 citations
4
h-index
4 publications · 111 citations
4
h-index
Conference · 3 publications · 345 citations
3
h-index
1–5