Olivier Cappe
16 papers · 2008–2021 · 10 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+7 more ↓ Show less ↑
🐣 Hot Topic Early Bird 🌉 Interdisciplinary Bridge 🗺️ Taxonomy Completionist (10) 🧭 Keyword Pioneer 🌍 Conference Polyglot (10)
🐣
Hot Topic Early Bird
🌉
Interdisciplinary Bridge
🗃️
Keyword Collector
(59)
🚀
Conference Pioneer
💎
Century Club
(16)
📈
Trend Setter
⚡
Prolific Year
(5)
Conferences
NIPS (4)
AISTATS (3)
COLT (2)
ACL (1)
ACML (1)
ALT (1)
COLING (1)
CONLL (1)
ICML (1)
JMLR (1)
Top co-authors
Keywords
multi-armed bandit
(7)
regret bound
(6)
online learning
(3)
upper confidence bound
(3)
sequential learning
(2)
regret minimization
(2)
stochastic optimization
(2)
stochastic process
(1)
sequential decision
(1)
dynamic regret
(1)
arm selection
(1)
stochastic approximation
(1)
exponential family
(1)
sample complexity
(1)
ucb algorithm
(1)
hypothesis testing
(1)
regret optimization
(1)
best arm identification
(1)
minimax regret
(1)
sequential testing
(1)
Papers
Efficient Algorithms for Stochastic Repeated Second-price Auctions
ALT 2021
Self-Concordant Analysis of Generalized Linear Bandits with Forgetting
AISTATS 2021
A/B/n Testing with Control in the Presence of Subpopulations
NIPS 2021
On Limited-Memory Subsampling Strategies for Bandits
ICML 2021
Fast Rate Learning in Stochastic First Price Bidding
ACML 2021
Weighted Linear Bandits for Non-Stationary Environments
NIPS 2019
On the Complexity of Best-Arm Identification in Multi-Armed Bandit Models
JMLR 2016
Multiple-Play Bandits in the Position-Based Model
NIPS 2016
On the Complexity of A/B Testing
COLT 2014
Adaptive Metropolis with Online Relabeling
AISTATS 2012
On Bayesian Upper Confidence Bounds for Bandit Problems
AISTATS 2012
The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond
COLT 2011
Practical Very Large Scale CRFs
ACL 2010
Parametric Bandits: The Generalized Linear Case
NIPS 2010
Robust Similarity Measures for Named Entities Matching
COLING 2008
Using LDA to detect semantically incoherent documents
CONLL 2008