No article text was recorded for this version.
minimax-optimal sample complexity
Version 1 of 130 papers36 conceptsfrozen 2026-10-04
Papers in this version
- Blog: PAC Bounds for Discounted MDPs
- Blog: Real-Time Scheduling via Reinforcement Learning
- Blog: On the Sample Complexity of Reinforcement Learning with a Generative Model
- Blog: EUBRL: Epistemic Uncertainty Directed Bayesian Reinforcement Learning
- Blog: Achieving Zero Constraint Violation for Constrained Reinforcement Learning via Primal-Dual Approach
- Blog: Exploration and apprenticeship learning in reinforcement learning
- Blog: Near-Optimal Time and Sample Complexities for Solving Markov Decision Processes with a Generative Model
- Blog: Provably Efficient Learning of Transferable Rewards
- Blog: Near Instance-Optimal PAC Reinforcement Learning for Deterministic MDPs
- Blog: Worst-Case Offline Reinforcement Learning with Arbitrary Data Support
- Blog: Near-Optimal Offline Reinforcement Learning via Double Variance Reduction
- Blog: Settling the sample complexity of online reinforcement learning
- Blog: Towards Tight Bounds on the Sample Complexity of Average-reward MDPs
- Blog: Sample Complexity Bounds for Linear Constrained MDPs with a Generative Model
- Blog: Optimal Sample Complexity for Average Reward Markov Decision Processes
- Blog: Offline Actor-Critic for Average Reward MDPs
- Blog: On the (In)Tractability of Reinforcement Learning for LTL Objectives
- Blog: Sample-Efficient Constrained Reinforcement Learning with General Parameterization
- Blog: Provably Efficient Exploration in Inverse Constrained Reinforcement Learning
- Blog: Finite-Time Analysis of Three-Timescale Constrained Actor-Critic and Constrained Natural Actor-Critic Algorithms.
- Blog: PAC-inspired Option Discovery in Lifelong Reinforcement Learning
- Blog: High-Probability Sample Complexities for Policy Evaluation With Linear Function Approximation
- Blog: A Primal-Dual-Critic Algorithm for Offline Constrained Reinforcement Learning
- Blog: Sample Complexity of Kernel-Based Q-Learning
- Blog: Constrained Meta Reinforcement Learning with Provable Test-Time Safety
- Blog: A Near-Optimal Primal-Dual Method for Off-Policy Learning in CMDP
- Blog: Fast active learning for pure exploration in reinforcement learning
- Blog: Span-Based Optimal Sample Complexity for Weakly Communicating and General Average Reward MDPs
- Blog: Semi-infinitely Constrained Markov Decision Processes
- Blog: Minimax PAC bounds on the sample complexity of reinforcement learning with a generative model
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_minimax_optimal_sample_complexity_f3b2b06c,
title = {minimax-optimal sample complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/minimax-optimal-sample-complexity/rdr_f3b2b06c44c849f384b28a2fdf0c541b},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-22},
}This exact version (version 1, frozen text):
@misc{lacuna_minimax_optimal_sample_complexity_f3b2b06c_v1,
title = {minimax-optimal sample complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/minimax-optimal-sample-complexity/rdr_f3b2b06c44c849f384b28a2fdf0c541b/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-22},
}