www.WebEvent.com

Sun

Mon

Tue

Wed

Thu

Fri

Sat

28

29

30

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

9

10

11

12

13

4 p.m. - 5:45 p.m.
CS 201: From Optimization Algorithms to Dynamical Systems and Back, RENE VIDAL, Johns Hopkins University

14

15

16

17

18

19

20

21

22

23

24

25

26

27

4 p.m. - 5:45 p.m.
CS 201: Fairness in Financial Services, JIAHAO CHEN, JP Morgan AI Research

28

29

30

1

Seminars