Targeting a simple statistical bandit problem
Overview & Synopsis
This manuscript deals with the estimation of the optimal rule and its mean reward in a simple bandit setting where, at each round, the player is given a context, chooses one of two actions based on the context and all past observations, and receives a reward corresponding to the action undertaken. The player focuses on the mean reward and tries to narrow her confidence interval for it, but it happens that she can also estimate her regret. Inference hinges on the targeted learning methodology. A simulation study illustrates the results of the manuscript.
Indexed from repository: HAL Open Science
(
hal.science)
Keyboard Shortcuts:
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | Targeting a simple statistical bandit problem |
|---|---|
| Author / Organization | Antoine Chambaz, Wenjing Zheng |
| Subject & Discipline | Multidisciplinary Academic Open Research |
| Categories | Science & Mathematics |
| Publication Year | 2016 |
| License / Rights | Open Access / Creative Commons |
| Resource Verification | Listed PDF (Verification Pending) |
| Original Host Website |
HAL Open Science
(hal.science)
|
| File Format | application/pdf (Portable Document Format) |
| Language | EN |
| Catalog ID | DOC-202875 |
| Original Source Link | Visit Source Page on hal.science » |