Skip to content
conftrace_

pac guarantee

8 papers

Explore in graph

Co-occurring keywords · papers mentioning both

sample complexity (2) reinforcement learning (2) transition matrix (1) range searching (1) bernstein inequality (1) factored representation (1) finite-horizon mdp (1) expected conditional distance (1) reachability specifications (1) adaptive allocation (1)

Papers

Efficient Solution and Learning of Robust Factored MDPs AAAI 2026 Reinforcement Learning from Reachability Specifications: PAC Guarantees with Expected Conditional Distance ICML 2024 Offline Minimax Soft-Q-learning Under Realizability and Partial Coverage NeurIPS 2023 Optimal Algorithms for Range Searching over Multi-Armed Bandits IJCAI 2021 Private Reinforcement Learning with PAC and Regret Guarantees ICML 2020 Learning Multiple Markov Chains via Adaptive Allocation NeurIPS 2019 Open Category Detection with PAC Guarantees ICML 2018 Sample Complexity of Episodic Fixed-Horizon Reinforcement Learning NeurIPS 2015