Emma Brunskill
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 6 in the filters
on a stage with
- Glenn M Davisonce
- J. Derek Lomasonce
- James A. Landayonce
all 14 in the filters
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Estimating the Value of Personalization | Bridging Prediction and Intervention Problems in Social Systems (Simons Institute, 2026) | 2026-01-12 |
Introduces a new estimator that, from historical data, tests whether a personalized policy yields higher expected outcomes than the best one-size-fits-all… | ||
| EnglishBot: An AI-Powered Conversational System for Second Language Learning | IUI 2021 | 2021-04-13 |
EnglishBot is a voice-based chatbot with deep-learning speech recognition (94.5% speech recognition accuracy), adaptive English feedback and Chinese hints… | ||
| Panel Discussion | Reinforcement Learning from Batch Data and Simulation | 2020-11-30 |
Panelists argue that in the next five years batch/offline RL will move from demos to real-world proposals for policy design (e.g. tax or macro suggestions) and… | ||
| Better Learning from the Past: Counterfactual / Batch RL | Emerging Challenges in Deep Learning (Simons Institute workshop, 2019) | 2019-08-05 |
Counterfactual batch RL techniques estimate and optimize policies from logged data using importance-weighted stationary-distribution ratios and doubly robust… | ||
| A Tutorial on Reinforcement Learning I | Foundations of Machine Learning Boot Camp 2017 | 2017-01-23 |
Concise tutorial on reinforcement learning that defines MDPs, contrasts model‑based vs model‑free (tabular Bellman backups and Q‑learning), and treats… | ||
| A Tutorial on Reinforcement Learning II | Foundations of Machine Learning Boot Camp 2017 | 2017-01-23 |
Summarizes regret bounds and practical fixes: UCRL-2 gives regret scaling O(D · S · sqrt(A T) · log(T/δ)) under finite diameter while gap-dependent bounds can… | ||
| Interface Design Optimization as a Multi-Armed Bandit Problem | CHI 2016 | 2016-05-07 |
Researchers apply UCB1 and a variant of upper confidence bounds to a live online math game with thousands of players and run meta-experiments (~10,000… | ||
| nothing matches | ||