Best Arm Identification

This is an "Orphan" page. Its core content has not been shared: what you see below is a loose collection of pages and page snippets that mention this page, as well as snippets of this page that were quoted elsewhere.

Using this lemma, we can prove, for example, a lower bound for the fixed-confidence [[Best Arm Identification]] problem:

The solution to the oracle lower bound problem (see [here](((ICv0uK4Fs)))) is extensively analyzed in [[Sample Complexity of Partition Identification Using Multi-Armed Bandits]] for more general pure exploration problems beyond [[Best Arm Identification]]

This is an "Orphan" page. Its core content has not been shared: what you see below is a loose collection of pages and page snippets that mention this page, as well as snippets of this page that were quoted elsewhere.