In-Context Learning for Pure Exploration in Continuous Spaces
Alessio Russo, Yin-Ching Lee, Ryan Welch, Aldo Pacchiano

TL;DR
This paper introduces C-ICPE-TS, a neural policy-based method for pure exploration in continuous spaces, enabling efficient hypothesis identification without hand-crafted models across various benchmarks.
Contribution
The work presents a novel deep learning approach for pure exploration in continuous spaces, capable of transfer learning and active inference without explicit models.
Findings
Effective in continuous best-arm identification
Accurate in region localization tasks
Successful in function minimizer identification
Abstract
In active sequential testing, also termed pure exploration, a learner is tasked with the goal to adaptively acquire information so as to identify an unknown ground-truth hypothesis with as few queries as possible. This problem, originally studied by Chernoff in 1959, has several applications: classical formulations include Best-Arm Identification (BAI) in bandits, where actions index hypotheses, and generalized search problems, where strategically chosen queries reveal partial information about a hidden label. In many modern settings, however, the hypothesis space is continuous and naturally coincides with the query/action space: for example, identifying an optimal action in a continuous-armed bandit, localizing an -ball contained in a target region, or estimating the minimizer of an unknown function from a sequence of observations. In this work, we study pure exploration in…
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
TopicsAdvanced Bandit Algorithms Research · Machine Learning and Algorithms · Domain Adaptation and Few-Shot Learning
