Victor Gabillon
13 papers · 2011–2020 · 6 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+7 more ↓ Show less ↑
🌍 Conference Polyglot (6) 🧭 Keyword Pioneer 🐣 Hot Topic Early Bird 🌉 Interdisciplinary Bridge 🏃 Academic Marathon (9)
🧭
Keyword Pioneer
🐣
Hot Topic Early Bird
🌍
Conference Polyglot
(6)
📈
Trend Setter
🔥
Unstoppable
(6)
🗃️
Keyword Collector
(69)
💎
Century Club
(13)
Conferences
NIPS (5)
AISTATS (4)
ALT (1)
COLT (1)
ICML (1)
JMLR (1)
Top co-authors
Keywords
multi-armed bandit
(5)
regret bound
(4)
online learning
(3)
best arm identification
(2)
stochastic optimization
(2)
sample complexity
(2)
gap-based exploration
(2)
value function
(2)
approximate dynamic programming
(2)
simple regret
(2)
exploration exploitation
(2)
regret minimization
(1)
non-convex optimization
(1)
exploration-exploitation
(1)
markov chain monte carlo
(1)
minimax optimization
(1)
learning theory
(1)
policy learning
(1)
policy iteration
(1)
adversarial learning
(1)
Papers
Adaptive multi-fidelity optimization with fast learning rates
AISTATS 2020
Derivative-Free & Order-Robust Optimisation
AISTATS 2020
A simple parameter-free and adaptive approach to optimization under a minimal local smoothness assumption
ALT 2019
Scale-free adaptive planning for deterministic dynamics & discounted rewards
ICML 2019
Best of both worlds: Stochastic & adversarial best-arm identification
COLT 2018
Near Minimax Optimal Players for the Finite-Time 3-Expert Prediction Problem
NIPS 2017
Hit-and-Run for Sampling and Planning in Non-Convex Spaces
AISTATS 2017
Improved Learning Complexity in Combinatorial Pure Exploration Bandits
AISTATS 2016
Approximate Modified Policy Iteration and its Application to the Game of Tetris
JMLR 2015
Adaptive Submodular Maximization in Bandit Setting
NIPS 2013
Approximate Dynamic Programming Finally Performs Well in the Game of Tetris
NIPS 2013
Best Arm Identification: A Unified Approach to Fixed Budget and Fixed Confidence
NIPS 2012
Multi-Bandit Best Arm Identification
NIPS 2011