Bandit Problems with Side Observations
| dc.creator | Wang, Chih-Chun | |
| dc.creator | Kulkarni, Sanjeev R. | |
| dc.creator | Poor, H. Vincent | |
| dc.date | 2005-01-22 | |
| dc.date.accessioned | 2026-07-07T08:17:44Z | |
| dc.date.available | 2026-07-07T08:17:44Z | |
| dc.description | An extension of the traditional two-armed bandit problem is considered, in which the decision maker has access to some side information before deciding which arm to pull. At each time t, before making a selection, the decision maker is able to observe a random variable X_t that provides some information on the rewards to be obtained. The focus is on finding uniformly good rules (that minimize the growth rate of the inferior sampling time) and on quantifying how much the additional information helps. Various settings are considered and for each setting, lower bounds on the achievable inferior sampling time are developed and asymptotically optimal adaptive schemes achieving these lower bounds are constructed. | |
| dc.description | 16 pages, 3 figures. To be published in the IEEE Transactions on Automatic Control | |
| dc.identifier | https://arxiv.org/abs/cs/0501063 | |
| dc.identifier | http://arxiv.org/abs/cs/0501063 | |
| dc.identifier | doi:10.1109/TAC.2005.844079 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/134194 | |
| dc.subject | Information Theory | |
| dc.subject | Machine Learning | |
| dc.title | Bandit Problems with Side Observations | |
| dc.type | text |