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