9
|
10
|
11
4 p.m. - 5:45 p.m.
CS 201 | Interactive Robot Learning from Non-Expert Human Teachers, Yuchen Cui, UCLA Computer Science
|
12
|
13
CS 201 | Polynomial Graph Neural Networks: Theoretical Limits and Graph Noise Impact, Arash Amini, UCLA Statistics
|
14
|
15
|
16
|
17
|
18
4 p.m. - 5:45 p.m.
CS 201 | Avoiding Spurious Sharpness Minimization, Hossein Mobahi, Google DeepMind
|
19
|
20
3:45 p.m. - 5:45 p.m.
CS 201 | Jon Postel Distinguished Lecture: How to Appease a Majority?, Moses Charikar, Stanford University
|
21
|
22
|
23
|
24
|
25
4 p.m. - 5:45 p.m.
CS 201 | Towards More Reliable Generative AI: Probing Failure Modes, Harnessing Test-Time Inference, and Interpreting Diffusion Models, Mahdi Soltanolkotabi, USC
|
26
|
27
4 p.m. - 5:45 p.m.
CS 201 | Learning From Aggregated Responses: Improving Model Utility Under Privacy Constraints, Adel Javanmard, USC
|
28
|
1
|