Domain Neighborhood

Machine Learning

The classical supervised-learning spine: models, losses, generalization, evaluation, and the experiment habits that make modern AI results trustworthy.

9 concepts9 published9 demos

Recommended Route

This sequence is ordered for learning rather than inventory: lower difficulty, fewer prerequisites, and more central concepts come first.

  1. 01
    Linear Regression & Least Squares

    Linear regression fits a line or hyperplane by making residuals as small as possible in squared-error geometry.

    16 mincodedemoafter Dot Product, Derivatives

    Check Dot Product first if the symbols feel slippery.

  2. 02
    Bias-Variance Decomposition

    Bias-variance decomposition separates generalization error into target mismatch, training-set instability, and irreducible noise.

    19 mincodedemoafter Linear Regression & Least Squares

    Why this follows: Bias-Variance Decomposition uses Linear Regression & Least Squares directly.

  3. 03
    Classification Metrics, Thresholds, and Calibration

    Classification metrics turn scores into decisions, expose threshold tradeoffs, and check whether probabilities mean what they claim.

    19 mincodedemoafter Logistic Regression, Train/Dev/Test Splits, Cross-Validation, and Leakage

    Why this follows: both pages keep the machine learning thread active.

  4. 04
    Multinomial Logistic Regression

    Softmax regression turns one score per class into a normalized probability distribution and learns by moving probability mass toward the observed class.

    18 mincodedemoafter Logistic Regression, Cross-Entropy

    Why this follows: both pages keep the machine learning / classification thread active.

  5. 05
    PCA as Optimization and Eigenspace Projection

    PCA turns a centered data cloud into orthonormal directions that keep variance and minimize squared reconstruction error.

    20 mincodedemoafter Matrix Decompositions: Eigendecomposition, SVD, and Spectral Structure, Orthogonality, Projections, and Least-Squares Geometry

    Why this follows: both pages keep the machine learning thread active.

  6. 06
    Train/Dev/Test Splits, Cross-Validation, and Leakage

    Train/dev/test splits and cross-validation keep learning, choosing, and final evaluation separate; leakage breaks that contract.

    18 mincodedemoafter Bias-Variance Decomposition, Linear Regression & Least Squares

    Why this follows: both pages keep the machine learning thread active.

  7. 07
    Logistic Regression

    Logistic regression turns a linear score into a probability, then learns a classification boundary by Bernoulli likelihood.

    17 mincodedemoafter Linear Regression & Least Squares, Maximum Likelihood, Cross-Entropy

    Why this follows: both pages keep the machine learning thread active.

All Published Notebooks

Browse the territory.

Linear Regression & Least Squares

Linear regression fits a line or hyperplane by making residuals as small as possible in squared-error geometry.

Level 216 mindemo

Bias-Variance Decomposition

Bias-variance decomposition separates generalization error into target mismatch, training-set instability, and irreducible noise.

Level 319 mindemo

Classification Metrics, Thresholds, and Calibration

Classification metrics turn scores into decisions, expose threshold tradeoffs, and check whether probabilities mean what they claim.

Level 319 mindemo

Multinomial Logistic Regression

Softmax regression turns one score per class into a normalized probability distribution and learns by moving probability mass toward the observed class.

Level 318 mindemo

PCA as Optimization and Eigenspace Projection

PCA turns a centered data cloud into orthonormal directions that keep variance and minimize squared reconstruction error.

Level 320 mindemo

Train/Dev/Test Splits, Cross-Validation, and Leakage

Train/dev/test splits and cross-validation keep learning, choosing, and final evaluation separate; leakage breaks that contract.

Level 318 mindemo

Logistic Regression

Logistic regression turns a linear score into a probability, then learns a classification boundary by Bernoulli likelihood.

Level 317 mindemo

Model Selection and Hyperparameter Search

Model selection turns many candidate settings into one chosen procedure; dev/CV may choose, while test stays untouched for final evidence.

Level 320 mindemo

Regularization: Ridge, Lasso, and Elastic Net

Ridge, lasso, and elastic net add shape to coefficient space so models trade training fit for shrinkage, sparsity, and more stable validation behavior.

Level 320 mindemo