conftrace_

tabular reinforcement learning

12 papers

Explore in graph

Co-occurring keywords

regret bound (1926) markov decision process (790) sample complexity (1169) reinforcement learning (4352) tabular learning (9) robust policy (24) logarithmic regret (28) offline reinforcement learning (492) robust value estimation (1) human knowledge (3)

Papers

Sample Complexity Reduction via Policy Difference Estimation in Tabular Reinforcement Learning NIPS 2024
Improved Sample Complexity Bounds for Distributionally Robust Reinforcement Learning AISTATS 2023
Hardness in Markov Decision Processes: Theory and Practice NIPS 2022
Nearly Optimal Policy Optimization with Stable at Any Time Guarantee ICML 2022
Near-Optimal Randomized Exploration for Tabular Markov Decision Processes NIPS 2022
Q-learning with Logarithmic Regret AISTATS 2021
Finite-Sample Regret Bound for Distributionally Robust Offline Tabular Reinforcement Learning AISTATS 2021
Periodic Q-Learning L4DC 2020
A Comparative Analysis of Expected and Distributional Reinforcement Learning AAAI 2019
Non-Asymptotic Gap-Dependent Regret Bounds for Tabular MDPs NIPS 2019
#Exploration: A Study of Count-Based Exploration for Deep Reinforcement Learning NIPS 2017
Leveraging Human Knowledge in Tabular Reinforcement Learning: A Study of Human Subjects IJCAI 2017