Co-occurring keywords · papers mentioning both
Papers
Provably efficient reinforcement learning with linear function approximation
COLT 2020
Reinforcement Learning in Continuous Time and Space: A Stochastic Control Approach
JMLR 2020
Stochastic Bandits with Delay-Dependent Payoffs
AISTATS 2020
Tsallis-INF for Decoupled Exploration and Exploitation in Multi-armed Bandits
COLT 2020
Watch the Unobserved: A Simple Approach to Parallelizing Monte Carlo Tree Search
ICLR 2020
AdaLinUCB: Opportunistic Learning for Contextual Bandits
IJCAI 2019
Bayesian Policy Optimization for Model Uncertainty
ICLR 2019
Conservative Exploration using Interleaving
AISTATS 2019
Epsilon-BMC: A Bayesian Ensemble Approach to Epsilon-Greedy Exploration in Model-Free Reinforcement Learning
UAI 2019
Exploration Bonus for Regret Minimization in Discrete and Continuous Average Reward MDPs
NeurIPS 2019
Exploration Conscious Reinforcement Learning Revisited
ICML 2019
Information-Theoretic Confidence Bounds for Reinforcement Learning
NeurIPS 2019
Monte Carlo Tree Search for Policy Optimization
IJCAI 2019
Open Problem: Risk of Ruin in Multiarmed Bandits
COLT 2019
Pareto Monte Carlo Tree Search for Multi-Objective Informative Planning
RSS 2019
Thompson Sampling with Information Relaxation Penalties
NeurIPS 2019
Adaptive Exploration-Exploitation Tradeoff for Opportunistic Bandits
ICML 2018
Adaptive Learning with Unknown Information Flows
NeurIPS 2018
GEP-PG: Decoupling Exploration and Exploitation in Deep Reinforcement Learning Algorithms
ICML 2018
Incentivizing Exploration by Heterogeneous Users
COLT 2018
The Uncertainty Bellman Equation and Exploration
ICML 2018
Boltzmann Exploration Done Right
NeurIPS 2017
Learning what to read: Focused machine reading
EMNLP 2017
Trading off Rewards and Errors in Multi-Armed Bandits
AISTATS 2017
Kernel Estimation and Model Combination in A Bandit Problem with Covariates
JMLR 2016