Sparsity in machine learning: recovery in convex hulls of infinite dictionaries

SIAM Student Seminar
Friday, March 12, 2010 - 13:00
1 hour (actually 50 minutes)
Skiles 255
School of Mathematics, Georgia Tech
We will start with a brief introduction to the broad area of machine learning, with the focus on empirical risk minimization methods and their connection to the theory of empirical processes. Using some results from our recent work with V. Koltchinskii, I will explain how sparsity affects the risk bounds.