Skip to content
conftrace_

reinforcement learning theory

8 papers

Explore in graph

Co-occurring keywords · papers mentioning both

reinforcement learning (5) sample complexity (3) optimal policy (2) bellman operator (1) multi-armed bandit (1) generalization bound (1) upper confidence bound (1) regret bound (1) dynamical system (1) convergence rate (1)

Papers

Epistemic Bellman Operators AAAI 2025 Convergence and Optimality of Policy Gradient Methods in Weakly Smooth Settings AAAI 2022 Learning in Observable POMDPs, without Computationally Intractable Oracles NeurIPS 2022 Bellman Eluder Dimension: New Rich Classes of RL Problems, and Sample-Efficient Algorithms NeurIPS 2021 Bilinear Classes: A Structural Framework for Provable Generalization in RL ICML 2021 On Overfitting and Asymptotic Bias in Batch Reinforcement Learning with Partial Observability (Extended Abstract) IJCAI 2020 Sample Complexity of Estimating the Policy Gradient for Nearly Deterministic Dynamical Systems AISTATS 2020 Logarithmic Online Regret Bounds for Undiscounted Reinforcement Learning NeurIPS 2006