DSC 190/291 · UC San Diego · Spring 2026

Topics in Learning Theory

This course covers the mathematical foundations of machine learning: what can be learned from data, how many samples are needed, and when efficient algorithms exist. Topics include PAC learning, VC theory, boosting, regularization, online learning, and computational hardness. Alongside the theory, students formalize selected theorems in Lean 4 with AI assistance and develop human-readable proof presentations that bridge formal verification and mathematical exposition.

Instructor Tianhao Wang ([email protected]) Time Wednesdays 5:00–7:50 PM Location PCYNH 121

Prerequisites

Probability, linear algebra, machine learning, and comfort with proof-based mathematics. No prior Lean experience assumed.

Schedule & Materials

DateTopicLinks
1Apr 1No-free-lunch theoremSlides
2Apr 8PAC learning, ERM, concentration
3Apr 15VC dimension, shattering, growth functions
4Apr 22Non-uniform learning, hardness
5Apr 29Agnostic learning, neural networks
6May 6Compression, AdaBoost
7May 13Rademacher complexity, covering numbers
8May 20Stability, convex optimization
9May 27Online learning, regret, OGD
10Jun 3Optimization and synthesis

Coursework

Quarter-Long Project40%

  • Formalized results in learning theory
  • Presentation of the proofs — your design; format is up to you
  • AI workflow — CLAUDE.md, AGENTS.md, skills, and other AI artifacts you develop along the way

Participation30%

  • Attending and engaging in lecture
  • Workshop presentations
  • Giving feedback to peers
  • Engaging with others' work

Weekly Assignments30%

Theory problems + brief project progress report.
HWTopicReleasedDueLink
1TBATBATBA

AI Policy

AI use is encouraged in this course — for both assignments and the project. Part of the mathematical training here is learning how to use AI well in the context of rigorous work, which is different from using AI for general writing or coding tasks.

Use AI for learning the material, exploring proof structure when you are unsure how to decompose a theorem, checking candidate proof steps, writing and debugging Lean code, suggesting alternative helper-lemma decompositions, and improving explanation and presentation. A productive pattern is to use AI iteratively: ask for a candidate helper lemma, test it in Lean, and if it fails, ask the AI to explain why the approach did not work.

Develop your AI workflow throughout the quarter. Refine your CLAUDE.md, AGENTS.md, and skills as you learn what works. These artifacts are part of your project deliverables and reflect how your process evolves over the course.

Verification responsibility is yours. A student who asks an AI to generate a complete Lean proof and submits the result without reading it carefully has not learned the theorem. You must stand behind every proof step, every formalization choice, and every explanation you submit.

AI is a collaborator, not an oracle.

References

Textbooks
Lean 4
Tianhao Wang · UC San Diego · Spring 2026