Gradient descent
Gradient descent 23 languages Article Talk Read Edit View history From Wikipedia, the free encyclopedia For the analytical method called "steepest descent", see Method of steepest descent . Part of a series on Machine learning and data mining show Paradigms show Problems show Supervised learning ( classification • regression ) show Clustering show Dimensionality reduction show Structured prediction show Anomaly detection show Artificial neural network show Reinforcement learning show Learning with humans show Model diagnostics show Theory show Machine-learning venues show Related articles v t e 0:14 Gradient Descent in 2D In mathematics, gradient descent (also often called steepest descent ) is a first-order iterative optimization algorithm for finding a local minimum of a differentiable function . The idea is to take repeated steps in the opposite direction of the gradient (or approximate gradient) of the function at the current point, because this is t