Peter Auer
12 papers · 2002–2023 · 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 ↓+6 more ↓ Show less ↑
πΊοΈ Taxonomy Completionist (22) π Academic Marathon Β· Ultra π Conference Polyglot Β· Silver π Interdisciplinary Bridge Β· Silver π£ Hot Topic Early Bird
π
Keyword Champion
π
Keyword Trendsetter Combo
(5)
π§
Keyword Pioneer
π
Trend Setter
π
Conference Pioneer
π
Century Club Β· Bronze
Top co-authors
Research topics
Keywords
regret bound
(7)
reinforcement learning
(6)
markov decision process
(5)
multi-armed bandit
(4)
optimal policy
(3)
sample complexity
(2)
non-stationary bandit
(2)
adversarial bandit
(2)
contextual bandit
(2)
stochastic bandit
(2)
minimax regret
(2)
autonomous exploration
(2)
confidence bound
(2)
dynamic regret
(2)
pac-bayesian analysis
(1)
side information
(1)
undiscounted setting
(1)
exploration exploitation
(1)
mutual information
(1)
reinforcement learning theory
(1)
Papers
Autonomous Exploration for Navigating in MDPs Using Blackbox RL Algorithms
IJCAI 2023
Achieving Optimal Dynamic Regret for Non-stationary Bandits without Prior Information
COLT 2019
Adaptively Tracking the Best Bandit Arm with an Unknown Number of Distribution Changes
COLT 2019
Variational Regret Bounds for Reinforcement Learning
UAI 2019
An algorithm with nearly optimal pseudo-regret for both stochastic and adversarial bandits
COLT 2016
Pareto Front Identification from Stochastic Bandit Feedback
AISTATS 2016
Autonomous Exploration For Navigating In MDPs
COLT 2012
PAC-Bayesian Analysis of Contextual Bandits
NeurIPS 2011
Near-optimal Regret Bounds for Reinforcement Learning
JMLR 2010
Near-optimal Regret Bounds for Reinforcement Learning
NeurIPS 2008
Logarithmic Online Regret Bounds for Undiscounted Reinforcement Learning
NeurIPS 2006
Using Confidence Bounds for Exploitation-Exploration Trade-offs
JMLR 2002