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:

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 HRd×dH \in \mathbb{R}^{d \times d} be symmetric and positive definite, let wRdw \in \mathbb{R}^d, and define L(w)=12wHwL(w) = \tfrac{1}{2} w^\top H w.

  1. Compute the gradient L(w)\nabla L(w).
  2. Let ww follow gradient descent: wt+1=wtηL(wt)w_{t+1} = w_t - \eta \nabla L(w_t). Solve for wtw_t in closed form as a function of tt.
  3. For what η\eta does wt0w_t \to 0? What changes if HH is only positive semidefinite?

Analysis

Let f:RdRf:\mathbb{R}^d\to\mathbb{R} be differentiable and suppose that f\nabla f is LL-Lipschitz with respect to a norm \|\cdot\|. Let r0,r1,Rdr_0,r_1,\ldots\in\mathbb{R}^d satisfy rtε\lVert r_t\rVert\leq\varepsilon. Starting from x0=y0x_0=y_0, define xt+1=xtηf(xt),yt+1=ytη(f(yt)+rt).x_{t+1}=x_t-\eta\nabla f(x_t),\qquad y_{t+1}=y_t-\eta\qty{\nabla f(y_t)+r_t}.

  1. Show that xt+1yt+1(1+ηL)xtyt+ηε.\lVert x_{t+1}-y_{t+1}\rVert\leq\qty{1+\eta L}\lVert x_t-y_t\rVert+\eta\varepsilon.
  2. Using 1+xex1+x\leq e^x, show that xtytεL(eηLt1).\lVert x_t-y_t\rVert\leq\frac{\varepsilon}{L}\qty{e^{\eta Lt}-1}.

Neural Networks

  1. Let xRdx \in \mathbb{R}^d, WRm×dW \in \mathbb{R}^{m \times d}, bRmb \in \mathbb{R}^m, and aRma \in \mathbb{R}^m. Let σC1(R)\sigma \in C^1\qty{\mathbb{R}} be applied coordinatewise and define the two-layer neural network fθ(x)=aσ(Wx+b)f_\theta(x) = a^\top \sigma(Wx+b). For yRy \in \mathbb{R}, let L=12(yfθ(x))2L = \tfrac{1}{2}\qty{y-f_\theta(x)}^2. Compute WL\nabla_W L.
  2. Now let ARk×mA \in \mathbb{R}^{k \times m} and define the logits fθ(x)=Aσ(Wx+b)Rkf_\theta(x) = A\sigma(Wx+b) \in \mathbb{R}^k. For a label y{1,,k}y \in \{1, \ldots, k\}, let L=log(softmax(fθ(x))y)L = -\log\qty{\operatorname{softmax}\qty{f_\theta(x)}_y}. Compute WL\nabla_W L.
  3. 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 XX is σ\sigma-sub-Gaussian if, for every λR\lambda \in \mathbb{R}, Eexp(λX)exp(λ2σ22).\mathbb{E}\exp\qty{\lambda X} \leq \exp\qty{\frac{\lambda^2\sigma^2}{2}}.

  1. Let XN(0,σ2)X \sim \mathcal{N}(0,\sigma^2). Show that XX is σ\sigma-sub-Gaussian.
  2. Let X1,,XnX_1, \ldots, X_n be independent mean-zero random variables such that XiX_i is σi\sigma_i-sub-Gaussian. Show that i=1nXi\sum_{i=1}^n X_i is i=1nσi2\sqrt{\sum_{i=1}^n \sigma_i^2}-sub-Gaussian.
  3. Let XX be σ\sigma-sub-Gaussian. Use Markov's inequality on exp(λX)\exp\qty{\lambda X} to show that P(Xt)2exp(t22σ2).\mathbb{P}\qty{|X| \geq t} \leq 2\exp\qty{-\frac{t^2}{2\sigma^2}}.
  4. Let WRm×dW \in \mathbb{R}^{m \times d} have i.i.d. N(0,1)\mathcal{N}(0,1) entries.
    1. Let NmSm1\mathcal{N}_m \subset \mathbb{S}^{m-1} and NdSd1\mathcal{N}_d \subset \mathbb{S}^{d-1} be 1/41/4-nets with cardinalities at most 9m9^m and 9d9^d, respectively. Show that Wop2maxuNm,vNduWv.\lVert W \rVert_{\mathrm{op}} \leq 2\max_{u \in \mathcal{N}_m,\,v \in \mathcal{N}_d}\left|u^\top Wv\right|.
    2. For each fixed u,vu,v, show that uWvN(0,1)u^\top Wv \sim \mathcal{N}(0,1).
    3. Use a union bound to prove that, for some absolute constant CC, with probability at least 1δ1-\delta, WopC(m+d+2log(1/δ)).\lVert W \rVert_{\mathrm{op}} \leq C\qty{\sqrt{m}+\sqrt{d}+\sqrt{2\log\qty{1/\delta}}}. Note: This bound actually holds with C=1C=1, but proving this requires more advanced techniques.