abstract | openreview | title | layout | series | publisher | issn | id | month | tex_title | firstpage | lastpage | page | order | cycles | bibtex_author | author | date | address | container-title | volume | genre | issued | extras | ||||||||||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
We consider stochastic graphical bandits, where after pulling an arm, the decision maker observes rewards of not only the chosen arm but also its neighbors in a feedback graph. Most of existing work assumes that the rewards are drawn from bounded or at least sub-Gaussian distributions, which however may be violated in many practical scenarios such as social advertising and financial markets. To settle this issue, we investigate stochastic graphical bandits with heavy-tailed rewards, where the distributions have finite moments of order |
LUE-tmFTDrm |
Stochastic Graphical Bandits with Heavy-Tailed Rewards |
inproceedings |
Proceedings of Machine Learning Research |
PMLR |
2640-3498 |
gou23a |
0 |
Stochastic Graphical Bandits with Heavy-Tailed Rewards |
734 |
744 |
734-744 |
734 |
false |
Gou, Yutian and Yi, Jinfeng and Zhang, Lijun |
|
2023-07-02 |
Proceedings of the Thirty-Ninth Conference on Uncertainty in Artificial Intelligence |
216 |
inproceedings |
|
|