Fabrice Clérot

2 accepted papers

2016

Random Forest for the Contextual Bandit Problem

Raphaël Féraud, Robin Allesiardo, Tanguy Urvoy, Fabrice Clérot

AISTATS 2016poster

To address the contextual bandit problem, we propose an online random forest algorithm. The analysis of the proposed algorithm is based on the sample complexity needed to find the optimal decision stump. Then, the decision stumps are recursively stacked in a random collection of decision trees, BAND…

Cited by 72 Source ↗PDF ↗Scholar ↗

2015

A Relative Exponential Weighing Algorithm for Adversarial Utility-based Dueling Bandits

Pratik Gajane, Tanguy Urvoy, Fabrice Clérot

ICML 2015poster

We study the K-armed dueling bandit problem which is a variation of the classical Multi-Armed Bandit (MAB) problem in which the learner receives only relative feedback about the selected pairs of arms. We propose a new algorithm called Relative Exponential-weight algorithm for Exploration and Exploi…

Cited by 55 Source ↗PDF ↗Scholar ↗