https://halfrost.me/categories/machine-learning/MACHINE LEARNINGHugoBlox Kit (https://hugoblox.com)en-usSun, 21 Oct 2018 10:05:36 +0000https://halfrost.me/media/favicon_hu_4db6119fa52e8e17.pnghttps://halfrost.me/categories/machine-learning/https://halfrost.me/post/how-to-understand-gradient-descent/Sun, 21 Oct 2018 10:05:36 +0000https://halfrost.me/post/how-to-understand-gradient-descent/<p>Gradient descent is a first-order iterative optimization algorithm for finding a local minimum of a differentiable function. To find a local minimum of a function using gradient descent, we take steps proportional to the negative of the gradient (or approximate gradient) of the function at the current point. But if we instead take steps proportional to the positive of the gradient, we approach a local maximum of that function; the procedure is then known as gradient ascent. Gradient descent is generally attributed to Cauchy, who first suggested it in 1847, but its convergence properties for non-linear optimization problems were first studied by Haskell Curry in 1944.</p> <p>Click to read full article.</p>