Cover Image

Distributionally Robust Model-Based Offline Reinforcement Learning with Near-Optimal Sample Complexity

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Shi, Laixi, Chi, Yuejie
Format:	Preprint
Published:	2022
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Sample Complexity of Offline Distributionally Robust Linear Markov Decision Processes
by: Wang, He, et al.
Published: (2024)

Settling the Sample Complexity of Model-Based Offline Reinforcement Learning
by: Li, Gen, et al.
Published: (2022)

Sample-Efficient Robust Multi-Agent Reinforcement Learning in the Face of Environmental Uncertainty
by: Shi, Laixi, et al.
Published: (2024)

Federated Offline Reinforcement Learning: Collaborative Single-Policy Coverage Suffices
by: Woo, Jiin, et al.
Published: (2024)

The Curious Price of Distributional Robustness in Reinforcement Learning with a Generative Model
by: Shi, Laixi, et al.
Published: (2023)

Breaking the Curse of Multiagency in Robust Multi-Agent Reinforcement Learning
by: Shi, Laixi, et al.
Published: (2024)

Robust Gymnasium: A Unified Modular Benchmark for Robust Reinforcement Learning
by: Gu, Shangding, et al.
Published: (2025)

Near-Optimal Sample Complexities of Divergence-based S-rectangular Distributionally Robust Reinforcement Learning
by: Li, Zhenghao, et al.
Published: (2025)

The Sample-Communication Complexity Trade-off in Federated Q-Learning
by: Salgia, Sudeep, et al.
Published: (2024)

Distributionally Robust Constrained Reinforcement Learning under Strong Duality
by: Zhang, Zhengfei, et al.
Published: (2024)

Sample Complexity of Average-Reward Q-Learning: From Single-agent to Federated Reinforcement Learning
by: Jiao, Yuchen, et al.
Published: (2026)

BECAUSE: Bilinear Causal Representation for Generalizable Offline Model-based Reinforcement Learning
by: Lin, Haohong, et al.
Published: (2024)

Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model
by: Li, Gen, et al.
Published: (2020)

Achieving the Asymptotically Optimal Sample Complexity of Offline Reinforcement Learning: A DRO-Based Approach
by: Wang, Yue, et al.
Published: (2023)

Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning
by: Kayal, Aya, et al.
Published: (2025)

Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis
by: Li, Gen, et al.
Published: (2021)

Hybrid Transfer Reinforcement Learning: Provable Sample Efficiency from Shifted-Dynamics Data
by: Qu, Chengrui, et al.
Published: (2024)

Conceptual Belief-Informed Reinforcement Learning
by: Gu, Xingrui, et al.
Published: (2024)

Taming the Curses of Multiagency in Robust Markov Games with Large State Space through Linear Function Approximation
by: Gai, Jingchu, et al.
Published: (2026)

ORVIT: Near-Optimal Online Distributionally Robust Reinforcement Learning
by: Ghosh, Debamita, et al.
Published: (2025)

Near Optimal Non-asymptotic Sample Complexity of 1-Identification
by: Li, Zitian, et al.
Published: (2025)

Provably Robust Score-Based Diffusion Posterior Sampling for Plug-and-Play Image Reconstruction
by: Xu, Xingyu, et al.
Published: (2024)

Enhancing Efficiency of Safe Reinforcement Learning via Sample Manipulation
by: Gu, Shangding, et al.
Published: (2024)

Near-Optimal Sample Complexity for Iterated CVaR Reinforcement Learning with a Generative Model
by: Deng, Zilong, et al.
Published: (2025)

Minimax Optimal and Computationally Efficient Algorithms for Distributionally Robust Offline Reinforcement Learning
by: Liu, Zhishuai, et al.
Published: (2024)

Nearly Optimal Sample Complexity for Learning with Label Proportions
by: Busa-Fekete, Robert, et al.
Published: (2025)

Sample-Efficient Tabular Self-Play for Offline Robust Reinforcement Learning
by: Li, Na, et al.
Published: (2025)

Sample Complexity of Distributionally Robust Average-Reward Reinforcement Learning
by: Chen, Zijun, et al.
Published: (2025)

Overcoming the Curse of Dimensionality in Reinforcement Learning Through Approximate Factorization
by: Lu, Chenbei, et al.
Published: (2024)

Near-Minimax-Optimal Distributional Reinforcement Learning with a Generative Model
by: Rowland, Mark, et al.
Published: (2024)

Distributionally Robust Reinforcement Learning with Interactive Data Collection: Fundamental Hardness and Near-Optimal Algorithm
by: Lu, Miao, et al.
Published: (2024)

Statistical and Algorithmic Foundations of Reinforcement Learning
by: Chi, Yuejie, et al.
Published: (2025)

Epistemic Robust Offline Reinforcement Learning
by: Chenreddy, Abhilash Reddy, et al.
Published: (2026)

Belief-Based Offline Reinforcement Learning for Delay-Robust Policy Optimization
by: Zhan, Simon Sinong, et al.
Published: (2025)

Rethinking Optimal Transport in Offline Reinforcement Learning
by: Asadulaev, Arip, et al.
Published: (2024)

Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity
by: Arnob, Samin Yeasar, et al.
Published: (2025)

Agentic Transformers Provably Learn to Search via Reinforcement Learning
by: Yang, Tong, et al.
Published: (2026)

Sparse Offline Reinforcement Learning with Corruption Robustness
by: Tran, Nam Phuong, et al.
Published: (2025)

Near-Optimal Sample Complexity for Online Constrained MDPs
by: Liu, Chang, et al.
Published: (2026)

Model-Free Robust Reinforcement Learning with Sample Complexity Analysis
by: Wang, Yudan, et al.
Published: (2024)