conftrace_

model-based algorithm

11 papers

Explore in graph

Co-occurring keywords · papers mentioning both

sample complexity (5) regret bound (4) reinforcement learning (3) model-based rl (2) exploration bonus (2) minimax optimal (2) markov decision process (2) function approximation (2) continuous-time reinforcement learning (1) time-adaptive policy (1)

Papers

Overcoming the Curse of Dimensionality in Reinforcement Learning Through Approximate Factorization ICML 2025 Sample Complexity Characterization for Linear Contextual MDPs AISTATS 2024 Sample-Efficient Robust Multi-Agent Reinforcement Learning in the Face of Environmental Uncertainty ICML 2024 Settling the sample complexity of online reinforcement learning COLT 2024 When to Sense and Control? A Time-adaptive Approach for Continuous-Time RL NeurIPS 2024 Exploration in Reward Machines with Low Regret AISTATS 2023 Improved Sample Complexity for Reward-free Reinforcement Learning under Low-rank MDPs ICLR 2023 PAC Reinforcement Learning for Predictive State Representations ICLR 2023 Human-in-the-loop: Provably Efficient Preference-based Reinforcement Learning with General Function Approximation ICML 2022 Stochastic Shortest Path: Minimax, Parameter-Free and Towards Horizon-Free Regret NeurIPS 2021 Towards Minimax Optimal Reinforcement Learning in Factored Markov Decision Processes NeurIPS 2020