www.WebEvent.com

Sun

Mon

Tue

Wed

Thu

Fri

Sat

30

1

2

4:15 p.m. - 5:45 p.m.
CS 201 | Strong Bounds for 3-Progression, RAGHU MEKA, UCLA - Computer Science Department

3

4

5

6

7

8

9

4:15 p.m. - 5:45 p.m.
CS 201 | Verifying Array Programs Sans Loop Invariants, SUPRATIK CHAKRABORTY, Indian Institute of Technology | Mumbai

10

11

4:15 p.m. - 5:45 p.m.
CS 201 | Breaking Language Barriers with Massive Multilingual Machine Translation, LEI LI, UC Santa Barbara

12

13

14

15

16

17

18

19

20

21

22

23

24

25

4:15 p.m. - 5:45 p.m.
CS 201 | Adaptive Stochastic Optimization with Constraints, MLADEN KOLAR, University of Chicago

26

27

28

29

30

31

1

4:15 p.m. - 5:45 p.m.
CS 201 | Weaker than Zeroth Order: Convex Optimization with Relative Feedback, AADIRUPA SAHA, Apple ML Research

2

3