<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Gradient Descent on SailingDataLakes</title><link>https://sailingdatalakes.com/tags/gradient-descent/</link><description>Recent content in Gradient Descent on SailingDataLakes</description><generator>Hugo -- gohugo.io</generator><language>en</language><lastBuildDate>Sat, 04 Jul 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://sailingdatalakes.com/tags/gradient-descent/index.xml" rel="self" type="application/rss+xml"/><item><title>Gradient Descent</title><link>https://sailingdatalakes.com/posts/gradient-descent/</link><pubDate>Sat, 04 Jul 2026 00:00:00 +0000</pubDate><guid>https://sailingdatalakes.com/posts/gradient-descent/</guid><description>Purpose Link to heading In linear regression, we were able to solve for the optimal parameters directly, in closed form, using ordinary least squares. Most models we care about don&amp;rsquo;t afford us that luxury. Gradient descent is the general purpose optimization algorithm that lets us fit a model&amp;rsquo;s parameters iteratively, whenever we can&amp;rsquo;t (or don&amp;rsquo;t want to) solve for them directly. In this article, we&amp;rsquo;ll cover what gradient descent is, the math and algorithm behind it, and an example implementation, building on the linear regression problem to check our work against a known answer.</description></item></channel></rss>