Zero-Inflated Bandits

The Zero-Inflated Bandits problem is a variant of the multi-armed bandit problem where the reward is modeled as a zero-inflated distribution. The authors propose two algorithms, UCB-type and TS-type, for this problem.

Data and Resources

Cite this as

Haoyu Wei, Runzhe Wan, Lei Shi, Rui Song (2024). Dataset: Zero-Inflated Bandits. https://doi.org/10.57702/z8of6l50

DOI retrieved: December 3, 2024

Additional Info

Field Value
Created December 3, 2024
Last update December 3, 2024
Defined In https://doi.org/10.48550/arXiv.2312.15595
Author Haoyu Wei
More Authors
Runzhe Wan
Lei Shi
Rui Song