Notes · Papers · Map

Notes

Notes, papers and how they relate, in one place: find your bearings on the map, then browse by subject below.

∑ Mathematical Foundations∇ Algorithms & Optimizationψ Learning Systems derives requires extends to applied in requires applied in extends to extends to extends to contrast Law of LargeNumbers Shannon Entropy KL Divergence &Cross Entropy TypicalSet & AEP StochasticGradient Methods MDPs & ValueFunctions Policy Gradient ScaledDot-ProductAttention VAE & ELBO Score Matching ConditionalTechnique ProbabilityFlow ODE LeWorldModel /SIGReg Probability1/4Statistics0/2Information Theory1/4Optimization1/3Reinforcement Learning1/3Learning Theoryno nodes yetDeep Learning3/5Generative Models0/5
Keya coloured region is a subject; concepts where regions overlap belong to each of thembeads on a card: the subjects it belongs torelations appear when you point at or select a concept9 of 13 concepts span more than one subject
NodesConceptTheoremMethodModelPaperwrittenplannedSelect a subject name to open its map; select a concept to read about it4 / 13 written

Select a subject name to open its map; select a concept to read about it4 / 13 written

Probability1/4

Statistics0/2

Information Theory1/4

Optimization1/3

Reinforcement Learning1/3

Deep Learning3/5

Generative Models0/5

Select a node to see its summary and how it relates to the others.

Relations in words10

Every link on the map, explained in one sentence.

  • Law of Large NumbersderivesTypical Set & AEP

    Applying the law of large numbers to −log p(X) gives the AEP.

  • Shannon EntropyrequiresTypical Set & AEP

    Entropy sets the size of the typical set, about 2^{nH}.

  • Shannon Entropyextends toKL Divergence & Cross Entropy

    KL divergence is relative entropy: entropy extended from one distribution to a pair.

  • KL Divergence & Cross Entropyapplied inVAE & ELBO

    The regularizer in the ELBO is a KL divergence.

  • MDPs & Value FunctionsrequiresPolicy Gradient

    The objective J(θ) is defined over the MDP's trajectory distribution.

  • Stochastic Gradient Methodsapplied inPolicy Gradient

    The update is stochastic gradient ascent on J(θ); its convergence analysis is that of stochastic nonconvex optimization.

  • VAE & ELBOextends toScore Matching

    From a likelihood bound for latent-variable models to objectives that learn the score directly.

  • Score Matchingextends toConditional Technique

    Conditioning makes the score matching objective tractable.

  • Conditional Techniqueextends toProbability Flow ODE

    Once the score is learned, the SDE can be replaced by an equivalent deterministic ODE.

  • VAE & ELBOcontrastLeWorldModel / SIGReg

    Both learn latent representations: the VAE reconstructs observations, LeWorldModel predicts only in latent space and relies on SIGReg against collapse.

Roadmap9

Probability1

  • Law of Large Numbers

Information Theory2

  • Shannon Entropy
  • KL Divergence & Cross Entropyafter “Shannon Entropy”

Optimization1

  • Stochastic Gradient Methods

Reinforcement Learning1

  • MDPs & Value Functions

Generative Models4

  • VAE & ELBOafter “KL Divergence & Cross Entropy”
  • Score Matchingafter “VAE & ELBO”
  • Conditional Techniqueafter “Score Matching”
  • Probability Flow ODEafter “Conditional Technique”

8 items

Information Theory

1

Reinforcement Learning

1

Learning Theory

1

Deep Learning

3
  1. Note written

    LeWorldModel: Stable End-to-End Joint-Embedding Predictive Architecture from Pixels

    Maes, Le Lidec, Scieur, LeCun, Balestriero · arXiv 2026

    Deep LearningWorld ModelJEPA

Generative Models

2
  1. Read

    Denoising Diffusion Probabilistic Models

    Ho, Jain, Abbeel · NeurIPS 2020

    Generative ModelsDiffusionFoundation

  2. To read

    Score-Based Generative Modeling through Stochastic Differential Equations

    Song, Sohl-Dickstein, Kingma, Kumar, Ermon, Poole · ICLR 2021

    Generative ModelsSDETheory