7 routes42 sections324 units

stage 02 · Foundational

Mathematical Foundations

The mathematical language needed to understand, implement and diagnose learning systems.

5 sections 37 units about 167 h 0/37

Sections

In dependency order

  1. 1 Linear Algebra & Proof
    8 units about 42 h Project · Least squares and PCA with rank and conditioning failures
    0/8
  2. 2 Calculus & Automatic Differentiation
    6 units about 20 h Project · A small reverse-mode engine and a matrix-calculus gradient-check harness
    0/6
  3. 3 Probability, Information & Bayesian Reasoning
    7 units about 25 h Project · A Monte Carlo verifier for conditional probability, posterior predictives and information
    0/7
  4. 4 Statistics, Experimentation & Causality
    8 units about 41 h Project · A statistical audit harness and the memo for a flattering experiment
    0/8
  5. 5 Optimization & Numerical Methods
    8 units about 39 h Project · An optimizer and numerics test bench
    0/8

Capstone

Numerical Learning Laboratory (10 to 14 h)

Build a small NumPy project that connects least squares and PCA, reverse-mode differentiation, Monte Carlo uncertainty, experiment analysis and optimizer stability. Each component must include one failure case and one independent check.

Milestone deliverables

  • Derivations and assumption notes
  • Runnable implementation with tests and raw numerical comparisons
  • A short defense of solver, estimator and tolerance choices

Rubric

CriterionPassStrong
Least squares and PCAThe linear-algebra project meets Pass on every criterion, with its rank-deficient case and conditioning table runnable from the suite.The README links the conditioning table to the solver choice in the defense note.
Reverse-mode differentiationThe engine and harness pass, and the planted bug fails its directional check.One command reruns the step-size sweep and the planted-bug test.
Monte Carlo uncertaintyEvery simulation check in the repository reports its sample count and standard error and uses the stated acceptance rule.The heavy-tail failure and the drifting-predictive failure are both kept as tests.
Experiment analysisThe audit, the rerun and the decision memo are in the repository with the plan that preceded them.The memo stands on its own for a reader who has not seen the code.
Optimizer stabilityThe optimizer comparison, the divergence diagnosis and the finite-precision failure are reproduced by the suite.Each prediction sits beside its measurement in the notes.
Defense and rebuildA short defense note justifies each solver, estimator and tolerance choice, and a README lists the commands that rebuild every reported number.Every component names one failure case and one independent check in the README.

Capstone hours · 10 to 14

Begin the first section

Quick find

Search Michi

Type to search every route, section, unit, topic and resource.

Enter opens the first result Esc closes

Reference

Keyboard shortcuts

n
Continue to the first unit not passed
j / k
Next / previous unit
1 2 3
Toggle learned, practised, passed
/
Open search
?
Show this help
Esc
Close open panels