Richard Combes
11 papers · 2014–2024 · 5 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 ↓+3 more ↓ Show less ↑
π£ Hot Topic Early Bird π Conference Polyglot Β· Silver π Academic Marathon Β· Half π Interdisciplinary Bridge Β· Bronze πΊοΈ Taxonomy Completionist (22)
π
Century Club Β· Bronze
π₯
Unstoppable Β· Bronze
ποΈ
Keyword Collector
(51)
Top co-authors
Research topics
Keywords
regret bound
(6)
multi-armed bandit
(5)
stochastic bandit
(3)
thompson sampling
(3)
bayesian inference
(2)
regret lower bound
(2)
combinatorial bandit
(2)
combinatorial semi-bandit
(2)
unimodal bandit
(2)
posterior distribution
(1)
adversarial setting
(1)
label aggregation
(1)
ucb algorithm
(1)
worker reliability
(1)
regret minimization
(1)
sequential decision
(1)
continuous action space
(1)
minimax estimation
(1)
continuous optimization
(1)
minimax regret
(1)
Papers
Thompson Sampling For Combinatorial Bandits: Polynomial Regret and Mismatched Sampling Paradox
NeurIPS 2024
Contextual Linear Bandits under Noisy Features: Towards Bayesian Oracles
AISTATS 2023
Towards Optimal Algorithms for Multi-Player Bandits without Collision Sensing Information
COLT 2022
Asymptotically Optimal Strategies For Combinatorial Semi-Bandits in Polynomial Time
ALT 2021
On the Suboptimality of Thompson Sampling in High Dimensions
NeurIPS 2021
Solving Bernoulli Rank-One Bandits with Unimodal Thompson Sampling
ALT 2020
A Minimax Optimal Algorithm for Crowdsourcing
NeurIPS 2017
Minimal Exploration in Structured Stochastic Bandits
NeurIPS 2017
Combinatorial Bandits Revisited
NeurIPS 2015
Lipschitz Bandits: Regret Lower Bound and Optimal Algorithms
COLT 2014
Unimodal Bandits: Regret Lower Bounds and Optimal Algorithms
ICML 2014