The mathematical foundations of AI, narrated. Linear algebra, calculus, statistics, and classical machine learning, one bite-size lesson at a time. A focused track from Clawdemy.https://clawdemy.org/enClawdemyThe mathematical foundations of AI, narrated. Linear algebra, calculus, statistics, and classical machine learning, one bite-size lesson at a time. A focused track from Clawdemy.Clawdemyhello@clawdemy.orgfalseepisodichttps://clawdemy.org/lessons/classical-machine-learning/bias-variance-tradeoff/lesson/https://clawdemy.org/lessons/classical-machine-learning/bias-variance-tradeoff/lesson/Lesson 13 of Track 10 (Classical Machine Learning), the opener of Phase 4 (Knowing whether your model is any good). We have casually mentioned overfitting many times; now we make it precise. There are two distinct ways a model can fail to generalize, and they pull in opposite directions. This lesson names them (bias and variance), shows why making one smaller usually makes the other larger, teaches the foundational diagnostic in machine learning (reading training and test error together), and folds in regularization as the standard low-variance dial.Mon, 25 May 2026 00:00:00 GMTClawdemy12:00falseLesson 13 of Track 10 (Classical Machine Learning), the opener of Phase 4 (Knowing whether your model is any good). We have casually mentioned overfitting many times; now we make it precise. There are two distinct ways a model can fail to generalize, and they pull in opposite directions. This lesson names them (bias and variance), shows why making one smaller usually makes the other larger, teaches the foundational diagnostic in machine learning (reading training and test error together), and folds in regularization as the standard low-variance dial.https://clawdemy.org/lessons/classical-machine-learning/classification-metrics/lesson/https://clawdemy.org/lessons/classical-machine-learning/classification-metrics/lesson/Lesson 15 of Track 10 (Classical Machine Learning), closing Phase 4 (Knowing whether your model is any good) and closing the track. Accuracy is the metric beginners reach for first, and on imbalanced data it lies catastrophically. This lesson covers the metrics that tell the truth: the confusion matrix and its derived precision and recall, the threshold tradeoff that connects to the logistic-regression dial from lesson 4, and the ROC curve with its AUC summary. With it, you can read a classifier honestly and pick the right metric for the problem in front of you.Mon, 25 May 2026 00:00:00 GMTClawdemy13:00falseLesson 15 of Track 10 (Classical Machine Learning), closing Phase 4 (Knowing whether your model is any good) and closing the track. Accuracy is the metric beginners reach for first, and on imbalanced data it lies catastrophically. This lesson covers the metrics that tell the truth: the confusion matrix and its derived precision and recall, the threshold tradeoff that connects to the logistic-regression dial from lesson 4, and the ROC curve with its AUC summary. With it, you can read a classifier honestly and pick the right metric for the problem in front of you.https://clawdemy.org/lessons/classical-machine-learning/cross-validation/lesson/https://clawdemy.org/lessons/classical-machine-learning/cross-validation/lesson/Lesson 14 of Track 10 (Classical Machine Learning), in Phase 4 (Knowing whether your model is any good). The previous lesson said the diagnostic is to compare training and test error. That depends on having an HONEST test error. This lesson covers how to get one: the simple train/test split, the three-way split with a validation set for tuning, and k-fold cross-validation, the standard way to get a stable test-error estimate from limited data. It also names the data-leakage traps that quietly turn an honest evaluation into an optimistic lie.Mon, 25 May 2026 00:00:00 GMTClawdemy12:00falseLesson 14 of Track 10 (Classical Machine Learning), in Phase 4 (Knowing whether your model is any good). The previous lesson said the diagnostic is to compare training and test error. That depends on having an HONEST test error. This lesson covers how to get one: the simple train/test split, the three-way split with a validation set for tuning, and k-fold cross-validation, the standard way to get a stable test-error estimate from limited data. It also names the data-leakage traps that quietly turn an honest evaluation into an optimistic lie.https://clawdemy.org/lessons/classical-machine-learning/pca/lesson/https://clawdemy.org/lessons/classical-machine-learning/pca/lesson/Lesson 11 of Track 10 (Classical Machine Learning), in Phase 3 (Finding structure without labels). Clustering grouped unlabeled points. The other great unsupervised job is the opposite: compression. When every data point has dozens or hundreds of features, you need to boil them down to a handful that still capture the signal. PCA does that by finding new axes along which the data varies most. This lesson builds the directions-of-maximum-variance intuition, shows the 2D-to-1D picture, names what a principal component is, and is clear about the linear assumption that the next lesson will work around.Mon, 25 May 2026 00:00:00 GMTClawdemy12:00falseLesson 11 of Track 10 (Classical Machine Learning), in Phase 3 (Finding structure without labels). Clustering grouped unlabeled points. The other great unsupervised job is the opposite: compression. When every data point has dozens or hundreds of features, you need to boil them down to a handful that still capture the signal. PCA does that by finding new axes along which the data varies most. This lesson builds the directions-of-maximum-variance intuition, shows the 2D-to-1D picture, names what a principal component is, and is clear about the linear assumption that the next lesson will work around.https://clawdemy.org/lessons/classical-machine-learning/t-sne/lesson/https://clawdemy.org/lessons/classical-machine-learning/t-sne/lesson/Lesson 12 of Track 10 (Classical Machine Learning), closing Phase 3 (Finding structure without labels). PCA was great at compression but flat: its straight axes can hide curved or clustered structure. t-SNE is built for a different job, producing a 2D picture in which similar high-dimensional points end up near each other so you can see the clusters. The catch is that the picture is deceptive in specific ways. This lesson shows what t-SNE reveals, what it does not, and how to read its plots without over-reading them.Mon, 25 May 2026 00:00:00 GMTClawdemy12:00falseLesson 12 of Track 10 (Classical Machine Learning), closing Phase 3 (Finding structure without labels). PCA was great at compression but flat: its straight axes can hide curved or clustered structure. t-SNE is built for a different job, producing a 2D picture in which similar high-dimensional points end up near each other so you can see the clusters. The catch is that the picture is deceptive in specific ways. This lesson shows what t-SNE reveals, what it does not, and how to read its plots without over-reading them.https://clawdemy.org/lessons/visual-math-calculus/higher-order-derivatives/lesson/https://clawdemy.org/lessons/visual-math-calculus/higher-order-derivatives/lesson/Lesson 12 of Track 8 (Visual Math: Calculus). A derivative is itself a function, so you can differentiate it again. The second derivative f'' measures how the slope is changing, which means acceleration in physics (Newton's F = ma is written in second derivatives) and curvature on a graph (cups upward when f'' > 0, downward when f'' < 0). It powers the second-derivative test that sorts maxima from minima at critical points, gives the oscillation equation f'' = -f that governs springs, sound, and waves, and shows that every derivative of e^x is e^x. In machine learning, the same curvature information drives Newton's method, the Hessian, and loss-landscape analysis.Mon, 25 May 2026 00:00:00 GMTClawdemy10:00falseLesson 12 of Track 8 (Visual Math: Calculus). A derivative is itself a function, so you can differentiate it again. The second derivative f'' measures how the slope is changing, which means acceleration in physics (Newton's F = ma is written in second derivatives) and curvature on a graph (cups upward when f'' > 0, downward when f'' < 0). It powers the second-derivative test that sorts maxima from minima at critical points, gives the oscillation equation f'' = -f that governs springs, sound, and waves, and shows that every derivative of e^x is e^x. In machine learning, the same curvature information drives Newton's method, the Hessian, and loss-landscape analysis.https://clawdemy.org/lessons/visual-math-calculus/taylor-series/lesson/https://clawdemy.org/lessons/visual-math-calculus/taylor-series/lesson/Lesson 13 of Track 8 (Visual Math: Calculus), and the track's finale. Complicated functions like sine and the exponential are hard to compute directly; polynomials are easy. The Taylor series rebuilds any well-behaved function near a point out of its derivatives there. It works the expansion f(x) is approximately f(a) + f'(a)(x-a) + f''(a)/2! (x-a)^2 + ..., shows why the factorials are required (the matching property), builds the clean series for e^x, sin, and cos, reveals the small-angle approximation and L'Hopital as first-order Taylor in disguise, and shows that Newton's method, gradient descent, the neural tangent kernel, and the way hardware computes transcendentals are all Taylor at work. The arc that opened with a circle closes here, with a single polynomial standing in for any function.Mon, 25 May 2026 00:00:00 GMTClawdemy12:00falseLesson 13 of Track 8 (Visual Math: Calculus), and the track's finale. Complicated functions like sine and the exponential are hard to compute directly; polynomials are easy. The Taylor series rebuilds any well-behaved function near a point out of its derivatives there. It works the expansion f(x) is approximately f(a) + f'(a)(x-a) + f''(a)/2! (x-a)^2 + ..., shows why the factorials are required (the matching property), builds the clean series for e^x, sin, and cos, reveals the small-angle approximation and L'Hopital as first-order Taylor in disguise, and shows that Newton's method, gradient descent, the neural tangent kernel, and the way hardware computes transcendentals are all Taylor at work. The arc that opened with a circle closes here, with a single polynomial standing in for any function.https://clawdemy.org/lessons/classical-machine-learning/boosting/lesson/https://clawdemy.org/lessons/classical-machine-learning/boosting/lesson/Lesson 7 of Track 10 (Classical Machine Learning), in Phase 2 (Teaching a machine to decide). A random forest grows many trees independently and averages them. Boosting takes the opposite approach: build trees one at a time, each trained to fix the mistakes the previous ones made. This lesson contrasts boosting's sequential error-correction with the forest's parallel averaging, walks AdaBoost and gradient boosting at the level of intuition, traces the residual-shrinking idea by hand, and explains why gradient-boosted trees dominate tabular data.Sun, 24 May 2026 00:00:00 GMTClawdemy12:00falseLesson 7 of Track 10 (Classical Machine Learning), in Phase 2 (Teaching a machine to decide). A random forest grows many trees independently and averages them. Boosting takes the opposite approach: build trees one at a time, each trained to fix the mistakes the previous ones made. This lesson contrasts boosting's sequential error-correction with the forest's parallel averaging, walks AdaBoost and gradient boosting at the level of intuition, traces the residual-shrinking idea by hand, and explains why gradient-boosted trees dominate tabular data.https://clawdemy.org/lessons/classical-machine-learning/decision-trees/lesson/https://clawdemy.org/lessons/classical-machine-learning/decision-trees/lesson/Lesson 5 of Track 10 (Classical Machine Learning), in Phase 2 (Teaching a machine to decide). Where logistic regression draws one straight boundary, a decision tree asks a sequence of yes/no questions, like a flowchart, funnelling each example to a prediction. This lesson shows how to read and trace a tree, how it is built by choosing the question that best separates the classes, why an unrestrained tree overfits, and why a single tree is powerful but unstable, the flaw random forests fix next.Sun, 24 May 2026 00:00:00 GMTClawdemy11:00falseLesson 5 of Track 10 (Classical Machine Learning), in Phase 2 (Teaching a machine to decide). Where logistic regression draws one straight boundary, a decision tree asks a sequence of yes/no questions, like a flowchart, funnelling each example to a prediction. This lesson shows how to read and trace a tree, how it is built by choosing the question that best separates the classes, why an unrestrained tree overfits, and why a single tree is powerful but unstable, the flaw random forests fix next.https://clawdemy.org/lessons/classical-machine-learning/fitting-a-line-linear-regression/lesson/https://clawdemy.org/lessons/classical-machine-learning/fitting-a-line-linear-regression/lesson/Lesson 2 of Track 10 (Classical Machine Learning), in Phase 1 (What learning from data means). Linear regression is the simplest supervised algorithm and the mental model behind every model that has weights. This lesson defines what 'best-fit line' actually means (the line that minimizes the sum of squared residuals), works the comparison by hand on a tiny dataset, teaches you to read a slope and intercept as a real-world relationship, extends to multiple features, and sets up the question lesson 3 answers: how do you actually find that line?Sun, 24 May 2026 00:00:00 GMTClawdemy12:00falseLesson 2 of Track 10 (Classical Machine Learning), in Phase 1 (What learning from data means). Linear regression is the simplest supervised algorithm and the mental model behind every model that has weights. This lesson defines what 'best-fit line' actually means (the line that minimizes the sum of squared residuals), works the comparison by hand on a tiny dataset, teaches you to read a slope and intercept as a real-world relationship, extends to multiple features, and sets up the question lesson 3 answers: how do you actually find that line?https://clawdemy.org/lessons/classical-machine-learning/hierarchical-clustering/lesson/https://clawdemy.org/lessons/classical-machine-learning/hierarchical-clustering/lesson/Lesson 10 of Track 10 (Classical Machine Learning), in Phase 3 (Finding structure without labels). K-means made you pick the number of clusters up front; hierarchical clustering does not. It builds a whole tree of nested groups, from every point alone up to one big cluster, and lets you read structure at any scale. This lesson shows the bottom-up merging process, how to read a dendrogram, and the key skill of choosing where to cut the tree.Sun, 24 May 2026 00:00:00 GMTClawdemy11:00falseLesson 10 of Track 10 (Classical Machine Learning), in Phase 3 (Finding structure without labels). K-means made you pick the number of clusters up front; hierarchical clustering does not. It builds a whole tree of nested groups, from every point alone up to one big cluster, and lets you read structure at any scale. This lesson shows the bottom-up merging process, how to read a dendrogram, and the key skill of choosing where to cut the tree.https://clawdemy.org/lessons/classical-machine-learning/how-models-learn-gradient-descent/lesson/https://clawdemy.org/lessons/classical-machine-learning/how-models-learn-gradient-descent/lesson/Lesson 3 of Track 10 (Classical Machine Learning), closing Phase 1 (What learning from data means). Lesson 2 defined the best-fit line but not how to find it. Gradient descent is the answer, and it is how nearly every modern model learns. This lesson builds the foggy-hillside intuition, names the gradient and the learning rate, traces the downhill loop by hand on a toy loss, and shows why this one procedure scales from a two-parameter line to a billion-parameter network.Sun, 24 May 2026 00:00:00 GMTClawdemy12:00falseLesson 3 of Track 10 (Classical Machine Learning), closing Phase 1 (What learning from data means). Lesson 2 defined the best-fit line but not how to find it. Gradient descent is the answer, and it is how nearly every modern model learns. This lesson builds the foggy-hillside intuition, names the gradient and the learning rate, traces the downhill loop by hand on a toy loss, and shows why this one procedure scales from a two-parameter line to a billion-parameter network.https://clawdemy.org/lessons/classical-machine-learning/k-means-clustering/lesson/https://clawdemy.org/lessons/classical-machine-learning/k-means-clustering/lesson/Lesson 9 of Track 10 (Classical Machine Learning), the opener of Phase 3 (Finding structure without labels). Every model so far needed labels; clustering drops them. You have data and no answers, and you want the natural groups hiding in it. K-means is the workhorse. This lesson walks the assign-and-update loop by hand, shows how to choose the number of clusters, and is honest about when clustering helps and when it invents groups that are not there.Sun, 24 May 2026 00:00:00 GMTClawdemy12:00falseLesson 9 of Track 10 (Classical Machine Learning), the opener of Phase 3 (Finding structure without labels). Every model so far needed labels; clustering drops them. You have data and no answers, and you want the natural groups hiding in it. K-means is the workhorse. This lesson walks the assign-and-update loop by hand, shows how to choose the number of clusters, and is honest about when clustering helps and when it invents groups that are not there.https://clawdemy.org/lessons/classical-machine-learning/logistic-regression/lesson/https://clawdemy.org/lessons/classical-machine-learning/logistic-regression/lesson/Lesson 4 of Track 10 (Classical Machine Learning), the opener of Phase 2 (Teaching a machine to decide). Many real questions are yes-or-no, and a straight line cannot answer them: it runs past 1 and below 0, where probabilities cannot go. Logistic regression keeps the line's weighted sum and squashes it through an S-shaped curve into a probability. This lesson shows why a line fails, how the sigmoid fixes it, where the decision boundary sits, and how the model is fit by the gradient descent from lesson 3.Sun, 24 May 2026 00:00:00 GMTClawdemy12:00falseLesson 4 of Track 10 (Classical Machine Learning), the opener of Phase 2 (Teaching a machine to decide). Many real questions are yes-or-no, and a straight line cannot answer them: it runs past 1 and below 0, where probabilities cannot go. Logistic regression keeps the line's weighted sum and squashes it through an S-shaped curve into a probability. This lesson shows why a line fails, how the sigmoid fixes it, where the decision boundary sits, and how the model is fit by the gradient descent from lesson 3.https://clawdemy.org/lessons/classical-machine-learning/random-forests/lesson/https://clawdemy.org/lessons/classical-machine-learning/random-forests/lesson/Lesson 6 of Track 10 (Classical Machine Learning), in Phase 2 (Teaching a machine to decide). A single decision tree is unstable and overfits. The random forest fixes that with the wisdom of crowds: grow hundreds of trees, each on a slightly different slice of the data and features, and let them vote. This lesson shows where the diversity comes from (bagging plus random feature subsets), why averaging many overfit trees cancels their noise and lowers variance, and what you trade away to get it.Sun, 24 May 2026 00:00:00 GMTClawdemy12:00falseLesson 6 of Track 10 (Classical Machine Learning), in Phase 2 (Teaching a machine to decide). A single decision tree is unstable and overfits. The random forest fixes that with the wisdom of crowds: grow hundreds of trees, each on a slightly different slice of the data and features, and let them vote. This lesson shows where the diversity comes from (bagging plus random feature subsets), why averaging many overfit trees cancels their noise and lowers variance, and what you trade away to get it.https://clawdemy.org/lessons/classical-machine-learning/support-vector-machines/lesson/https://clawdemy.org/lessons/classical-machine-learning/support-vector-machines/lesson/Lesson 8 of Track 10 (Classical Machine Learning), closing Phase 2 (Teaching a machine to decide). Many lines can separate two classes; the support vector machine picks the one with the widest gap between them, the boundary running down the middle of the widest possible street. This lesson builds the maximum-margin idea, explains support vectors and the soft margin, and unpacks the kernel trick that lets a straight-boundary method carve curved boundaries by lifting the data into a higher dimension.Sun, 24 May 2026 00:00:00 GMTClawdemy12:00falseLesson 8 of Track 10 (Classical Machine Learning), closing Phase 2 (Teaching a machine to decide). Many lines can separate two classes; the support vector machine picks the one with the widest gap between them, the boundary running down the middle of the widest possible street. This lesson builds the maximum-margin idea, explains support vectors and the soft margin, and unpacks the kernel trick that lets a straight-boundary method carve curved boundaries by lifting the data into a higher dimension.https://clawdemy.org/lessons/classical-machine-learning/what-machine-learning-actually-is/lesson/https://clawdemy.org/lessons/classical-machine-learning/what-machine-learning-actually-is/lesson/Lesson 1 of Track 10 (Classical Machine Learning), the opener of Phase 1 (What learning from data means). Machine learning flips traditional programming: instead of writing the rules, you hand the machine labeled examples and let it infer the rules itself. This lesson draws that line, splits the field into supervised learning (labeled, predicting numbers or categories) and unsupervised learning (unlabeled, finding structure), names when machine learning is the wrong tool, and lands the rule that governs the whole track: a model is only as good as it does on data it has never seen.Sun, 24 May 2026 00:00:00 GMTClawdemy10:00falseLesson 1 of Track 10 (Classical Machine Learning), the opener of Phase 1 (What learning from data means). Machine learning flips traditional programming: instead of writing the rules, you hand the machine labeled examples and let it infer the rules itself. This lesson draws that line, splits the field into supervised learning (labeled, predicting numbers or categories) and unsupervised learning (unlabeled, finding structure), names when machine learning is the wrong tool, and lands the rule that governs the whole track: a model is only as good as it does on data it has never seen.https://clawdemy.org/lessons/statistics-and-probability/bayes-theorem/lesson/https://clawdemy.org/lessons/statistics-and-probability/bayes-theorem/lesson/Lesson 7 of Track 9 and the close of Phase 2. Bayes' theorem converts the chance of A given B into the chance of B given A, and it is the mathematics of updating a belief when evidence arrives. This lesson builds Bayes from natural frequencies, re-derives lesson 1's base-rate result exactly (a 99%-accurate test that is still 50% right on a positive), shows how a second test updates again to 99%, and connects it to spam filters, base-rate neglect, and combining a prior with new data.Sun, 24 May 2026 00:00:00 GMTClawdemy12:00falseLesson 7 of Track 9 and the close of Phase 2. Bayes' theorem converts the chance of A given B into the chance of B given A, and it is the mathematics of updating a belief when evidence arrives. This lesson builds Bayes from natural frequencies, re-derives lesson 1's base-rate result exactly (a 99%-accurate test that is still 50% right on a positive), shows how a second test updates again to 99%, and connects it to spam filters, base-rate neglect, and combining a prior with new data.https://clawdemy.org/lessons/statistics-and-probability/conditional-probability-and-independence/lesson/https://clawdemy.org/lessons/statistics-and-probability/conditional-probability-and-independence/lesson/Lesson 6 of Track 9. The multiplication rule needed independence, but the events that matter in AI are dependent. This lesson defines conditional probability (the chance of A given B), reads it off a two-way table, generalizes the multiplication rule to dependent events, redefines independence in those terms, and hammers the subject's costliest confusion: the chance of A given B is not the chance of B given A. It sets up Bayes' theorem in the next lesson.Sun, 24 May 2026 00:00:00 GMTClawdemy12:00falseLesson 6 of Track 9. The multiplication rule needed independence, but the events that matter in AI are dependent. This lesson defines conditional probability (the chance of A given B), reads it off a two-way table, generalizes the multiplication rule to dependent events, redefines independence in those terms, and hammers the subject's costliest confusion: the chance of A given B is not the chance of B given A. It sets up Bayes' theorem in the next lesson.https://clawdemy.org/lessons/statistics-and-probability/confidence-intervals/lesson/https://clawdemy.org/lessons/statistics-and-probability/confidence-intervals/lesson/Lesson 12 of Track 9. A single measured number hides its uncertainty; a confidence interval shows it, turning '90% accurate' into '90%, give or take 4 points.' This lesson builds the interval as estimate plus or minus a margin of error (about two standard errors for 95%), shows how data and confidence trade off against width, and corrects the interpretation almost everyone gets wrong: a 95% interval is not a 95% probability that the truth is in this particular range.Sun, 24 May 2026 00:00:00 GMTClawdemy12:00falseLesson 12 of Track 9. A single measured number hides its uncertainty; a confidence interval shows it, turning '90% accurate' into '90%, give or take 4 points.' This lesson builds the interval as estimate plus or minus a margin of error (about two standard errors for 95%), shows how data and confidence trade off against width, and corrects the interpretation almost everyone gets wrong: a 95% interval is not a 95% probability that the truth is in this particular range.https://clawdemy.org/lessons/statistics-and-probability/hypothesis-testing-and-p-values/lesson/https://clawdemy.org/lessons/statistics-and-probability/hypothesis-testing-and-p-values/lesson/Lesson 13 of Track 9. Confidence intervals hinted a difference might be noise; hypothesis testing makes the call. This lesson sets up the null and alternative, explains the logic of assuming the null and measuring how surprising the data is, defines the p-value carefully, and dismantles the misreadings that make it the most abused number in science: it is not the probability the null is true, significant is not important, and failing to reject is not proof.Sun, 24 May 2026 00:00:00 GMTClawdemy13:00falseLesson 13 of Track 9. Confidence intervals hinted a difference might be noise; hypothesis testing makes the call. This lesson sets up the null and alternative, explains the logic of assuming the null and measuring how surprising the data is, defines the p-value carefully, and dismantles the misreadings that make it the most abused number in science: it is not the probability the null is true, significant is not important, and failing to reject is not proof.https://clawdemy.org/lessons/statistics-and-probability/probability-foundations/lesson/https://clawdemy.org/lessons/statistics-and-probability/probability-foundations/lesson/Lesson 5 of Track 9 and the opener of Phase 2. A probability is a number from 0 to 1, and combining probabilities takes just three rules: the complement (and the at-least-one shortcut), the addition rule for OR (subtract the overlap), and the multiplication rule for independent ANDs. This lesson works each on dice, coins, and cards, flags that multiplication needs independence, and connects the rules to pipeline reliability and how a language model scores a sentence.Sun, 24 May 2026 00:00:00 GMTClawdemy12:00falseLesson 5 of Track 9 and the opener of Phase 2. A probability is a number from 0 to 1, and combining probabilities takes just three rules: the complement (and the at-least-one shortcut), the addition rule for OR (subtract the overlap), and the multiplication rule for independent ANDs. This lesson works each on dice, coins, and cards, flags that multiplication needs independence, and connects the rules to pipeline reliability and how a language model scores a sentence.https://clawdemy.org/lessons/statistics-and-probability/random-variables-and-expected-value/lesson/https://clawdemy.org/lessons/statistics-and-probability/random-variables-and-expected-value/lesson/Lesson 8 of Track 9 and the opener of Phase 3. A random variable is a number whose value comes from chance (a payoff, a count, a loss), and its expected value is the long-run average it settles toward. This lesson defines random variables and their distributions, computes expected value and variance by hand, and shows why expected value is the backbone of machine-learning objectives: the thing a loss function minimizes and a reward an agent maximizes.Sun, 24 May 2026 00:00:00 GMTClawdemy12:00falseLesson 8 of Track 9 and the opener of Phase 3. A random variable is a number whose value comes from chance (a payoff, a count, a loss), and its expected value is the long-run average it settles toward. This lesson defines random variables and their distributions, computes expected value and variance by hand, and shows why expected value is the backbone of machine-learning objectives: the thing a loss function minimizes and a reward an agent maximizes.https://clawdemy.org/lessons/statistics-and-probability/sampling-and-the-central-limit-theorem/lesson/https://clawdemy.org/lessons/statistics-and-probability/sampling-and-the-central-limit-theorem/lesson/Lesson 11 of Track 9 and the opener of Phase 4. Every number measured on a sample is an estimate that varies from sample to sample. This lesson separates a sample statistic from the population parameter it estimates, introduces the standard error (sigma over root n) and the square-root law behind 'more data helps,' and states the central limit theorem, the reason sample means are normal no matter the data's shape, which makes the rest of inference possible.Sun, 24 May 2026 00:00:00 GMTClawdemy12:00falseLesson 11 of Track 9 and the opener of Phase 4. Every number measured on a sample is an estimate that varies from sample to sample. This lesson separates a sample statistic from the population parameter it estimates, introduces the standard error (sigma over root n) and the square-root law behind 'more data helps,' and states the central limit theorem, the reason sample means are normal no matter the data's shape, which makes the rest of inference possible.https://clawdemy.org/lessons/statistics-and-probability/statistics-in-machine-learning/lesson/https://clawdemy.org/lessons/statistics-and-probability/statistics-in-machine-learning/lesson/Lesson 14 of Track 9, the capstone. It walks every tool from the track into a real machine-learning workflow: describing data, reading model outputs as conditional probabilities, expected value as the training objective, and the heart of it, evaluation as inference (a test set is a sample, a metric is an estimate with a confidence interval, comparing models is a hypothesis test). It draws a clean boundary to the Classical ML track for the model-scoring toolkit and closes on the through-line: statistics is the discipline of not fooling yourself about uncertainty.Sun, 24 May 2026 00:00:00 GMTClawdemy12:00falseLesson 14 of Track 9, the capstone. It walks every tool from the track into a real machine-learning workflow: describing data, reading model outputs as conditional probabilities, expected value as the training objective, and the heart of it, evaluation as inference (a test set is a sample, a metric is an estimate with a confidence interval, comparing models is a hypothesis test). It draws a clean boundary to the Classical ML track for the model-scoring toolkit and closes on the through-line: statistics is the discipline of not fooling yourself about uncertainty.https://clawdemy.org/lessons/statistics-and-probability/summarizing-data-center-and-spread/lesson/https://clawdemy.org/lessons/statistics-and-probability/summarizing-data-center-and-spread/lesson/Lesson 2 of Track 9. Before any model learns, someone summarizes the data, and the summary can mislead. This lesson covers the two questions every summary answers (where is the center, how spread out is it), the mean-versus-median tradeoff under skew, how to compute variance and standard deviation by hand, and why standardizing features by their mean and standard deviation is one of machine learning's most common first steps.Sun, 24 May 2026 00:00:00 GMTClawdemy11:00falseLesson 2 of Track 9. Before any model learns, someone summarizes the data, and the summary can mislead. This lesson covers the two questions every summary answers (where is the center, how spread out is it), the mean-versus-median tradeoff under skew, how to compute variance and standard deviation by hand, and why standardizing features by their mean and standard deviation is one of machine learning's most common first steps.https://clawdemy.org/lessons/statistics-and-probability/the-binomial-distribution/lesson/https://clawdemy.org/lessons/statistics-and-probability/the-binomial-distribution/lesson/Lesson 10 of Track 9 and the close of Phase 3. When you count successes in a fixed number of independent yes-or-no trials, the binomial distribution gives the probabilities. This lesson lays out the four conditions, builds the exactly-k probability formula, works it on coins and a model's accuracy, gives the n-times-p expected-count shortcut, separates exactly-k from at-least-k, and connects it to accuracy as a binomial count.Sun, 24 May 2026 00:00:00 GMTClawdemy12:00falseLesson 10 of Track 9 and the close of Phase 3. When you count successes in a fixed number of independent yes-or-no trials, the binomial distribution gives the probabilities. This lesson lays out the four conditions, builds the exactly-k probability formula, works it on coins and a model's accuracy, gives the n-times-p expected-count shortcut, separates exactly-k from at-least-k, and connects it to accuracy as a binomial count.https://clawdemy.org/lessons/statistics-and-probability/the-normal-distribution/lesson/https://clawdemy.org/lessons/statistics-and-probability/the-normal-distribution/lesson/Lesson 9 of Track 9. The bell curve named in the histogram lesson gets made precise. This lesson explains how a continuous distribution carries probability as area under a curve, defines the normal by its mean and standard deviation, gives the 68-95-99.7 rule, formalizes the z-score as the standardization met earlier, and connects the normal to AI: feature standardization, the default model of noise, and outlier detection.Sun, 24 May 2026 00:00:00 GMTClawdemy12:00falseLesson 9 of Track 9. The bell curve named in the histogram lesson gets made precise. This lesson explains how a continuous distribution carries probability as area under a curve, defines the normal by its mean and standard deviation, gives the 68-95-99.7 rule, formalizes the z-score as the standardization met earlier, and connects the normal to AI: feature standardization, the default model of noise, and outlier detection.https://clawdemy.org/lessons/statistics-and-probability/the-shape-of-data-distributions-and-histograms/lesson/https://clawdemy.org/lessons/statistics-and-probability/the-shape-of-data-distributions-and-histograms/lesson/Lesson 3 of Track 9. A center and spread summarize data, but a histogram shows its shape, and shape carries information no single number can. This lesson builds the histogram, names the shapes (symmetric, skewed, uniform, bimodal, bell), reconnects skew to the mean-versus-median gap, and shows why inspecting a feature's distribution before modeling catches outliers, hidden subpopulations, and class imbalance that summary numbers miss.Sun, 24 May 2026 00:00:00 GMTClawdemy11:00falseLesson 3 of Track 9. A center and spread summarize data, but a histogram shows its shape, and shape carries information no single number can. This lesson builds the histogram, names the shapes (symmetric, skewed, uniform, bimodal, bell), reconnects skew to the mean-versus-median gap, and shows why inspecting a feature's distribution before modeling catches outliers, hidden subpopulations, and class imbalance that summary numbers miss.https://clawdemy.org/lessons/statistics-and-probability/when-two-things-move-together-correlation/lesson/https://clawdemy.org/lessons/statistics-and-probability/when-two-things-move-together-correlation/lesson/Lesson 4 of Track 9 and the close of Phase 1. Correlation measures how tightly two quantities move together; this lesson reads the scatterplot, interprets the correlation coefficient between -1 and +1, warns that it sees only straight lines, and spends real time on the most misused idea in data analysis: correlation is not causation. It connects to machine learning (redundant features, spurious signals) and draws a clean line to where prediction proper lives, the Classical Machine Learning track.Sun, 24 May 2026 00:00:00 GMTClawdemy11:00falseLesson 4 of Track 9 and the close of Phase 1. Correlation measures how tightly two quantities move together; this lesson reads the scatterplot, interprets the correlation coefficient between -1 and +1, warns that it sees only straight lines, and spends real time on the most misused idea in data analysis: correlation is not causation. It connects to machine learning (redundant features, spurious signals) and draws a clean line to where prediction proper lives, the Classical Machine Learning track.https://clawdemy.org/lessons/statistics-and-probability/why-ai-runs-on-statistics/lesson/https://clawdemy.org/lessons/statistics-and-probability/why-ai-runs-on-statistics/lesson/The opener of Track 9 (Statistics & Probability for AI). Every AI system speaks in probabilities, not certainties: a spam filter says 98% spam, a model reports 0.91 confidence, a recommender ranks by likelihood. This orientation lesson situates statistics and probability as the language AI uses to reason under uncertainty. It explains why uncertainty is unavoidable, splits the two directions of statistical reasoning (probability forward, statistics backward), maps where each idea in the track shows up inside real systems, and works the base-rate example to show why a 99%-accurate test can be right only half the time.Sun, 24 May 2026 00:00:00 GMTClawdemy10:00falseThe opener of Track 9 (Statistics & Probability for AI). Every AI system speaks in probabilities, not certainties: a spam filter says 98% spam, a model reports 0.91 confidence, a recommender ranks by likelihood. This orientation lesson situates statistics and probability as the language AI uses to reason under uncertainty. It explains why uncertainty is unavoidable, splits the two directions of statistical reasoning (probability forward, statistics backward), maps where each idea in the track shows up inside real systems, and works the base-rate example to show why a 99%-accurate test can be right only half the time.https://clawdemy.org/lessons/visual-math-calculus/chain-rule-visually/lesson/https://clawdemy.org/lessons/visual-math-calculus/chain-rule-visually/lesson/Lesson 6 of Track 8 (Visual Math: Calculus). The product rule handled functions multiplied; the chain rule handles functions nested one inside another, like sin(x^2). It says rates multiply through a composition: d/dx(f(g(x))) = f'(g(x)) * g'(x), the outer derivative (evaluated at the inner function) times the inner derivative. The lesson reads a composition as a pipeline whose stage-rates compound, drills the classic 'evaluated at the inner function' error, works several examples (polynomial, trig-with-power, double nesting, an e preview), and shows that this is the single most-used calculus rule in machine learning because backpropagation is the chain rule applied through a network's layers.Sun, 24 May 2026 00:00:00 GMTClawdemy11:00falseLesson 6 of Track 8 (Visual Math: Calculus). The product rule handled functions multiplied; the chain rule handles functions nested one inside another, like sin(x^2). It says rates multiply through a composition: d/dx(f(g(x))) = f'(g(x)) * g'(x), the outer derivative (evaluated at the inner function) times the inner derivative. The lesson reads a composition as a pipeline whose stage-rates compound, drills the classic 'evaluated at the inner function' error, works several examples (polynomial, trig-with-power, double nesting, an e preview), and shows that this is the single most-used calculus rule in machine learning because backpropagation is the chain rule applied through a network's layers.https://clawdemy.org/lessons/visual-math-calculus/essence-of-calculus/lesson/https://clawdemy.org/lessons/visual-math-calculus/essence-of-calculus/lesson/Lesson 1 of Track 8 (Visual Math: Calculus), and the orientation for the whole track. You know the area of a circle is πR², but almost nobody can say why. Rebuilding it from scratch turns out to contain all of calculus in miniature. This lesson slices the disk into thin rings, unrolls each into a rectangle of area about 2πr·dr, sums them into the area under the line 2πr (a triangle that works out to exactly πR²), and in doing so names the two pillars (rates and accumulation) and the surprising fact that they are inverses, the Fundamental Theorem of Calculus, seen on a circle before any term is defined carefully.Sun, 24 May 2026 00:00:00 GMTClawdemy10:00falseLesson 1 of Track 8 (Visual Math: Calculus), and the orientation for the whole track. You know the area of a circle is πR², but almost nobody can say why. Rebuilding it from scratch turns out to contain all of calculus in miniature. This lesson slices the disk into thin rings, unrolls each into a rectangle of area about 2πr·dr, sums them into the area under the line 2πr (a triangle that works out to exactly πR²), and in doing so names the two pillars (rates and accumulation) and the surprising fact that they are inverses, the Fundamental Theorem of Calculus, seen on a circle before any term is defined carefully.https://clawdemy.org/lessons/visual-math-calculus/implicit-differentiation/lesson/https://clawdemy.org/lessons/visual-math-calculus/implicit-differentiation/lesson/Lesson 8 of Track 8 (Visual Math: Calculus). Every derivative so far assumed you could write y as a clean function of x, but most real relations (like the circle x^2 + y^2 = 25) tie x and y together without untangling. Implicit differentiation finds the slope anyway, and it is just the chain rule applied to a relationship: treat y as a function of x, differentiate both sides, attach a dy/dx to every y term, and solve. The lesson works the circle (dy/dx = -x/y, checked perpendicular to the radius), derives the ln(x) derivative from e^y = x, handles a relation that cannot be untangled, and introduces related rates (the sliding ladder) as the time-based twin.Sun, 24 May 2026 00:00:00 GMTClawdemy11:00falseLesson 8 of Track 8 (Visual Math: Calculus). Every derivative so far assumed you could write y as a clean function of x, but most real relations (like the circle x^2 + y^2 = 25) tie x and y together without untangling. Implicit differentiation finds the slope anyway, and it is just the chain rule applied to a relationship: treat y as a function of x, differentiate both sides, attach a dy/dx to every y term, and solve. The lesson works the circle (dy/dx = -x/y, checked perpendicular to the radius), derives the ln(x) derivative from e^y = x, handles a relation that cannot be untangled, and introduces related rates (the sliding ladder) as the time-based twin.https://clawdemy.org/lessons/visual-math-calculus/integration-and-the-fundamental-theorem/lesson/https://clawdemy.org/lessons/visual-math-calculus/integration-and-the-fundamental-theorem/lesson/Lesson 10 of Track 8 (Visual Math: Calculus), opening Phase 3. The first lesson found a circle's area by slicing it into rings, integration done informally. This lesson makes accumulation precise: it defines the definite integral as a limit of thin rectangles (a Riemann sum) and states the fundamental theorem of calculus, which ties accumulation to differentiation. To add up a quantity over a range, find a function whose rate of change is that quantity (an antiderivative) and subtract its endpoint values: integral from a to b of f = F(b) - F(a). Antiderivatives are the derivative rules run backward, and the lesson closes the circle by computing the integral of 2*pi*r as pi*R^2.Sun, 24 May 2026 00:00:00 GMTClawdemy12:00falseLesson 10 of Track 8 (Visual Math: Calculus), opening Phase 3. The first lesson found a circle's area by slicing it into rings, integration done informally. This lesson makes accumulation precise: it defines the definite integral as a limit of thin rectangles (a Riemann sum) and states the fundamental theorem of calculus, which ties accumulation to differentiation. To add up a quantity over a range, find a function whose rate of change is that quantity (an antiderivative) and subtract its endpoint values: integral from a to b of f = F(b) - F(a). Antiderivatives are the derivative rules run backward, and the lesson closes the circle by computing the integral of 2*pi*r as pi*R^2.https://clawdemy.org/lessons/visual-math-calculus/limits-done-carefully/lesson/https://clawdemy.org/lessons/visual-math-calculus/limits-done-carefully/lesson/Lesson 9 of Track 8 (Visual Math: Calculus), closing Phase 2. Every derivative in this track has secretly been a limit, the value the rise-over-run ratio approaches as the interval shrinks. This lesson examines the limit itself: what 'approaches' really means, made precise by the epsilon-delta idea (for any demanded precision, an input window exists), and how L'Hopital's rule rescues the awkward 0/0 and infinity/infinity forms the rate definition keeps producing. It works several limits (sin x / x = 1, (e^x - 1)/x = 1, a twice-applied case = 1/2, (ln x)/x = 0), shows why the rule works (leading first-order behavior), and bundles three short source chapters into one.Sun, 24 May 2026 00:00:00 GMTClawdemy12:00falseLesson 9 of Track 8 (Visual Math: Calculus), closing Phase 2. Every derivative in this track has secretly been a limit, the value the rise-over-run ratio approaches as the interval shrinks. This lesson examines the limit itself: what 'approaches' really means, made precise by the epsilon-delta idea (for any demanded precision, an input window exists), and how L'Hopital's rule rescues the awkward 0/0 and infinity/infinity forms the rate definition keeps producing. It works several limits (sin x / x = 1, (e^x - 1)/x = 1, a twice-applied case = 1/2, (ln x)/x = 0), shows why the rule works (leading first-order behavior), and bundles three short source chapters into one.https://clawdemy.org/lessons/visual-math-calculus/power-rule-from-geometry/lesson/https://clawdemy.org/lessons/visual-math-calculus/power-rule-from-geometry/lesson/Lesson 3 of Track 8 (Visual Math: Calculus). Last lesson computed derivatives by grinding through binomial expansions; the answers (2t for t-squared, 3t-squared for t-cubed) hide a pattern, the power rule. This lesson shows where it comes from by reasoning about growing squares and cubes: nudge the side of a square and you add two strips plus a vanishing corner, nudge a cube and you add three slabs. So d/dt(t^n) = n*t^(n-1), where n counts the faces that grow and t^(n-1) is each face's size. It extends to negative and fractional powers, adds the constant-multiple and sum rules, and turns polynomial differentiation into a quick scan.Sun, 24 May 2026 00:00:00 GMTClawdemy11:00falseLesson 3 of Track 8 (Visual Math: Calculus). Last lesson computed derivatives by grinding through binomial expansions; the answers (2t for t-squared, 3t-squared for t-cubed) hide a pattern, the power rule. This lesson shows where it comes from by reasoning about growing squares and cubes: nudge the side of a square and you add two strips plus a vanishing corner, nudge a cube and you add three slabs. So d/dt(t^n) = n*t^(n-1), where n counts the faces that grow and t^(n-1) is each face's size. It extends to negative and fractional powers, adds the constant-multiple and sum rules, and turns polynomial differentiation into a quick scan.https://clawdemy.org/lessons/visual-math-calculus/product-rule-visually/lesson/https://clawdemy.org/lessons/visual-math-calculus/product-rule-visually/lesson/Lesson 5 of Track 8 (Visual Math: Calculus), opening Phase 2. When two functions are multiplied, the natural guess for the derivative (multiply the derivatives) is wrong. The right answer, the product rule d/dx(f*g) = f'*g + f*g', has two terms, and one picture shows why: let f be a rectangle's width and g its height, so f*g is its area; nudging x adds a top strip and a side strip (the two terms) plus a tiny corner block that vanishes (exactly the wrong f'*g' guess). The lesson works several examples, cross-checks against the power rule, and extends to three or more factors (one term per factor).Sun, 24 May 2026 00:00:00 GMTClawdemy11:00falseLesson 5 of Track 8 (Visual Math: Calculus), opening Phase 2. When two functions are multiplied, the natural guess for the derivative (multiply the derivatives) is wrong. The right answer, the product rule d/dx(f*g) = f'*g + f*g', has two terms, and one picture shows why: let f be a rectangle's width and g its height, so f*g is its area; nudging x adds a top strip and a side strip (the two terms) plus a tiny corner block that vanishes (exactly the wrong f'*g' guess). The lesson works several examples, cross-checks against the power rule, and extends to three or more factors (one term per factor).https://clawdemy.org/lessons/visual-math-calculus/the-derivative-as-a-rate/lesson/https://clawdemy.org/lessons/visual-math-calculus/the-derivative-as-a-rate/lesson/Lesson 2 of Track 8 (Visual Math: Calculus). A derivative is supposed to be the rate of change at a single instant, but over an instant nothing changes, so how can there be a rate? This lesson resolves that paradox with one idea: the derivative is the value the average rate (rise over run) approaches as the measuring interval shrinks to zero. It computes a free-fall velocity and the derivative of t-cubed from scratch, shows the secant line pivoting into the tangent (so 'rate at an instant' becomes 'slope at a point'), and demystifies dy/dx as limit notation rather than a fraction of infinitesimals.Sun, 24 May 2026 00:00:00 GMTClawdemy10:00falseLesson 2 of Track 8 (Visual Math: Calculus). A derivative is supposed to be the rate of change at a single instant, but over an instant nothing changes, so how can there be a rate? This lesson resolves that paradox with one idea: the derivative is the value the average rate (rise over run) approaches as the measuring interval shrinks to zero. It computes a free-fall velocity and the derivative of t-cubed from scratch, shows the secant line pivoting into the tangent (so 'rate at an instant' becomes 'slope at a point'), and demystifies dy/dx as limit notation rather than a fraction of infinitesimals.https://clawdemy.org/lessons/visual-math-calculus/trig-derivatives-from-geometry/lesson/https://clawdemy.org/lessons/visual-math-calculus/trig-derivatives-from-geometry/lesson/Lesson 4 of Track 8 (Visual Math: Calculus). The power rule handled powers of t, but sine and cosine are not powers of anything, so they get their own picture: a point moving around the unit circle at unit speed. From that single image both trig derivatives fall out, d/dx(sin x) = cos x and d/dx(cos x) = -sin x, with the minus on cosine because its coordinate shrinks as the point climbs. The lesson reads the derivatives off the point's velocity (the position rotated a quarter turn), sanity-checks them against the curve shapes, and shows two payoffs: the small-angle approximation sin(x) ≈ x and the f'' = -f equation that makes sine the universal shape of oscillation. Radians are what keep it all free of stray factors.Sun, 24 May 2026 00:00:00 GMTClawdemy11:00falseLesson 4 of Track 8 (Visual Math: Calculus). The power rule handled powers of t, but sine and cosine are not powers of anything, so they get their own picture: a point moving around the unit circle at unit speed. From that single image both trig derivatives fall out, d/dx(sin x) = cos x and d/dx(cos x) = -sin x, with the minus on cosine because its coordinate shrinks as the point climbs. The lesson reads the derivatives off the point's velocity (the position rotated a quarter turn), sanity-checks them against the curve shapes, and shows two payoffs: the small-angle approximation sin(x) ≈ x and the f'' = -f equation that makes sine the universal shape of oscillation. Radians are what keep it all free of stray factors.https://clawdemy.org/lessons/visual-math-calculus/why-area-equals-slope/lesson/https://clawdemy.org/lessons/visual-math-calculus/why-area-equals-slope/lesson/Lesson 11 of Track 8 (Visual Math: Calculus). Last lesson stated the fundamental theorem and showed how to use it; this lesson explains why it is true, with one geometric observation. Define the area function A(x) = integral from a to x of f, the area accumulated up to a moving right end. Extend it by a sliver dx and the new area is a thin rectangle of height f(x), so A(x+dx) - A(x) is about f(x)*dx, and in the limit A'(x) = f(x): the derivative of the area function is the original curve. That single fact is the fundamental theorem, and it shows why integration and differentiation are inverse operations: the slope of an accumulated area is the thing being accumulated.Sun, 24 May 2026 00:00:00 GMTClawdemy11:00falseLesson 11 of Track 8 (Visual Math: Calculus). Last lesson stated the fundamental theorem and showed how to use it; this lesson explains why it is true, with one geometric observation. Define the area function A(x) = integral from a to x of f, the area accumulated up to a moving right end. Extend it by a sliver dx and the new area is a thin rectangle of height f(x), so A(x+dx) - A(x) is about f(x)*dx, and in the limit A'(x) = f(x): the derivative of the area function is the original curve. That single fact is the fundamental theorem, and it shows why integration and differentiation are inverse operations: the slope of an accumulated area is the thing being accumulated.https://clawdemy.org/lessons/visual-math-calculus/why-e-is-special/lesson/https://clawdemy.org/lessons/visual-math-calculus/why-e-is-special/lesson/Lesson 7 of Track 8 (Visual Math: Calculus). Everyone knows e is about 2.718, and almost nobody knows why that number earns its own letter. The answer is not its digits but a behavior: e is the one base for which the exponential is its own derivative, d/dx(e^x) = e^x. This lesson shows that the derivative of any exponential a^x is M(a)*a^x, that the multiplier M(a) crosses 1 between bases 2 and 3 (the crossing point being e), and that combined with the chain rule it gives d/dx(e^(kx)) = k*e^(kx), the solution to 'rate proportional to value'. That single property is why e threads through growth, decay, softmax, and the sigmoid.Sun, 24 May 2026 00:00:00 GMTClawdemy11:00falseLesson 7 of Track 8 (Visual Math: Calculus). Everyone knows e is about 2.718, and almost nobody knows why that number earns its own letter. The answer is not its digits but a behavior: e is the one base for which the exponential is its own derivative, d/dx(e^x) = e^x. This lesson shows that the derivative of any exponential a^x is M(a)*a^x, that the multiplier M(a) crosses 1 between bases 2 and 3 (the crossing point being e), and that combined with the chain rule it gives d/dx(e^(kx)) = k*e^(kx), the solution to 'rate proportional to value'. That single property is why e threads through growth, decay, softmax, and the sigmoid.https://clawdemy.org/lessons/visual-math-linear-algebra/3d-cross-product-via-duality/lesson/https://clawdemy.org/lessons/visual-math-linear-algebra/3d-cross-product-via-duality/lesson/Lesson 11 of Track 4 (Visual Math: Linear Algebra). The 3D cross product has a formula that looks like something you just have to memorize. You do not. This lesson derives it from scratch by combining the duality idea from the dot-product lesson with the determinant-as-volume idea, and the famous criss-cross formula, along with its three geometric properties, falls out on its own.Sun, 24 May 2026 00:00:00 GMTClawdemy12:00falseLesson 11 of Track 4 (Visual Math: Linear Algebra). The 3D cross product has a formula that looks like something you just have to memorize. You do not. This lesson derives it from scratch by combining the duality idea from the dot-product lesson with the determinant-as-volume idea, and the famous criss-cross formula, along with its three geometric properties, falls out on its own.https://clawdemy.org/lessons/visual-math-linear-algebra/3d-transformations/lesson/https://clawdemy.org/lessons/visual-math-linear-algebra/3d-transformations/lesson/Lesson 5 of Track 4 (Visual Math: Linear Algebra), and the close of Phase 1. Everything so far lived on a flat plane. This lesson steps into three dimensions and shows that almost nothing changes: a third basis vector, a third column, one more number per vector, and every rule you already know carries straight over. The same leap takes you to the hundreds of dimensions a real model uses.Sun, 24 May 2026 00:00:00 GMTClawdemy10:00falseLesson 5 of Track 4 (Visual Math: Linear Algebra), and the close of Phase 1. Everything so far lived on a flat plane. This lesson steps into three dimensions and shows that almost nothing changes: a third basis vector, a third column, one more number per vector, and every rule you already know carries straight over. The same leap takes you to the hundreds of dimensions a real model uses.https://clawdemy.org/lessons/visual-math-linear-algebra/abstract-vector-spaces/lesson/https://clawdemy.org/lessons/visual-math-linear-algebra/abstract-vector-spaces/lesson/Lesson 15 of Track 4 (Visual Math: Linear Algebra), the capstone. The very first lesson said a vector is anything you can add and scale coherently, even if it is not an arrow or a list. This final lesson cashes that promise: functions and polynomials are vectors too, the derivative is an honest matrix, and every tool you built across the track works on objects you cannot draw, including the high-dimensional spaces AI actually lives in.Sun, 24 May 2026 00:00:00 GMTClawdemy12:00falseLesson 15 of Track 4 (Visual Math: Linear Algebra), the capstone. The very first lesson said a vector is anything you can add and scale coherently, even if it is not an arrow or a list. This final lesson cashes that promise: functions and polynomials are vectors too, the derivative is an honest matrix, and every tool you built across the track works on objects you cannot draw, including the high-dimensional spaces AI actually lives in.https://clawdemy.org/lessons/visual-math-linear-algebra/change-of-basis/lesson/https://clawdemy.org/lessons/visual-math-linear-algebra/change-of-basis/lesson/Lesson 13 of Track 4 (Visual Math: Linear Algebra). A vector's coordinates are not a fact about the vector; they are a description relative to a basis you happened to choose. This lesson makes that operational: how to translate a vector's coordinates from one basis to another and back, and how the same transformation gets a different matrix in a different basis via the M-inverse-A-M sandwich.Sun, 24 May 2026 00:00:00 GMTClawdemy12:00falseLesson 13 of Track 4 (Visual Math: Linear Algebra). A vector's coordinates are not a fact about the vector; they are a description relative to a basis you happened to choose. This lesson makes that operational: how to translate a vector's coordinates from one basis to another and back, and how the same transformation gets a different matrix in a different basis via the M-inverse-A-M sandwich.https://clawdemy.org/lessons/visual-math-linear-algebra/cramers-rule/lesson/https://clawdemy.org/lessons/visual-math-linear-algebra/cramers-rule/lesson/Lesson 12 of Track 4 (Visual Math: Linear Algebra). Several lessons ago we said the solution to a linear system is the inverse times the target, but never computed it. Cramer's rule is one way to get the answer directly from the matrix entries, and it falls out of one idea you already have: a linear transformation scales every area by its determinant.Sun, 24 May 2026 00:00:00 GMTClawdemy11:00falseLesson 12 of Track 4 (Visual Math: Linear Algebra). Several lessons ago we said the solution to a linear system is the inverse times the target, but never computed it. Cramer's rule is one way to get the answer directly from the matrix entries, and it falls out of one idea you already have: a linear transformation scales every area by its determinant.https://clawdemy.org/lessons/visual-math-linear-algebra/cross-products/lesson/https://clawdemy.org/lessons/visual-math-linear-algebra/cross-products/lesson/Lesson 10 of Track 4 (Visual Math: Linear Algebra), opening Phase 3. The dot product measured how much two vectors line up; the cross product measures how much they spread apart, the area they span, with a sign that records which way they turn. In 2D it is one signed number, and it turns out to be exactly the determinant you already know.Sun, 24 May 2026 00:00:00 GMTClawdemy9:00falseLesson 10 of Track 4 (Visual Math: Linear Algebra), opening Phase 3. The dot product measured how much two vectors line up; the cross product measures how much they spread apart, the area they span, with a sign that records which way they turn. In 2D it is one signed number, and it turns out to be exactly the determinant you already know.https://clawdemy.org/lessons/visual-math-linear-algebra/determinant/lesson/https://clawdemy.org/lessons/visual-math-linear-algebra/determinant/lesson/Lesson 6 of Track 4 (Visual Math: Linear Algebra), opening Phase 2. A linear transformation stretches and squashes space; the determinant is the single number that says by how much, and whether it flips space inside out. This lesson builds that number from the area of the unit square, derives the ad-bc formula, and shows why a zero determinant signals a collapse that cannot be undone.Sun, 24 May 2026 00:00:00 GMTClawdemy10:00falseLesson 6 of Track 4 (Visual Math: Linear Algebra), opening Phase 2. A linear transformation stretches and squashes space; the determinant is the single number that says by how much, and whether it flips space inside out. This lesson builds that number from the area of the unit square, derives the ad-bc formula, and shows why a zero determinant signals a collapse that cannot be undone.https://clawdemy.org/lessons/visual-math-linear-algebra/dot-products/lesson/https://clawdemy.org/lessons/visual-math-linear-algebra/dot-products/lesson/Lesson 9 of Track 4 (Visual Math: Linear Algebra), closing Phase 2. The dot product turns two vectors into a single number, and it has two formulas that look unrelated yet always agree. This lesson computes it both ways, explains why they match (duality), and cashes the promise from the very first lesson about how AI compares vectors in attention, cosine similarity, and inside every neuron.Sun, 24 May 2026 00:00:00 GMTClawdemy11:00falseLesson 9 of Track 4 (Visual Math: Linear Algebra), closing Phase 2. The dot product turns two vectors into a single number, and it has two formulas that look unrelated yet always agree. This lesson computes it both ways, explains why they match (duality), and cashes the promise from the very first lesson about how AI compares vectors in attention, cosine similarity, and inside every neuron.https://clawdemy.org/lessons/visual-math-linear-algebra/eigenvectors-and-eigenvalues/lesson/https://clawdemy.org/lessons/visual-math-linear-algebra/eigenvectors-and-eigenvalues/lesson/Lesson 14 of Track 4 (Visual Math: Linear Algebra). When a transformation moves the plane, most vectors get knocked off their own line. A few stubborn ones stay on their line and only get scaled. Those are eigenvectors, the scaling factor is the eigenvalue, and in the eigenvector basis the transformation becomes a clean diagonal matrix, the simplest it can look.Sun, 24 May 2026 00:00:00 GMTClawdemy13:00falseLesson 14 of Track 4 (Visual Math: Linear Algebra). When a transformation moves the plane, most vectors get knocked off their own line. A few stubborn ones stay on their line and only get scaled. Those are eigenvectors, the scaling factor is the eigenvalue, and in the eigenvector basis the transformation becomes a clean diagonal matrix, the simplest it can look.https://clawdemy.org/lessons/visual-math-linear-algebra/inverses-column-space-null-space/lesson/https://clawdemy.org/lessons/visual-math-linear-algebra/inverses-column-space-null-space/lesson/Lesson 7 of Track 4 (Visual Math: Linear Algebra). Last lesson ended on a warning: when the determinant is zero, information is lost. This lesson makes that precise. It builds the inverse (the undo button), shows it exists only when the determinant is nonzero, and introduces the two ideas that explain exactly what a collapse destroys: column space (everything reachable) and null space (everything crushed to zero).Sun, 24 May 2026 00:00:00 GMTClawdemy11:00falseLesson 7 of Track 4 (Visual Math: Linear Algebra). Last lesson ended on a warning: when the determinant is zero, information is lost. This lesson makes that precise. It builds the inverse (the undo button), shows it exists only when the determinant is nonzero, and introduces the two ideas that explain exactly what a collapse destroys: column space (everything reachable) and null space (everything crushed to zero).https://clawdemy.org/lessons/visual-math-linear-algebra/linear-transformations/lesson/https://clawdemy.org/lessons/visual-math-linear-algebra/linear-transformations/lesson/Lesson 3 of Track 4 (Visual Math: Linear Algebra). A matrix looks like a grid of numbers with no obvious meaning. This lesson shows what it actually is: a record of where the two basis vectors land. That single idea turns matrix-vector multiplication from a rule you memorize into a picture you can sketch, and lets you read what any 2x2 matrix does to space straight off its columns.Sun, 24 May 2026 00:00:00 GMTClawdemy10:00falseLesson 3 of Track 4 (Visual Math: Linear Algebra). A matrix looks like a grid of numbers with no obvious meaning. This lesson shows what it actually is: a record of where the two basis vectors land. That single idea turns matrix-vector multiplication from a rule you memorize into a picture you can sketch, and lets you read what any 2x2 matrix does to space straight off its columns.https://clawdemy.org/lessons/visual-math-linear-algebra/matrix-multiplication/lesson/https://clawdemy.org/lessons/visual-math-linear-algebra/matrix-multiplication/lesson/Lesson 4 of Track 4 (Visual Math: Linear Algebra). Matrix multiplication has a reputation as an arbitrary rows-times-columns rule. It is not arbitrary: multiplying two matrices means doing one transformation, then another. This lesson shows why the product is computed the way it is, why you read it right to left, why order matters (AB is not BA), and why grouping does not.Sun, 24 May 2026 00:00:00 GMTClawdemy10:00falseLesson 4 of Track 4 (Visual Math: Linear Algebra). Matrix multiplication has a reputation as an arbitrary rows-times-columns rule. It is not arbitrary: multiplying two matrices means doing one transformation, then another. This lesson shows why the product is computed the way it is, why you read it right to left, why order matters (AB is not BA), and why grouping does not.https://clawdemy.org/lessons/visual-math-linear-algebra/nonsquare-matrices/lesson/https://clawdemy.org/lessons/visual-math-linear-algebra/nonsquare-matrices/lesson/Lesson 8 of Track 4 (Visual Math: Linear Algebra). Every matrix so far has been square, taking a space back to a space of the same size. Drop that assumption. A rectangular matrix moves between dimensions, embedding a small space into a bigger one or projecting a big space down into a smaller one, and the rules you already know (columns, rank, null space) still tell the whole story.Sun, 24 May 2026 00:00:00 GMTClawdemy10:00falseLesson 8 of Track 4 (Visual Math: Linear Algebra). Every matrix so far has been square, taking a space back to a space of the same size. Drop that assumption. A rectangular matrix moves between dimensions, embedding a small space into a bigger one or projecting a big space down into a smaller one, and the rules you already know (columns, rank, null space) still tell the whole story.https://clawdemy.org/lessons/visual-math-linear-algebra/spans-and-basis/lesson/https://clawdemy.org/lessons/visual-math-linear-algebra/spans-and-basis/lesson/Lesson 2 of Track 4 (Visual Math: Linear Algebra). Give yourself a couple of vectors and the only two operations you know, adding and scaling, and ask which points you can reach. The answer is the span, and it leads straight to a basis (the smallest set that reaches everything), to linear independence, and to what the dimension of a space really means.Sun, 24 May 2026 00:00:00 GMTClawdemy9:00falseLesson 2 of Track 4 (Visual Math: Linear Algebra). Give yourself a couple of vectors and the only two operations you know, adding and scaling, and ask which points you can reach. The answer is the span, and it leads straight to a basis (the smallest set that reaches everything), to linear independence, and to what the dimension of a space really means.https://clawdemy.org/lessons/visual-math-linear-algebra/what-vectors-actually-are/lesson/https://clawdemy.org/lessons/visual-math-linear-algebra/what-vectors-actually-are/lesson/The opener of Track 4 (Visual Math: Linear Algebra). The word vector means an arrow in physics, a list of numbers in code, and an abstract object in a math textbook, and this lesson shows they are one object seen from three angles. It connects the arrow and the list through a coordinate system, pins down the two operations (addition and scaling) that actually define a vector, and shows why this single idea is the atom that everything later in AI math is built from.Sun, 24 May 2026 00:00:00 GMTClawdemy10:00falseThe opener of Track 4 (Visual Math: Linear Algebra). The word vector means an arrow in physics, a list of numbers in code, and an abstract object in a math textbook, and this lesson shows they are one object seen from three angles. It connects the arrow and the list through a coordinate system, pins down the two operations (addition and scaling) that actually define a vector, and shows why this single idea is the atom that everything later in AI math is built from.