sample complexity

Provably Efficient Causal Model-Based Reinforcement Learning for Systematic Generalization AAAI 2023 Provably Efficient Offline Goal-Conditioned Reinforcement Learning with General Function Approximation and Single-Policy Concentrability NeurIPS 2023 Provably Efficient Offline Reinforcement Learning in Regular Decision Processes NeurIPS 2023 Provably efficient representation selection in Low-rank Markov Decision Processes: from online to offline RL UAI 2023 Provably Robust Temporal Difference Learning for Heavy-Tailed Rewards NeurIPS 2023 Provably Sample-Efficient Model-Free Algorithm for MDPs with Peak Constraints JMLR 2023 Proximal Stochastic Recursive Momentum Methods for Nonconvex Composite Decentralized Optimization AAAI 2023 Quasi-optimal Reinforcement Learning with Continuous Actions ICLR 2023 Reaching Goals is Hard: Settling the Sample Complexity of the Stochastic Shortest Path ALT 2023 Regret Minimization via Saddle Point Optimization NeurIPS 2023 Regret-Minimizing Double Oracle for Extensive-Form Games ICML 2023 Regularization and Variance-Weighted Regression Achieves Minimax Optimality in Linear MDPs: Theory and Practice ICML 2023 Reinforcement Learning with General Utilities: Simpler Variance Reduction and Large State-Action Space ICML 2023 Replicability in Reinforcement Learning NeurIPS 2023 Replicable Clustering NeurIPS 2023 Representation Learning for Low-rank General-sum Markov Games ICLR 2023 Revisiting Discriminative vs. Generative Classifiers: Theory and Implications ICML 2023 Revisiting Fair-PAC Learning and the Axioms of Cardinal Welfare AISTATS 2023 Reward-agnostic Fine-tuning: Provable Statistical Benefits of Hybrid Reinforcement Learning NeurIPS 2023 Reward-Mixing MDPs with Few Latent Contexts are Learnable ICML 2023 Robust Budget Pacing with a Single Sample ICML 2023 Robust Empirical Risk Minimization with Tolerance ALT 2023 Robust Mean Estimation Without Moments for Symmetric Distributions NeurIPS 2023 Safe Exploration Incurs Nearly No Additional Sample Complexity for Reward-Free RL ICLR 2023 Sample Complexity Bound for Evaluating the Robust Observer’s Performance under Coprime Factors Uncertainty L4DC 2023