conftrace
_
Papers
Trends
Conferences
Explore
More
Authors
Topics
Keywords
Insights
Papers
Trends
Conferences
Explore
Authors
Topics
Keywords
Insights
Achievements
Home
›
Keywords
›
pure exploration
pure exploration
50 papers
Explore in graph
Co-occurring keywords
multi-armed bandit
(1098)
sample complexity
(1169)
linear bandit
(124)
combinatorial optimization
(1039)
best-arm identification
(38)
active learning
(1301)
arm identification
(11)
stochastic bandit
(98)
best arm identification
(85)
confidence bound
(29)
Papers
Improved Confidence Bounds for the Linear Logistic Model and Applications to Bandits
ICML 2021
Fast active learning for pure exploration in reinforcement learning
ICML 2021
Pure Exploration in Kernel and Neural Bandits
NIPS 2021
An Empirical Process Approach to the Union Bound: Practical Algorithms for Combinatorial and Linear Bandits
NIPS 2020
Gamification of Pure Exploration for Linear Bandits
ICML 2020
Finding All $\epsilon$-Good Arms in Stochastic Bandits
NIPS 2020
Making the Cut: A Bandit-based Approach to Tiered Interviewing
NIPS 2019
Sample complexity of partition identification using multi-armed bandits
COLT 2019
Disagreement-Based Combinatorial Pure Exploration: Sample Complexity Bounds and an Efficient Algorithm
COLT 2019
Non-Asymptotic Pure Exploration by Solving Games
NIPS 2019
Pure Exploration with Multiple Correct Answers
NIPS 2019
Efficient Pure Exploration in Adaptive Round model
NIPS 2019
Feasible Arm Identification
ICML 2018
Pure Exploration in Infinitely-Armed Bandit Models with Fixed-Confidence
ALT 2018
A fully adaptive algorithm for pure exploration in linear bandits
AISTATS 2018
The Simulator: Understanding Adaptive Sampling in the Moderate-Confidence Regime
COLT 2017
Maximin Action Identification: A New Bandit Framework for Games
COLT 2016
The Power of Adaptivity in Identifying Statistical Alternatives
NIPS 2016
Pure Exploration of Multi-armed Bandit Under Matroid Constraints
COLT 2016
Improved Learning Complexity in Combinatorial Pure Exploration Bandits
AISTATS 2016
Anytime Exploration for Multi-armed Bandits using Confidence Information
ICML 2016
An optimal algorithm for the Thresholding Bandit Problem
ICML 2016
Combinatorial Pure Exploration of Multi-Armed Bandits
NIPS 2014
Information Complexity in Bandit Subset Selection
COLT 2013
Generic Exploration and K-armed Voting Bandits
ICML 2013
<
1
2
>