Related Experiment Video
Updated: Jun 6, 2025

Barnes Maze Testing Strategies with Small and Large Rodent Models
Published on: February 26, 2014
A Fast Algorithm for the Real-Valued Combinatorial Pure Exploration of the Multi-Armed Bandit
Shintaro Nakamura1,2, Masashi Sugiyama3,4
1The University of Tokyo, Bunkyo-ku, Tokyo 113-8654, Japan.
Abstract:
We study the real-valued combinatorial pure exploration problem in the stochastic multi-armed bandit (R-CPE-MAB). We study the case where the size of the action set is polynomial with respect to the number of arms. In such a case, the R-CPE-MAB can be seen as a special case of the so-called transductive linear bandits. We introduce the combinatorial gap-based exploration (CombGapE) algorithm, whose sample complexity upper-bound-matches the lower bound up to a problem-dependent constant factor. We numerically show that the CombGapE algorithm outperforms existing methods significantly in both synthetic and real-world data sets.
Related Concept Videos
Randomized Experiments
Simple randomization
Simple...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Bandpass Sampling
A bandpass signal has a spectrum with a lower frequency limit, denoted as ω1, and an upper frequency limit, denoted as ω2....
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation
On...
Factorial Design
Decision Making: P-value Method
First, a specific claim about the population parameter is proposed. The claim is based on the research question and is stated in a simple form. Further, an opposing statement to the claim is also stated. These statements can act as null and alternative hypotheses: a null hypothesis would be a neutral statement while the alternative hypothesis can...

