18.S995: Topics in Deep Learning Theory
Alex Damian · Fall 2026 · MIT
This syllabus is preliminary and subject to change.
Description: This course will cover selected topics in deep learning theory. The goal is to develop a predictive understanding of how neural networks scale, learn features, and behave during optimization. In addition to the theory, every topic will be paired with numerical experiments which test the theory on real networks.
Prerequisites: The main prerequisite is mathematical maturity, including linear algebra, analysis, and probability. Students should also be familiar with a deep learning framework such as JAX or PyTorch and have trained a neural network before. See Homework 0 for a more concrete indication of the expected background.
Tentative topics:
- Scaling limits: random features, the neural tangent kernel, mean-field dynamics, maximal-update parameterization, tensor programs
- Feature learning: planted models, single and multi-index models, computational-statistical gaps
- Optimization: SGD dynamics, acceleration, critical batch size, implicit regularization, the edge of stability
Coursework: The course will have a few problem sets combining theory and experiments, graded on completion. Each problem set will be accompanied by a short in-class quiz, and the course will end with a final project.
Homework 0
Linear Algebra
Let be symmetric and positive definite, let , and define .
- Compute the gradient .
- Let follow gradient descent: . Solve for in closed form as a function of .
- For what does ? What changes if is only positive semidefinite?
Analysis
Let be differentiable and suppose that is -Lipschitz with respect to a norm . Let satisfy . Starting from , define
- Show that
- Using , show that
Neural Networks
- Let , , , and . Let be applied coordinatewise and define the two-layer neural network . For , let . Compute .
- Now let and define the logits . For a label , let . Compute .
- Using JAX or PyTorch, train the network from question 2 on MNIST using cross-entropy loss until it interpolates the training data (100% training accuracy). Plot the train loss and train accuracy as a function of steps.
Probability
A mean-zero random variable is -sub-Gaussian if, for every ,
- Let . Show that is -sub-Gaussian.
- Let be independent mean-zero random variables such that is -sub-Gaussian. Show that is -sub-Gaussian.
- Let be -sub-Gaussian. Use Markov's inequality on to show that
-
Let have
i.i.d. entries.
- Let and be -nets with cardinalities at most and , respectively. Show that
- For each fixed , show that .
- Use a union bound to prove that, for some absolute constant , with probability at least , Note: This bound actually holds with , but proving this requires more advanced techniques.