4:15 p.m. - 5:45 p.m.
CS 201: Adaptive Submodularity: A New Approach to Active Learning and Stochastic Optimization, DANIEL GOLOVIN, Caltech’s Center for the Mathematics of Information
15
16
17
18
19
4:15 p.m. - 5:45 p.m.
CS 201: Scalable Enterprise Networks with Inexpensive Switches, MINLAN YU, Princeton University
20
21
4:15 p.m. - 5:45 p.m.
CS 201: Blackwell Approachability meets Regret Minimization in the Dual, JAKE ABERNETHY, UC Berkeley
