Cover Image

Settling the Sample Complexity of Model-Based Offline Reinforcement Learning

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Li, Gen, Shi, Laixi, Chen, Yuxin, Chi, Yuejie, Wei, Yuting
Format:	Preprint
Published:	2022
Subjects:	Machine Learning Information Theory Systems and Control Statistics Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

Towards Faster Non-Asymptotic Convergence for Diffusion-Based Generative Models
by: Li, Gen, et al.
Published: (2023)

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

Minimax-Optimal Reward-Agnostic Exploration in Reinforcement Learning
by: Li, Gen, et al.
Published: (2023)

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

High-probability sample complexities for policy evaluation with linear function approximation
by: Li, Gen, et al.
Published: (2023)

Model-Based Reinforcement Learning for Offline Zero-Sum Markov Games
by: Yan, Yuling, et al.
Published: (2022)

Accelerating Convergence of Score-Based Diffusion Models, Provably
by: Li, Gen, et al.
Published: (2024)

A Sharp Convergence Theory for The Probability Flow ODEs of Diffusion Models
by: Li, Gen, et al.
Published: (2024)

Distributionally Robust Model-Based Offline Reinforcement Learning with Near-Optimal Sample Complexity
by: Shi, Laixi, et al.
Published: (2022)

Towards a mathematical theory for consistency training in diffusion models
by: Li, Gen, et al.
Published: (2024)

A non-asymptotic distributional theory of approximate message passing for sparse and robust regression
by: Li, Gen, et al.
Published: (2024)

Efficient Sampling with Discrete Diffusion Models: Sharp and Adaptive Guarantees
by: Dmitriev, Daniil, et al.
Published: (2026)

Sample Complexity of the Sign-Perturbed Sums Identification Method: Scalar Case
by: Szentpéteri, Szabolcs, et al.
Published: (2024)

Breaking AR's Sampling Bottleneck: Provable Acceleration via Diffusion Language Models
by: Li, Gen, et al.
Published: (2025)

Finite-Sample Identification of Linear Regression Models with Residual-Permuted Sums
by: Szentpéteri, Szabolcs, et al.
Published: (2024)

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

Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods
by: Li, Gen, et al.
Published: (2023)

Pessimism Meets Risk: Risk-Sensitive Offline Reinforcement Learning
by: Zhang, Dake, et al.
Published: (2024)

Minimax Optimality of the Probability Flow ODE for Diffusion Models
by: Cai, Changxiao, et al.
Published: (2025)

Differentially Private Distributed Estimation and Learning
by: Papachristou, Marios, et al.
Published: (2023)

Transformers Meet In-Context Learning: A Universal Approximation Theory
by: Li, Gen, et al.
Published: (2025)

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

Optimal Single-Policy Sample Complexity and Transient Coverage for Average-Reward Offline RL
by: Zurek, Matthew, et al.
Published: (2025)

Optimal transport natural gradient for statistical manifolds with continuous sample space
by: Chen, Yifan, et al.
Published: (2018)

The Sample Complexity of Simple Binary Hypothesis Testing
by: Pensia, Ankit, et al.
Published: (2024)

On the Sample Complexity of Robust Binary Hypothesis Testing
by: Vallinayagam, Shankar, et al.
Published: (2026)

Faster Diffusion Models via Higher-Order Approximation
by: Li, Gen, et al.
Published: (2025)

Kernel Mean Embedding Topology: Weak and Strong Forms for Stochastic Kernels and Implications for Model Learning
by: Saldi, Naci, et al.
Published: (2025)

The Local Landscape of Phase Retrieval Under Limited Samples
by: Liu, Kaizhao, et al.
Published: (2023)

Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity
by: Lau, Ivan, et al.
Published: (2025)

The Sample Complexity of Distributed Simple Binary Hypothesis Testing under Information Constraints
by: Kazemi, Hadi, et al.
Published: (2025)

Learning linear dynamical systems under convex constraints
by: Tyagi, Hemant, et al.
Published: (2023)

Joint Learning of Linear Dynamical Systems under Smoothness Constraints
by: Tyagi, Hemant
Published: (2024)

Optimal training-conditional regret for online conformal prediction
by: Liang, Jiadong, et al.
Published: (2026)

Long-time dynamics and universality of nonconvex gradient descent
by: Han, Qiyang
Published: (2025)

Mixing Time of the Proximal Sampler in Relative Fisher Information via Strong Data Processing Inequality
by: Wibisono, Andre
Published: (2025)

Covert Bayesian Quickest Change Detection
by: Lo, Yun-Feng, et al.
Published: (2026)