Image de couverture de livre

Optimal Single-Policy Sample Complexity and Transient Coverage for Average-Reward Offline RL

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Zurek, Matthew, Zamir, Guy, Chen, Yudong
Format:	Preprint
Publié:	2025
Sujets:	Machine Learning Information Theory Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Span-Agnostic Optimal Sample Complexity and Oracle Inequalities for Average-Reward RL
par: Zurek, Matthew, et autres
Publié: (2025)

Span-Based Optimal Sample Complexity for Average Reward MDPs
par: Zurek, Matthew, et autres
Publié: (2023)

The Plug-in Approach for Average-Reward and Discounted MDPs: Optimal Sample Complexity Analysis
par: Zurek, Matthew, et autres
Publié: (2024)

Span-Based Optimal Sample Complexity for Weakly Communicating and General Average Reward MDPs
par: Zurek, Matthew, et autres
Publié: (2024)

Optimal Variance-Dependent Regret Bounds for Infinite-Horizon MDPs
par: Zamir, Guy, et autres
Publié: (2026)

Gap-Free Clustering: Sensitivity and Robustness of SDP
par: Zurek, Matthew, et autres
Publié: (2023)

Faster Fixed-Point Methods for Multichain MDPs
par: Zurek, Matthew, et autres
Publié: (2025)

Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis
par: Li, Gen, et autres
Publié: (2021)

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

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

Finite-Time Minimax Bounds and an Optimal Lyapunov Policy in Queueing Control
par: Liu, Yujie, et autres
Publié: (2025)

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

Stochastic Zeroth-Order Optimization under Strongly Convexity and Lipschitz Hessian: Minimax Sample Complexity
par: Yu, Qian, et autres
Publié: (2024)

Geometry, Computation, and Optimality in Stochastic Optimization
par: Cheng, Chen, et autres
Publié: (2019)

On the Robustness of Cross-Concentrated Sampling for Matrix Completion
par: Cai, HanQin, et autres
Publié: (2024)

Structured Sampling for Robust Euclidean Distance Geometry
par: Kundu, Chandra, et autres
Publié: (2024)

Optimal transport natural gradient for statistical manifolds with continuous sample space
par: Chen, Yifan, et autres
Publié: (2018)

Wasserstein Distributionally Robust Estimation in High Dimensions: Performance Analysis and Optimal Hyperparameter Tuning
par: Aolaritei, Liviu, et autres
Publié: (2022)

A Single-Loop First-Order Algorithm for Linearly Constrained Bilevel Optimization
par: Shen, Wei, et autres
Publié: (2025)

Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model
par: Li, Gen, et autres
Publié: (2020)

Achieving Tractable Minimax Optimal Regret in Average Reward MDPs
par: Boone, Victor, et autres
Publié: (2024)

Settling the Sample Complexity of Model-Based Offline Reinforcement Learning
par: Li, Gen, et autres
Publié: (2022)

Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods
par: Li, Gen, et autres
Publié: (2023)

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

Optimal Online Bookmaking for Binary Games
par: Bhatt, Alankrita, et autres
Publié: (2025)

Linear regression with overparameterized linear neural networks: Tight upper and lower bounds for implicit $\ell^1$-regularization
par: Matt, Hannes, et autres
Publié: (2025)

A Neural Network Algorithm for KL Divergence Estimation with Quantitative Error Bounds
par: Foss, Mikil, et autres
Publié: (2025)

A Dual Basis Approach for Structured Robust Euclidean Distance Geometry
par: Kundu, Chandra, et autres
Publié: (2025)

On the Convergence Analysis of Muon
par: Shen, Wei, et autres
Publié: (2025)

MLorc: Momentum Low-rank Compression for Memory Efficient Large Language Model Adaptation
par: Shen, Wei, et autres
Publié: (2025)

Convexity in Disguise: A Theoretical Framework for Nonconvex Low-Rank Matrix Estimation
par: Cui, Chengyu, et autres
Publié: (2026)

Recovering Simultaneously Structured Data via Non-Convex Iteratively Reweighted Least Squares
par: Kümmerle, Christian, et autres
Publié: (2023)

Generalized Orthogonal Procrustes Problem under Arbitrary Adversaries
par: Ling, Shuyang
Publié: (2021)

Stochastic Smoothed Gradient Descent Ascent for Federated Minimax Optimization
par: Shen, Wei, et autres
Publié: (2023)

Tight Regret Bounds for Bayesian Optimization in One Dimension
par: Scarlett, Jonathan
Publié: (2018)

Variational Inference on the Boolean Hypercube with the Quantum Entropy
par: Beyler, Eliot, et autres
Publié: (2024)

The augmented NLP bound for maximum-entropy remote sampling
par: Ponte, Gabriel, et autres
Publié: (2026)

More is Less: Inducing Sparsity via Overparameterization
par: Chou, Hung-Hsu, et autres
Publié: (2021)

Adversarial Water-Filling: Theory, Algorithms and Foundation Model
par: Tong, Xindi, et autres
Publié: (2026)

Group Projected Subspace Pursuit for Block Sparse Signal Reconstruction: Convergence Analysis and Applications
par: He, Roy Y., et autres
Publié: (2024)