Deep Deep Learning
Understanding the ideas inside the network.

Major ideas. Fundamental questions. The mathematics underneath.
Deep Deep Learning is a graduate, student-led seminar for studying ideas you have heard about and want to understand properly. The candidate pool connects neural tangent kernels, μP and feature learning, Mamba, in-context learning, test-time training, hypernetworks, world models, online continual learning, model merging, mechanistic interpretability, new generative frameworks, graph neural networks, and the theory of why training works. Stop-Gradient, Games, and Learning Dynamics asks when learning optimizes a potential and when convergence needs a different argument. Training without backpropagation uses Dust to study perturbation-based gradient estimates and their computational cost.
Each selected topic gets two academic hours. A session builds from the minimum background to one central research paper and selected recent developments. We work through a derivation, examine an experiment, and ask what remains unresolved. Students lead the presentations and discussion.
Everyone completes one shared pre-reading before each selected meeting. Presenters choose it in consultation with the instructor and announce it one week before class: a tutorial, a short paper or specified sections that take 30–45 minutes. Two guiding questions accompany the reading; each student arrives with one question or point of confusion.
The reading pool is larger than the course. Week 10 asks whether neural networks are intrinsically entangled or whether our tools obscure their structure; Week 11 develops circuit tracing and the implications of choosing units of analysis. Students and the instructor choose the remaining topics. Dates and all presenter assignments are TBD.
Topic numbers identify reading bundles, independently of week numbers. Weeks 10 and 11 cover units of analysis and circuit tracing respectively. Students and the instructor choose the remaining topics and teaching order; dates and all presenters are TBD.
Logistics
Choose the topics first; the weekly assignments will follow.
Format
13 planned weekly student-led seminars. Two academic hours per selected topic. No exam.
Topic selection
19 reading bundles. Weeks 10–11: mechanistic interpretability. Remaining selection and order: TBD.
When
Spring 2027. Day and meeting time: TBD. The schedule uses week numbers.
Where
Room and delivery mode: TBD.
Registration
Course number, credits and enrollment: TBD.
Preparation
Working knowledge of deep learning, linear algebra, probability, calculus and optimization. Formal prerequisites: TBD.
Shared pre-reading
One required reading per selected meeting, chosen by presenters with the instructor and announced one week ahead. Budget 30–45 minutes; specific readings: TBD.
Assessment
Grading components and weights: TBD. No exam.
One question. Three things to bring.
Every presentation should make a mathematical idea concrete.
01 · One derivation
Explain one central derivation carefully, including its assumptions and the older ideas it builds on.
02 · One decisive experiment
Show an experiment or ablation that tests the explanation, and what the evidence can distinguish.
03 · One unresolved question
Identify a limitation, an alternative explanation, or a next experiment worth discussing.
Explore the topic families
A menu for selecting seminars. Inclusion here does not reserve a week.
Kernels, feature learning & optimization
4 candidates →Topic family 02Sequence models & reasoning
4 candidates →Topic family 03Representations, world models & continual learning
3 candidates →Topic family 04Weight space & interpretability
4 candidates →Topic family 05Generative models
2 candidates →Topic family 06Graphs & neural architectures
2 candidates →Course staff & communication
Instructor
Assaf Shocher · Homepage
Contact & office hours
Course contact, forum, office hours and supporting staff: TBD.