all AI news
SPEED: Experimental Design for Policy Evaluation in Linear Heteroscedastic Bandits
March 4, 2024, 5:43 a.m. | Subhojyoti Mukherjee, Qiaomin Xie, Josiah Hanna, Robert Nowak
cs.LG updates on arXiv.org arxiv.org
Abstract: In this paper, we study the problem of optimal data collection for policy evaluation in linear bandits. In policy evaluation, we are given a target policy and asked to estimate the expected reward it will obtain when executed in a multi-armed bandit environment. Our work is the first work that focuses on such optimal data collection strategy for policy evaluation involving heteroscedastic reward noise in the linear bandit setting. We first formulate an optimal design …
abstract arxiv collection cs.lg data data collection design environment evaluation experimental linear paper policy speed stat.ml study type will work
More from arxiv.org / cs.LG updates on arXiv.org
Jobs in AI, ML, Big Data
Lead Developer (AI)
@ Cere Network | San Francisco, US
Research Engineer
@ Allora Labs | Remote
Ecosystem Manager
@ Allora Labs | Remote
Founding AI Engineer, Agents
@ Occam AI | New York
AI Engineer Intern, Agents
@ Occam AI | US
AI Research Scientist
@ Vara | Berlin, Germany and Remote