|Computer Science/Discrete Mathematics Seminar I|
|Topic:||Is optimization computationally equivalent to online learning?|
|Date:||Monday, October 5|
|Time/Room:||11:15am - 12:15pm/West Bldg. Lect. Hall|
Vapnik's fundamental theorem of statistical learning establishes a computational equivalence between optimization (empirical risk minimization) and learning in the statistical setting. Is the same true for learning in games? We give a precise answer to this question.