Gradient descent
id:
gradient-descent-181-3946488
title:
Gradient descent
text:
Gradient descent is a method for unconstrained mathematical optimization. It is a first-order iterative algorithm for minimizing a differentiable multivariate function. The idea is to take repeated steps in the opposite direction of the gradient of the function at the current point, because this is the direction of steepest descent. Conversely, stepping in the direction of the gradient will lead to a trajectory that maximizes that function; the procedure is then known as gradient ascent.
It is p
brand slug:
wiki
category slug:
encyclopedia
description:
Optimization algorithm
original url:
https://en.wikipedia.org/wiki/Gradient_descent
date created:
2003-03-26T01:29:07Z
date modified:
2024-09-05T17:36:51Z
main entity:
{"identifier":"Q1199743","url":"https://www.wikidata.org/entity/Q1199743"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/4/4c/Gradient_Descent_in_2D.webm","width":720,"height":720}
fields total:
13
integrity:
16