conftrace_

episodic mdp

11 papers

Explore in graph

Co-occurring keywords · papers mentioning both

regret bound (8) markov decision process (3) reinforcement learning (3) offline policy evaluation (2) uniform convergence (2) sample complexity (2) offline reinforcement learning (2) conservative exploration (1) multi-agent system (1) episode complexity (1)

Papers

Online Episodic Convex Reinforcement Learning ICML 2025 Reinforcement Learning with Segment Feedback ICML 2025 A Tighter Problem-Dependent Regret Bound for Risk-Sensitive Reinforcement Learning AISTATS 2023 Near-optimal Conservative Exploration in Reinforcement Learning under Episode-wise Constraints ICML 2023 From Dirichlet to Rubin: Optimistic Exploration in RL without Bonuses ICML 2022 Episodic Reinforcement Learning in Finite MDPs: Minimax Lower Bounds Revisited ALT 2021 Near-Optimal Provable Uniform Convergence in Offline Policy Evaluation for Reinforcement Learning AISTATS 2021 Optimal Uniform OPE and Model-based Offline Reinforcement Learning in Time-Homogeneous, Reward-Free and Task-Agnostic Settings NeurIPS 2021 Simultaneously Learning Stochastic and Adversarial Episodic MDPs with Known Transition NeurIPS 2020 Provably Efficient Q-Learning with Low Switching Cost NeurIPS 2019 Multi-View Decision Processes: The Helper-AI Problem NeurIPS 2017