Analysis of Boolean Functions in Lean

3. Spectral structure and learning🔗

Low-degree concentration, subspaces, decision trees, random restrictions, learning from examples and membership queries, Goldreich--Levin, and Kushilevitz--Mansour.

  1. 3.1. Low-degree spectral concentration
  2. 3.2. Subspaces and decision trees
  3. 3.3. Restrictions
  4. 3.4. Learning theory
  5. 3.5. Highlight: the Goldreich–Levin Algorithm