ConceptTheory & Algos
Occam's razor bound
A bound relating the description size of classifiers to the number of samples needed to learn with bounded error in-distribution.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
PAC learning1Statistical learning theory1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.