<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>ML Walkthrough on SailingDataLakes</title><link>https://sailingdatalakes.com/series/ml-walkthrough/</link><description>Recent content in ML Walkthrough 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/series/ml-walkthrough/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><item><title>Root-Finding: Newton, Halley, and Secant Methods</title><link>https://sailingdatalakes.com/posts/root-finding/</link><pubDate>Sat, 04 Jul 2026 00:00:00 +0000</pubDate><guid>https://sailingdatalakes.com/posts/root-finding/</guid><description>Purpose Link to heading We&amp;rsquo;ve now solved for model parameters directly, with linear regression&amp;rsquo;s closed-form OLS solution, and iteratively, with gradient descent. Both problems boiled down to finding where a derivative equals zero. The more general version of that problem — finding where some function $f$ itself equals zero, with no derivative in sight — shows up everywhere: pricing a bond to match a target yield, finding the break-even point of a nonlinear cost curve, or solving an equilibrium condition that has no closed form.</description></item><item><title>Auto Regression</title><link>https://sailingdatalakes.com/posts/auto-regression/</link><pubDate>Fri, 03 Jul 2026 00:00:00 +0000</pubDate><guid>https://sailingdatalakes.com/posts/auto-regression/</guid><description>Purpose Link to heading In this article we&amp;rsquo;re covering Auto Regression (AR) - one of the foundational models used for time series forecasting. We&amp;rsquo;ll build up an intuition for what makes it different from the regression models we&amp;rsquo;ve covered previously, walk through the underlying math, and then implement it from scratch, keeping the code as close to the math as possible. We&amp;rsquo;ll wrap up by fitting our implementation to a real (and famous) dataset: the Wolf sunspot numbers.</description></item><item><title>Logistic Regression</title><link>https://sailingdatalakes.com/posts/logistic-regression/</link><pubDate>Fri, 17 May 2024 00:00:00 +0000</pubDate><guid>https://sailingdatalakes.com/posts/logistic-regression/</guid><description>Purpose Link to heading The goal of this post is to better understand logistic regression. As usual, we&amp;rsquo;ll walk through the intuition, the math, some code, metrics, and finally an example.
What is Logistic Regression Link to heading Like linear regression, logistic regression is also a linear model, and also like linear regression, it is used for making real value predictions. So where does the logistic piece come in, and how is it a classifier?</description></item><item><title>Regularized Linear Regression</title><link>https://sailingdatalakes.com/posts/regularization/</link><pubDate>Fri, 10 May 2024 00:00:00 +0000</pubDate><guid>https://sailingdatalakes.com/posts/regularization/</guid><description>Purpose Link to heading The goal of this article is first to develop an understanding of overfitting and regularization. After which, we will discuss the intuition, math, and code of the two primary methods of regularizing linear regression; ridge regression, and LASSO regression.
Overfitting Link to heading Overfitting usually occurs when a model is overly complex for a given problem or given dataset, and thus able to memorize the training set.</description></item><item><title>K-Means Clustering &amp; Variants</title><link>https://sailingdatalakes.com/posts/k-means/</link><pubDate>Mon, 22 Apr 2024 00:00:00 +0000</pubDate><guid>https://sailingdatalakes.com/posts/k-means/</guid><description>Purpose Link to heading Today we&amp;rsquo;re reviewing K-Means clustering and the many variants. Clustering is a form of unsupervised learning, that is quite intuitive and useful (in certain circumstances).
What is Cluster Analysis? Link to heading First, cluster analysis is a set of methodologies that are utilized to group data by similarity. This can be utilized as a standalone unsupervised model, as an analytical tool, or as form of feature reduction.</description></item><item><title>Linear Regression</title><link>https://sailingdatalakes.com/posts/linear-regression/</link><pubDate>Tue, 12 Mar 2024 00:00:00 +0000</pubDate><guid>https://sailingdatalakes.com/posts/linear-regression/</guid><description>Purpose Link to heading In this article, we will cover what linear regression is, what the underlying mathematics looks like, common metrics to evaluate the model, along with an example of how to use it.
What is Linear Regression Link to heading Linear regression, as the name implies, is a linear model used for making real value predictions. It is a comparatively simple model, that is mathematically sound, easy to explain, and easy to understand.</description></item></channel></rss>