Menard, Pierre
- UCB Momentum Q-learning: Correcting the bias without forgetting
2021/03/01 by Pierre Ménard, Omar Darwiche Domingues, Menard, Pierre +4 · 5 citations
Computer Science · Decision Sciences · #Advanced Bandit Algorithms Research #Adversarial Robustness in Machine Learning #FOS: Computer and information sciences #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Reinforcement Learning in Robotics
- Thresholding Bandit for Dose-ranging: The Impact of Monotonicity
2017/11/13 by Garivier, Aurélien, Ménard, Pierre, Rossi, Laurent +1 · 3 citations
#FOS: Computer and information sciences #FOS: Mathematics #Machine Learning (stat.ML) #Statistics Theory (math.ST)
- KL-UCB-switch: optimal regret bounds for stochastic bandits from both a distribution-dependent and a distribution-free viewpoints
2018/05/14 by Garivier, Aurélien, Hadiji, Hédi, Menard, Pierre +1 · 2 citations
#FOS: Computer and information sciences #FOS: Mathematics #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Statistics Theory (math.ST)
- Optimistic Posterior Sampling for Reinforcement Learning with Few Samples and Tight Guarantees
2022/09/28 by Daniil Tiapkin, Tiapkin, Daniil, Denis Belomestny +15 · 2 citations
Computer Science · Decision Sciences · #Advanced Bandit Algorithms Research #Age of Information Optimization #FOS: Computer and information sciences #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Reinforcement Learning in Robotics
- Demonstration-Regularized RL
2023/10/26 by Daniil Tiapkin, Tiapkin, Daniil, Denis Belomestny +13 · 3 citations
Computer Science · #Adversarial Robustness in Machine Learning #FOS: Computer and information sciences #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Reinforcement Learning in Robotics
- Fast Rates for Maximum Entropy Exploration
2023/03/14 by Tiapkin, Daniil, Belomestny, Denis, Calandriello, Daniele +7 · 2 citations
#FOS: Computer and information sciences #Machine Learning (cs.LG) #Machine Learning (stat.ML)
- The Influence of Shape Constraints on the Thresholding Bandit Problem
2020/06/17 by Cheshire, James, Menard, Pierre, Carpentier, Alexandra · 1 citation
#FOS: Computer and information sciences #Machine Learning (cs.LG) #Machine Learning (stat.ML)
- From Dirichlet to Rubin: Optimistic Exploration in RL without Bonuses
2022/05/16 by Daniil Tiapkin, Denis Belomestny, Tiapkin, Daniil +13 · 1 citation
Computer Science · Decision Sciences · #Advanced Bandit Algorithms Research #FOS: Computer and information sciences #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Machine Learning and Algorithms #Reinforcement Learning in Robotics
- Sharp Deviations Bounds for Dirichlet Weighted Sums with Application to analysis of Bayesian algorithms
2023/04/06 by Belomestny, Denis, Menard, Pierre, Naumov, Alexey +2 · 1 citation
#FOS: Computer and information sciences #FOS: Mathematics #Machine Learning (stat.ML) #Probability (math.PR) #Statistics Theory (math.ST)
- Model-free Posterior Sampling via Learning Rate Randomization
2023/10/27 by Daniil Tiapkin, Tiapkin, Daniil, Denis Belomestny +15 · 1 citation
Computer Science · Decision Sciences · #Advanced Bandit Algorithms Research #Bayesian Modeling and Causal Inference #FOS: Computer and information sciences #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Reinforcement Learning in Robotics