GEN 10457
Mathematical Problems in Machine Learning
Stanford University · UGRD · Fall 2026
Catalog description
Mathematical tools to understand modern machine learning systems. Generalization in machine learning, the classical view: uniform convergence, Radamacher complexity. Generalization from stability. Implicit (algorithmic) regularization. Infinite-dimensional models: reproducing kernel Hilbert spaces. Random features approximations to kernel methods. Connections to neural networks, and neural tangent kernel. Nonparametric regression. Asymptotic behavior of wide neural networks. Properties of convolutionalnetworks. Prerequisites: EE364A or equivalent; Stat310A or equivalent. NOTE: Undergraduates require instructor permission to enroll. Undergraduates interested in taking the course should contact the instructor for permission, providing information about relevant background such as performance in prior coursework, reading, etc.
Sections
Current meeting, instructor, credit, and enrollment details
001
Availability not recently verified- Days & times
- No scheduled meeting time
- Meeting dates
- —
- Location
- —
- Instructor
- Staff