| Time | Speaker | Title | Resources | |
|---|---|---|---|---|
| 17:30 to 18:20 | Shie Mannor (Technion - Israel Institute of Technology, Israel) | Risk and robustness in Reinforcement Learning | ||
| 18:30 to 19:20 | Navin Goyal (Microsoft Research Bengaluru, India) | Towards Analyzing Normalizing Flows | ||
| 19:30 to 20:20 | Mengdi Wang (Princeton University, New Jersey, US) | Some theoretical results on model-based reinforcement learning |
| Time | Speaker | Title | Resources | |
|---|---|---|---|---|
| 09:00 to 09:50 | Joel Tropp (California Institute of Technology, California, US) | Random products and quantum simulation | ||
| 17:30 to 18:20 | Rahul Roy (Indian Statistical Institute, Delhi, India) | A non-planar random graph and its planar scaling limit | ||
| 18:30 to 19:20 | Anette Hosoi (Massachusetts Institute of Technology, Cambridge, US) | Short Stories of Probability and Sports | ||
| 19:30 to 20:20 | Nike Sun (Massachusetts Institute of Technology, Cambridge, US) | Phase transitions in random constraint satisfaction problems. |
| Time | Speaker | Title | Resources | |
|---|---|---|---|---|
| 17:30 to 18:20 | Gabor Lugosi (Pompeu Fabra University, Barcelona, Spain) | Root finding and broadcasting in random recursive trees | ||
| 18:30 to 19:20 | Subhajit Goswami (TIFR, Mumbai, India) | Adaptive Estimation via Optimal Decision Trees | ||
| 19:30 to 20:20 | Alexander Rakhlin (Massachusetts Institute of Technology, Cambridge, US) | Is Memorization Compatible with Learning? |
| Time | Speaker | Title | Resources | |
|---|---|---|---|---|
| 18:30 to 19:20 | Alexandre Proutiere (KTH Royal Institute of Technology, Stockholm, Sweden) | Fastest Identification in Linear Systems | ||
| 19:30 to 20:20 | Santosh Vempala (Georgia Institute of Technology, Atlanta, US) | Reducing Isotropy to KLS: An Almost Cubic Volume Algorithm | ||
| 22:00 to 22:50 | Nima Anari (Stanford University, California, US) | Fractionally Log-Concave and Sector-Stable Polynomials |
| Time | Speaker | Title | Resources | |
|---|---|---|---|---|
| 17:30 to 18:20 | Gareth Roberts (University of Warwick, Coventry, UK) | The Monte Carlo Fusion problem | ||
| 18:30 to 19:20 | Natesh Pillai (Harvard University, Cambridge, US) | Accelerating MCMC for Computationally Intensive Models | ||
| 19:30 to 20:20 | Jon Mattingly (Duke University, Durham, US) | Evaluating Fairness in Redistricting |
Partially Supported By
