4 p.m. - 5:45 p.m.
CS 201: Relaxing the I.I.D. Assumption: Adaptively Minimax Optimal Regret via Root-Entropic Regularization, DANIEL ROY - BLAIR BILODEAU, University of Toronto
31
1
2
3
4
5
6
4 p.m. - 5:45 p.m.
CS 201: Demystifying (Deep) Reinforcement Learning with Optimism and Pessimism, ZHAORAN WANG, Northwestern University
7
8
4 p.m. - 5:45 p.m.
CS 201: Derivative-Free Optimization of Noisy Functions, JORGE NOCEDAL, Northwestern University
