Pure Exploration

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.

This style of lower bound is very powerful in that it can be applied to a wide range of [pure exploration]([[Pure Exploration]]) problems to obtain reasonable lower bounds which are asymptotically valid -- there exist algorithms whose asymptotic sample complexity matches the sample complexity of the oracle lower bound.

Currently the existing lower bounds in the bandit literature use so-called [oracle lower bounds]([[Oracle [[Lower Bound]]]]) in order to give lower bounds for various [pure exploration]([[Pure Exploration]]) problems.

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.