Pierre Ménard
École Normale Supérieure de Lyon(FR)
Publications by Year
Research Areas
Advanced Bandit Algorithms Research, Reinforcement Learning in Robotics, Machine Learning and Algorithms, Optimization and Search Problems, Auction Theory and Applications
Most-Cited Works
- Explore First, Exploit Next: The True Shape of Regret in Bandit Problems(2016)
- → A minimax and asymptotically optimal algorithm for stochastic bandits(2017)72 cited
- → Fast active learning for pure exploration in reinforcement learning(2020)29 cited
- → Gamification of Pure Exploration for Linear Bandits(2020)23 cited
- → Episodic Reinforcement Learning in Finite MDPs: Minimax Lower Bounds\n Revisited(2020)23 cited
- Regret bounds for kernel-based reinforcement learning(2020)
- → KL-UCB-switch: optimal regret bounds for stochastic bandits from both a distribution-dependent and a distribution-free viewpoints(2018)15 cited
- → Adaptive Reward-Free Exploration(2020)11 cited
- → UCB Momentum Q-learning: Correcting the bias without forgetting(2021)10 cited