gradient descent

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

Noun[edit]

gradient descent (uncountable)

  1. (mathematics) A first-order iterative optimization algorithm for finding a local minimum of a differentiable function.
    Hyponym: SGD
    • 2019, Sudharsan Ravichandiran, Hands-On Deep Learning Algorithms with Python, Packt Publishing Ltd, →ISBN, page 92:
      Thus, in gradient descent, on each epoch, we perform the parameter update.

Related terms[edit]

Translations[edit]

Further reading[edit]