Victor Gabillon
13 papers · 2011–2020 · 6 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+5 more ↓ Show less ↑
πΊοΈ Taxonomy Completionist (29) π Conference Polyglot Β· Silver π£ Hot Topic Early Bird π Interdisciplinary Bridge Β· Bronze π Academic Marathon Β· Sprint
π§
Keyword Pioneer
π
Trend Setter
π₯
Unstoppable Β· Bronze
π
Century Club Β· Bronze
ποΈ
Keyword Collector
(72)
Top co-authors
Research topics
Mathematics & Optimization
(10)
Optimization
(10)
Machine Learning
(9)
Optimization & Theory
(7)
Learning Types Β· Machine Learning
(6)
Artificial Intelligence
(4)
Core AI
(4)
Reinforcement Learning
(3)
Applications
(3)
Deep Learning
(1)
Learning Types Β· Deep Learning
(1)
Mathematics
(1)
Methods
(1)
Keywords
multi-armed bandit
(5)
regret bound
(4)
best arm identification
(3)
online learning
(3)
stochastic optimization
(2)
sample complexity
(2)
gap-based exploration
(2)
value function
(2)
approximate dynamic programming
(2)
simple regret
(2)
exploration exploitation
(2)
markov decision process
(1)
non-convex optimization
(1)
regret minimization
(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
Hit-and-Run for Sampling and Planning in Non-Convex Spaces
AISTATS 2017
Near Minimax Optimal Players for the Finite-Time 3-Expert Prediction Problem
NeurIPS 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
NeurIPS 2013
Approximate Dynamic Programming Finally Performs Well in the Game of Tetris
NeurIPS 2013
Best Arm Identification: A Unified Approach to Fixed Budget and Fixed Confidence
NeurIPS 2012
Multi-Bandit Best Arm Identification
NeurIPS 2011