Cover Image

A Finite Sample Complexity Bound for Distributionally Robust Q-learning

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Wang, Shengbo, Si, Nian, Blanchet, Jose, Zhou, Zhengyuan
Format:	Preprint
Published:	2023
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 Variance-reduced Distributionally Robust Q-learning
by: Wang, Shengbo, et al.
Published: (2023)

On the Foundation of Distributionally Robust Reinforcement Learning
by: Wang, Shengbo, et al.
Published: (2023)

Learning Optimal Distributionally Robust Stochastic Control in Continuous State Spaces
by: Wang, Shengbo, et al.
Published: (2024)

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

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

Optimal Sample Complexity for Average Reward Markov Decision Processes
by: Wang, Shengbo, et al.
Published: (2023)

Non-Rectangular Average-Reward Robust MDPs: Optimal Policies and Their Transient Values
by: Wang, Shengbo, et al.
Published: (2026)

Bellman Optimality of Average-Reward Robust Markov Decision Processes with a Constant Gain
by: Wang, Shengbo, et al.
Published: (2025)

Achieving $\varepsilon^{-2}$ Dependence for Average-Reward Q-Learning with a New Contraction Principle
by: Chen, Zijun, et al.
Published: (2026)

Single-Trajectory Distributionally Robust Reinforcement Learning
by: Liang, Zhipeng, et al.
Published: (2023)

Representation-Aware Distributionally Robust Optimization: A Knowledge Transfer Framework
by: Wang, Zitao, et al.
Published: (2025)

Robust Assortment Optimization from Observational Data
by: Lu, Miao, et al.
Published: (2026)

Knowledge-Guided Wasserstein Distributionally Robust Optimization
by: Wang, Zitao, et al.
Published: (2025)

Wasserstein Distributionally Robust Regret Optimization
by: Fiechtner, Lukas-Benedikt, et al.
Published: (2025)

ScoreFusion: Fusing Score-based Generative Models via Kullback-Leibler Barycenters
by: Liu, Hao, et al.
Published: (2024)

Distributionally Robust Policy Learning under Concept Drifts
by: Wang, Jingyuan, et al.
Published: (2024)

Q-Measure-Learning for Continuous State RL: Efficient Implementation and Convergence
by: Wang, Shengbo
Published: (2026)

Central Limit Theorem for Two-Time-Scale Approximate Distributionally Robust RL
by: Wang, Shengbo, et al.
Published: (2026)

Finite-Sample Analysis of Nonlinear Independent Component Analysis:Sample Complexity and Identifiability Bounds
by: Jiang, Yuwen
Published: (2026)

Finite Sample Bounds for Non-Parametric Regression: Optimal Sample Efficiency and Space Complexity
by: Maran, Davide, et al.
Published: (2024)

Wasserstein Distributionally Robust Regret Optimization for Reinforcement Learning from Human Feedback
by: Wang, Yikai, et al.
Published: (2026)

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

Unifying Distributionally Robust Optimization via Optimal Transport Theory
by: Blanchet, Jose, et al.
Published: (2023)

Learning an Optimal Assortment Policy under Observational Data
by: Han, Yuxuan, et al.
Published: (2025)

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

Q-learning with Posterior Sampling
by: Agrawal, Priyank, et al.
Published: (2025)

DRO: A Python Library for Distributionally Robust Optimization in Machine Learning
by: Liu, Jiashuo, et al.
Published: (2025)

Sample Complexity Bounds for Linear System Identification from a Finite Set
by: Chatzikiriakos, Nicolas, et al.
Published: (2024)

Finite-Time Bounds for Average-Reward Fitted Q-Iteration
by: Lee, Jongmin, et al.
Published: (2025)

Gap-Dependent Bounds for Federated $Q$-learning
by: Zhang, Haochen, et al.
Published: (2025)

Variance-Reduced Cascade Q-learning: Algorithms and Sample Complexity
by: Boveiri, Mohammad, et al.
Published: (2024)

Learning the Model While Learning Q: Finite-Time Sample Complexity of Online SyncMBQ
by: Lim, Han-Dong, et al.
Published: (2024)

Q-Distribution guided Q-learning for offline reinforcement learning: Uncertainty penalized Q-value via consistency model
by: Zhang, Jing, et al.
Published: (2024)

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

Finite-Time Error Bounds for Greedy-GQ
by: Wang, Yue, et al.
Published: (2022)

Deep Learning for Markov Chains: Lyapunov Functions, Poisson's Equation, and Stationary Distributions
by: Qu, Yanlin, et al.
Published: (2025)

Duality and Policy Evaluation in Distributionally Robust Bayesian Diffusion Control
by: Blanchet, Jose, et al.
Published: (2025)

Finite-Time Analysis of Simultaneous Double Q-learning
by: Na, Hyunjun, et al.
Published: (2024)

A Measure-Theoretic Finite-Sample Theory for Adaptive-Data Fitted Q-Iteration
by: Haussmann, Manuel, et al.
Published: (2026)

Finite Sample Bounds for Learning with Score Matching
by: Smedira, Devin, et al.
Published: (2026)