Lecture plan:

Scribe template
Office Hours Information

• Lecture 1: Course introduction and puzzles (Slides)
  

• Lecture 2: Importance of problem structure (Slides)
  

• Lecture 3: f-divergence and joint range (Slides)
  

• Lecture 4-6: General idea of reduction
  Lecture 4: Decision theory, deficiency, Le Cam’s distance, asymptotic equivalence (Slides)
  Lecture 5: Hajek-Le Cam classical asymptotics (Slides)
  Lecture 6: Statistical/computational tradeoff (Slides) (Scribed Notes)
  

• Lecture 7-12: General idea of testing
  Lecture 7: Le Cam’s two-point method (Slides)
  Lecture 8: One point vs a mixture, Ingster-Suslina method (Slides)
  Lecture 9: Mixture vs mixture, orthogonal polynomial, moment matching (Slides)
  Lecture 10: Testing multiple hypotheses: Fano and Assouad (Slides)
  Lecture 11: Examples of Fano and Assouad (Slides)
  Lecture 12: Global Fano, packing and covering (Slides) (Scribed Notes)
  

• Lecture 13+: Special topics (chosen by time and interest)
  Lecture 13: Lower bounds in convex optimization (Slides)
  Lecture 14: Communication or privacy constrained estimation and testing (Slides)
  Lecturw 15: Compression-based techniques for scandiction
  Lecture 16: Information-Theoretic Bounds in Information Theory (Slides)
  Lecture 17: Min-max vs max-min techniques (Slides)
  Lecture 18: Adaptation lower bounds (Slides)