← Search

Vishakha Patil

3 accepted papers

2023

Mitigating Disparity while Maximizing Reward: Tight Anytime Guarantee for Improving Bandits

IJCAI 2023poster

We study the Improving Multi-Armed Bandit problem, where the reward obtained from an arm increases with the number of pulls it receives. This model provides an elegant abstraction for many real-world problems in domains such as education and employment, where decisions about the distribution of oppo…

Cited by 3SourcePDFScholar
2021

Multi-Armed Bandits with Bounded Arm-Memory: Near-Optimal Guarantees for Best-Arm Identification and Regret Minimization

NeurIPS 2021poster

We study the Stochastic Multi-armed Bandit problem under bounded arm-memory. In this setting, the arms arrive in a stream, and the number of arms that can be stored in the memory at any time, is bounded. The decision-maker can only pull arms that are present in the memory. We address the problem f…

Cited by 19SourcePDFScholar