conftrace_

episodic markov decision process

9 papers

Explore in graph

Co-occurring keywords · papers mentioning both

regret bound (6) linear function approximation (3) markov decision process (3) sample complexity (3) reward-free exploration (2) model-free reinforcement learning (2) reinforcement learning (2) problem-dependent bound (1) linear mixture model (1) optimistic policy optimization (1)

Papers

Active Coverage for PAC Reinforcement Learning COLT 2023 A Near-Optimal Algorithm for Safe Reinforcement Learning Under Instantaneous Hard Constraints ICML 2023 Model-free Posterior Sampling via Learning Rate Randomization NeurIPS 2023 Provably Efficient Reinforcement Learning with Linear Function Approximation under Adaptivity Constraints NeurIPS 2021 Reward-Free Model-Based Reinforcement Learning with Linear Function Approximation NeurIPS 2021 The best of both worlds: stochastic and adversarial episodic MDPs with unknown transition NeurIPS 2021 Almost Optimal Model-Free Reinforcement Learningvia Reference-Advantage Decomposition NeurIPS 2020 Provably Efficient Exploration in Policy Optimization ICML 2020 Tighter Problem-Dependent Regret Bounds in Reinforcement Learning without Domain Knowledge using Value Function Bounds ICML 2019