Sample complexity of partition identification using multi-armed bandits
Sandeep Juneja, Subhashini Krishnasamy

TL;DR
This paper investigates the sample complexity of identifying the correct partition of a vector of distributions in multi-armed bandit problems, providing bounds and algorithms for various geometric partition structures.
Contribution
It introduces a unified framework for partition identification in bandits, deriving lower bounds and proposing algorithms that asymptotically match these bounds across different geometric settings.
Findings
Derived lower bounds on sample complexity based on problem geometry
Proposed algorithms match lower bounds asymptotically
Applicable to diverse applications like finance
Abstract
Given a vector of probability distributions, or arms, each of which can be sampled independently, we consider the problem of identifying the partition to which this vector belongs from a finitely partitioned universe of such vector of distributions. We study this as a pure exploration problem in multi armed bandit settings and develop sample complexity bounds on the total mean number of samples required for identifying the correct partition with high probability. This framework subsumes well studied problems such as finding the best arm or the best few arms. We consider distributions belonging to the single parameter exponential family and primarily consider partitions where the vector of means of arms lie either in a given set or its complement. The sets considered correspond to distributions where there exists a mean above a specified threshold, where the set is a half space and where…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Algorithms · Advanced Statistical Process Monitoring · Advanced Bandit Algorithms Research
