Search Results for author:
Found 4 papers, 0 papers with code
Fixed-Budget Real-Valued Combinatorial Pure Exploration of Multi-Armed Bandit
We show that the upper bound of the probability of error of the CSA algorithm matches a lower bound up to a logarithmic factor in the exponent.
Thompson Sampling for Real-Valued Combinatorial Pure Exploration of Multi-Armed Bandit
We introduce an algorithm named the Generalized Thompson Sampling Explore (GenTS-Explore) algorithm, which is the first algorithm that can work even when the size of the action set is exponentially large in $d$.
An Optimal Algorithm for the Real-Valued Combinatorial Pure Exploration of Multi-Armed Bandit
In such a case, the R-CPE-MAB can be seen as a special case of the so-called transductive linear bandits.
Robust computation of optimal transport by $β$-potential regularization
Optimal transport (OT) has become a widely used tool in the machine learning field to measure the discrepancy between probability distributions.
