Domain routeChecking saved investigationReading browser-local route memory before showing a continuation.

Domain Neighborhood

Probability

Uncertainty made precise: events, random variables, expectations, and the distributions that models learn.

6 concepts6 published6 demos
Selected domain objectProbability Basics

Start here. Predict once, then carry the invariant forward.

Xp(x)E[·]uncertainty
Open first notebook
QuestionWhich invariant should survive into Random Variables?
PredictionBefore the first demo, predict which variable moves first.
Evidence6 demo witnesses in this domain
InvariantName the mechanism before continuing the route.
Learner lensWhat makes this domain feel navigable?

Stabilize the first mechanism, make one prediction, then move one node forward.

Take this lens

Recommended Route

This sequence is ordered for learning rather than inventory. Published notebooks with an unavailable prerequisite—or a same-domain route step that depends on one—are labeled in the full inventory instead of being presented as ready steps.

  1. 01
    Probability Basics

    Events are subsets of a sample space, and probabilities obey a few axioms; from there you get conditional probability, independence, and Bayes' rule.

    12 mincodedemoentry point

    Entry point: build the first mental model here.

  2. 02
    Random Variables

    A random variable is a function from outcomes to numbers; its distribution lets you compute expectations, variances, and likelihoods.

    14 mincodedemoafter Probability Basics

    Why this follows: Random Variables uses Probability Basics directly.

  3. 03
    Distributions

    A distribution is the law of a random variable: it says how probability mass or density lands on the values the variable can take.

    15 mincodedemoafter Random Variables

    Why this follows: Distributions uses Random Variables directly.

  4. 04
    Maximum Likelihood

    Maximum likelihood fits parameters by making the observed data most probable; for classifiers it becomes negative log-likelihood, cross-entropy, and a KL fit to the empirical distribution.

    18 mincodedemoafter Distributions, Derivatives

    Why this follows: Maximum Likelihood uses Distributions directly.

  5. 05
    Cross-Entropy

    Cross-entropy is the target-weighted surprise of a model distribution; in deep learning it is the bridge from likelihood to a differentiable training loss.

    16 mincodedemoafter Maximum Likelihood

    Why this follows: Cross-Entropy uses Maximum Likelihood directly.

  6. 06
    Bayesian Inference

    Bayesian inference updates a prior distribution over unknowns into a posterior by multiplying by the likelihood and normalizing.

    17 mincodedemoafter Distributions, Maximum Likelihood

    Why this follows: both pages keep the probability thread active.

All Published Notebooks

Browse the territory.