Beta. Content is under active construction and has not been peer-reviewed. Report errors on GitHub.Disclaimer

Find your gap.

Pick a topic you want to understand. You’ll see every prerequisite traced down to the foundations it rests on. Check off what you already know. What remains is your reading list.

Bounds on how far random variables deviate from their expectations: Markov, Chebyshev, Hoeffding, and Bernstein. Used throughout generalization theory, bandits, and sample complexity.

Before Concentration Inequalities, you should know:

0 / 4 (0%)

3 steps back(1)

  • layer 0A·tier 2·read →

Two steps back(1)

  • layer 0A·tier 1·read →

Direct prerequisites(2)

  • layer 0A·tier 1·read →
  • layer 0A·tier 1·read →

How this works

  • BFS backward. Starting from your target, we walk the prerequisitesgraph until we hit the foundations. Each topic’s depth is its shortest distance from your target.
  • Must-know-cold items. The sub-checkboxes inside each topic are the specific facts and theorems you should be able to state without notes. Expand a topic to see them.
  • Local only. Your progress is saved in this browser via localStorage. Nothing is sent to a server. Clearing site data resets it.