Skip to content
conftrace_

Ronald Ortner

16 papers · 2006–2023 · 7 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 ↓
+7 more ↓ πŸ—ΊοΈ Taxonomy Completionist (23) πŸƒ Academic Marathon Β· Full 🌍 Conference Polyglot Β· Silver πŸŒ‰ Interdisciplinary Bridge Β· Silver 🐣 Hot Topic Early Bird
πŸ”¬ Deep Specialist (12) 🧭 Keyword Pioneer πŸ† Keyword Champion (4) πŸ“ˆ Trend Setter πŸš€ Conference Pioneer πŸ’Ž Century Club Β· Bronze πŸ—ƒοΈ Keyword Collector (56)

Venues

NeurIPS (5) AISTATS (3) ICML (3) COLT (2) IJCAI (1) JMLR (1) UAI (1)

Top co-authors

Peter Auer (9) Daniil Ryabko (4) Pratik Gajane (4) Odalric-ambrym Maillard (3) Alessandro Lazaric (3) Phuong Nguyen (2) Matteo Pirotta (2) Ronan Fruit (2) Thomas Jaksch (2) Chung-Wei Lee (1)

Research topics

Machine Learning (15) Optimization & Theory (13) Learning Types (10) Reinforcement Learning (9) Methods (9) Mathematics & Optimization (6) Optimization (6) Artificial Intelligence (4) Core AI (4) Applications (3) Core Methods (1) Mathematics (1)

Keywords

regret bound (12) reinforcement learning (9) markov decision process (8) multi-armed bandit (5) optimal policy (4) online learning (4) sample complexity (3) upper confidence bound (3) state representation (3) contextual bandit (2) non-stationary bandit (2) dynamic regret (2) online reinforcement learning (2) continuous state space (2) minimax regret (2) side information (1) exploration exploitation (1) reinforcement learning theory (1) mutual information (1) exploration-exploitation tradeoff (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 Regret Bounds for Learning State Representations in Reinforcement Learning NeurIPS 2019 Variational Regret Bounds for Reinforcement Learning UAI 2019 Efficient Bias-Span-Constrained Exploration-Exploitation in Reinforcement Learning ICML 2018 Improved Learning Complexity in Combinatorial Pure Exploration Bandits AISTATS 2016 Pareto Front Identification from Stochastic Bandit Feedback AISTATS 2016 Improved Regret Bounds for Undiscounted Continuous Reinforcement Learning ICML 2015 Competing with an Infinite Set of Models in Reinforcement Learning AISTATS 2013 Optimal Regret Bounds for Selecting the State Representation in Reinforcement Learning ICML 2013 Online Regret Bounds for Undiscounted Continuous Reinforcement Learning NeurIPS 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