1. Alekh Agarwal , Daniel Hsu , Satyen Kale , John Langford , Lihong Li , and Robert Schapire . Taming the monster: A fast and simple algorithm for contextual bandits . In International Conference on Machine Learning , pages 1638– 1646 . PMLR, 2014. Alekh Agarwal, Daniel Hsu, Satyen Kale, John Langford, Lihong Li, and Robert Schapire. Taming the monster: A fast and simple algorithm for contextual bandits. In International Conference on Machine Learning, pages 1638–1646. PMLR, 2014.
2. Shipra Agrawal and Navin Goyal . Thompson sampling for contextual bandits with linear payoffs . In International conference on machine learning , pages 127– 135 . PMLR, 2013. Shipra Agrawal and Navin Goyal. Thompson sampling for contextual bandits with linear payoffs. In International conference on machine learning, pages 127–135. PMLR, 2013.
3. Ashwinkumar Badanidiyuru , Robert Kleinberg , and Aleksandrs Slivkins . Bandits with knapsacks. Journal of the ACM (JACM), 65(3):1–55 , 2018 . Ashwinkumar Badanidiyuru, Robert Kleinberg, and Aleksandrs Slivkins. Bandits with knapsacks. Journal of the ACM (JACM), 65(3):1–55, 2018.
4. Ashwinkumar Badanidiyuru , John Langford , and Aleksandrs Slivkins . Resourceful contextual bandits . In Conference on Learning Theory , pages 1109– 1134 . PMLR, 2014. Ashwinkumar Badanidiyuru, John Langford, and Aleksandrs Slivkins. Resourceful contextual bandits. In Conference on Learning Theory, pages 1109–1134. PMLR, 2014.
5. Rudolf Beran . Minimum hellinger distance estimates for parametric models. The annals of Statistics , pages 445– 463 , 1977 . Rudolf Beran. Minimum hellinger distance estimates for parametric models. The annals of Statistics, pages 445–463, 1977.