printer friendly pageCS 229T: Statistical Learning Theory (STATS 231)
(Same as
STATS 231) How do we formalize what it means for an algorithm to learn from data? This course focuses on developing mathematical tools for answering this question. We will present various common learning algorithms and prove theoretical guarantees about them. Topics include online learning, kernel methods, generalization bounds (uniform convergence), and spectral methods. Prerequisites: A solid background in linear algebra and probability theory, statistics and machine learning (
STATS 315A or
CS 229). Convex optimization (
EE 364a) is helpful but not required.
Terms: Win
| Units: 3
Instructors:
Liang, P. (PI)
Filter Results: