CS 540 - Deep Learning Theory
|Deep Learning Theory||CS540||DLT||75414||OLC||4||1530 - 1645||T R||Matus Jan Telgarsky|
A rigorous mathematical course covering foundational analyses of the approximation, optimization, and generalization properties of Deep Neural Networks. Topics include: constructive and non-constructive approximations with one hidden layer; benefits of depth; optimization in the NTK regime; maximum margin optimization outside the NTK regime; Rademacher complexity, VC dimensino, and covering number bounds for ReLU networks. Evaluation is primarily based on homeworks, with a smaller project component. The course goal is to prepare students perform their own research in the field. Course Information: 4 graduate hours. No professional credit. Prerequisite: Basic linear algebra, probability, proof-writing, and statistics required. Real analysis recommended.