No article text was recorded for this version.
robust sample complexity (robustness-efficiency parity)
Version 1 of 133 papers38 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Towards Minimax Optimality of Model-based Robust Reinforcement Learning
- Blog: Near-Optimal Distributionally Robust Reinforcement Learning with General $L_p$ Norms
- Blog: The Curious Price of Distributional Robustness in Reinforcement Learning with a Generative Model
- Blog: Finite-Sample Regret Bound for Distributionally Robust Offline Tabular Reinforcement Learning
- Blog: Single-Trajectory Distributionally Robust Reinforcement Learning
- Blog: Doubly Regularized Markov Decision Processes for Robust Reinforcement Learning
- Blog: Rectified Robust Policy Optimization for Model-Uncertain Constrained Reinforcement Learning without Strong Duality
- Blog: On the Model-Misspecification in Reinforcement Learning
- Blog: Decentralized Federated Policy Gradient with Byzantine Fault-Tolerance and Provably Fast Convergence
- Blog: Online Robust Reinforcement Learning with General Function Approximation
- Blog: Sample-Efficient Robust Multi-Agent Reinforcement Learning in the Face of Environmental Uncertainty
- Blog: Online Robust Reinforcement Learning with Model Uncertainty
- Blog: Model-Free Robust $\phi$-Divergence Reinforcement Learning Using Both Offline and Online Data
- Blog: A Reduction Framework for Distributionally Robust Reinforcement Learning under Average Reward
- Blog: Robust Stackelberg Equilibria
- Blog: Is Inverse Reinforcement Learning Harder than Standard Reinforcement Learning?
- Blog: Tightening the Dependence on Horizon in the Sample Complexity of Q-Learning
- Blog: Finite-Time Bounds for Distributionally Robust TD Learning with Linear Function Approximation
- Blog: Distributionally Robust Structure Learning for Discrete Pairwise Markov Networks
- Blog: Towards Faster Global Convergence of Robust Policy Gradient Methods
- Blog: Near-Optimal Sample Complexities of Divergence-based S-rectangular Distributionally Robust Reinforcement Learning
- Blog: Statistical Learning of Distributionally Robust Stochastic Control in Continuous State Spaces
- Blog: Natural Actor-Critic for Robust Reinforcement Learning with Function Approximation
- Blog: Minimax Statistical Learning with Wasserstein distances
- Blog: Double Pessimism is Provably Efficient for Distributionally Robust Offline Reinforcement Learning: Generic Algorithm and Robust Partial Coverage
- Blog: A Unified Principle of Pessimism for Offline Reinforcement Learning under Model Mismatch
- Blog: Sample-Efficient Tabular Self-Play for Offline Robust Reinforcement Learning
- Blog: Model-Free Offline Reinforcement Learning with Enhanced Robustness
- Blog: Towards Robust Model-Based Reinforcement Learning Against Adversarial Corruption
- Blog: Towards Robust Off-Policy Evaluation via Human Inputs
- Blog: Linear Mixture Distributionally Robust Markov Decision Processes
- Blog: Efficient Action Robust Reinforcement Learning with Probabilistic Policy Execution Uncertainty
- Blog: Improved Sample Complexity Bounds for Distributionally Robust Reinforcement Learning
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_robust_sample_complexity_robustness_effi_33a5ce69,
title = {robust sample complexity (robustness-efficiency parity)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/robust-sample-complexity-robustness-efficiency-parity/rdr_33a5ce69c39245bd9de7828470cbe446},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_robust_sample_complexity_robustness_effi_33a5ce69_v1,
title = {robust sample complexity (robustness-efficiency parity)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/robust-sample-complexity-robustness-efficiency-parity/rdr_33a5ce69c39245bd9de7828470cbe446/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}