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

Authors

445

  1. WW
    Wei Wu

    Dalian University of Technology, China

    6 publications · 220 citations

    6

    h-index

  2. LB
    Léon Bottou

    AT&T (United States), United States

    5 publications · 317 citations

    5

    h-index

  3. ZL
    Zhiyuan Li

    Princeton University, United States

    4 publications · 104 citations

    4

    h-index

  4. KL
    Kaifeng Lyu

    Princeton University, United States

    4 publications · 104 citations

    4

    h-index

  5. SA
    Sanjeev Arora

    Princeton University, United States

    4 publications · 104 citations

    4

    h-index

1–5 of 445

Venues

  1. arXiv (Cornell University)

    Repository · 51 publications · 3K citations

    28

    h-index

  2. Neurocomputing

    6 publications · 184 citations

    5

    h-index

  3. Neural Networks

    4 publications · 686 citations

    4

    h-index

  4. IEEE Access

    4 publications · 111 citations

    4

    h-index

  5. Neural Information Processing Systems

    Conference · 3 publications · 345 citations

    3

    h-index

1–5