Image de couverture de livre

Near-Optimal Sample Complexities of Divergence-based S-rectangular Distributionally Robust Reinforcement Learning

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Li, Zhenghao, Wang, Shengbo, Si, Nian
Format:	Preprint
Publié:	2025
Sujets:	Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Sample Complexity of Distributionally Robust Average-Reward Reinforcement Learning
par: Chen, Zijun, et autres
Publié: (2025)

A Finite Sample Complexity Bound for Distributionally Robust Q-learning
par: Wang, Shengbo, et autres
Publié: (2023)

Sample Complexity of Variance-reduced Distributionally Robust Q-learning
par: Wang, Shengbo, et autres
Publié: (2023)

On the Foundation of Distributionally Robust Reinforcement Learning
par: Wang, Shengbo, et autres
Publié: (2023)

Non-Rectangular Average-Reward Robust MDPs: Optimal Policies and Their Transient Values
par: Wang, Shengbo, et autres
Publié: (2026)

Bellman Optimality of Average-Reward Robust Markov Decision Processes with a Constant Gain
par: Wang, Shengbo, et autres
Publié: (2025)

Learning Optimal Distributionally Robust Stochastic Control in Continuous State Spaces
par: Wang, Shengbo, et autres
Publié: (2024)

Distributionally Robust Model-Based Offline Reinforcement Learning with Near-Optimal Sample Complexity
par: Shi, Laixi, et autres
Publié: (2022)

ORVIT: Near-Optimal Online Distributionally Robust Reinforcement Learning
par: Ghosh, Debamita, et autres
Publié: (2025)

Achieving $\varepsilon^{-2}$ Dependence for Average-Reward Q-Learning with a New Contraction Principle
par: Chen, Zijun, et autres
Publié: (2026)

Optimal Sample Complexity for Average Reward Markov Decision Processes
par: Wang, Shengbo, et autres
Publié: (2023)

Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning
par: Kayal, Aya, et autres
Publié: (2025)

Nearly Optimal Sample Complexity for Learning with Label Proportions
par: Busa-Fekete, Robert, et autres
Publié: (2025)

Near Optimal Non-asymptotic Sample Complexity of 1-Identification
par: Li, Zitian, et autres
Publié: (2025)

Near-Optimal Sample Complexity for Iterated CVaR Reinforcement Learning with a Generative Model
par: Deng, Zilong, et autres
Publié: (2025)

Representation-Aware Distributionally Robust Optimization: A Knowledge Transfer Framework
par: Wang, Zitao, et autres
Publié: (2025)

Private Realizable-to-Agnostic Transformation with Near-Optimal Sample Complexity
par: Li, Bo, et autres
Publié: (2025)

Knowledge-Guided Wasserstein Distributionally Robust Optimization
par: Wang, Zitao, et autres
Publié: (2025)

Near-Optimal Sample Complexity for Online Constrained MDPs
par: Liu, Chang, et autres
Publié: (2026)

Distributionally Robust Reinforcement Learning with Interactive Data Collection: Fundamental Hardness and Near-Optimal Algorithm
par: Lu, Miao, et autres
Publié: (2024)

Sample Complexity of Distributionally Robust Off-Dynamics Reinforcement Learning with Online Interaction
par: He, Yiting, et autres
Publié: (2025)

Near-Minimax-Optimal Distributional Reinforcement Learning with a Generative Model
par: Rowland, Mark, et autres
Publié: (2024)

Near-Optimality of Contrastive Divergence Algorithms
par: Glaser, Pierre, et autres
Publié: (2025)

Model-Free Robust Reinforcement Learning with Sample Complexity Analysis
par: Wang, Yudan, et autres
Publié: (2024)

Central Limit Theorem for Two-Time-Scale Approximate Distributionally Robust RL
par: Wang, Shengbo, et autres
Publié: (2026)

Near-Optimal Sample Complexity Bounds for Constrained Average-Reward MDPs
par: Wei, Yukuan, et autres
Publié: (2025)

Multivariate Distributional Reinforcement Learning Using Sliced Divergences
par: Debes, Baptiste, et autres
Publié: (2026)

Statistical Guarantees for Distributionally Robust Optimization with Optimal Transport and OT-Regularized Divergences
par: Birrell, Jeremiah, et autres
Publié: (2026)

Achieving the Asymptotically Optimal Sample Complexity of Offline Reinforcement Learning: A DRO-Based Approach
par: Wang, Yue, et autres
Publié: (2023)

Efficient Exploration in Average-Reward Constrained Reinforcement Learning: Achieving Near-Optimal Regret With Posterior Sampling
par: Provodin, Danil, et autres
Publié: (2024)

Towards Minimax Optimality of Model-based Robust Reinforcement Learning
par: Clavier, Pierre, et autres
Publié: (2023)

Distributionally Robust Multi-Task Reinforcement Learning via Adaptive Task Sampling
par: Corrado, Nicholas E., et autres
Publié: (2026)

Minimax-Optimal Multi-Agent Robust Reinforcement Learning
par: Jiao, Yuchen, et autres
Publié: (2024)

Projection by Convolution: Optimal Sample Complexity for Reinforcement Learning in Continuous-Space MDPs
par: Maran, Davide, et autres
Publié: (2024)

The Optimal Sample Complexity of Multiclass and List Learning
par: Pabbaraju, Chirag
Publié: (2026)

Near-Optimal Algorithms for Group Distributionally Robust Optimization and Beyond
par: Soma, Tasuku, et autres
Publié: (2022)

Optimal Transport Regularized Divergences: Application to Adversarial Robustness
par: Birrell, Jeremiah, et autres
Publié: (2023)

Tackling Interference Induced by Data Training Loops in A/B Tests: A Weighted Training Approach
par: Si, Nian
Publié: (2023)

Sample-Efficient Distributionally Robust Multi-Agent Reinforcement Learning via Online Interaction
par: Farhat, Zain Ulabedeen, et autres
Publié: (2025)

Q-Measure-Learning for Continuous State RL: Efficient Implementation and Convergence
par: Wang, Shengbo
Publié: (2026)