Copertina

Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Li, Gen, Cai, Changxiao, Chen, Yuxin, Wei, Yuting, Chi, Yuejie
Natura:	Preprint
Pubblicazione:	2021
Soggetti:	Machine Learning Information Theory Optimization and Control Statistics Theory
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

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

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

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

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

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

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

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

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

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

Diffusion Models Are Statistically Optimal for Learning Low-Dimensional Multi-Modal Distributions
di: Wu, Jingda, et al.
Pubblicazione: (2026)

The Plug-in Approach for Average-Reward and Discounted MDPs: Optimal Sample Complexity Analysis
di: Zurek, Matthew, et al.
Pubblicazione: (2024)

Stochastic Zeroth-Order Optimization under Strongly Convexity and Lipschitz Hessian: Minimax Sample Complexity
di: Yu, Qian, et al.
Pubblicazione: (2024)

Span-Based Optimal Sample Complexity for Average Reward MDPs
di: Zurek, Matthew, et al.
Pubblicazione: (2023)

Span-Agnostic Optimal Sample Complexity and Oracle Inequalities for Average-Reward RL
di: Zurek, Matthew, et al.
Pubblicazione: (2025)

Finite-Time Minimax Bounds and an Optimal Lyapunov Policy in Queueing Control
di: Liu, Yujie, et al.
Pubblicazione: (2025)

Stochastic Optimization with Optimal Importance Sampling
di: Aolaritei, Liviu, et al.
Pubblicazione: (2025)

Span-Based Optimal Sample Complexity for Weakly Communicating and General Average Reward MDPs
di: Zurek, Matthew, et al.
Pubblicazione: (2024)

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

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

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

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

In-Context Learning with Representations: Contextual Generalization of Trained Transformers
di: Yang, Tong, et al.
Pubblicazione: (2024)

Multi-head Transformers Provably Learn Symbolic Multi-step Reasoning via Gradient Descent
di: Yang, Tong, et al.
Pubblicazione: (2025)

Stochastic Smoothed Gradient Descent Ascent for Federated Minimax Optimization
di: Shen, Wei, et al.
Pubblicazione: (2023)

Denoising Diffusions with Optimal Transport: Localization, Curvature, and Multi-Scale Complexity
di: Liang, Tengyuan, et al.
Pubblicazione: (2024)

Adaptation to Intrinsic Dependence in Diffusion Language Models
di: Zhao, Yunxiao, et al.
Pubblicazione: (2026)

On the Sample Complexity of Set Membership Estimation for Linear Systems with Disturbances Bounded by Convex Sets
di: Xu, Haonan, et al.
Pubblicazione: (2024)

Dimension-Free Convergence of Diffusion Models for Approximate Gaussian Mixtures
di: Li, Gen, et al.
Pubblicazione: (2025)

Error Analysis of Triangular Optimal Transport Maps for Filtering
di: Al-Jarrah, Mohammad, et al.
Pubblicazione: (2025)

Non-convex matrix sensing: Breaking the quadratic rank barrier in the sample complexity
di: Stöger, Dominik, et al.
Pubblicazione: (2024)

Ensemble-Conditional Gaussian Processes (Ens-CGP): Representation, Geometry, and Inference
di: Ravela, Sai, et al.
Pubblicazione: (2026)

Gradient descent inference in empirical risk minimization
di: Han, Qiyang, et al.
Pubblicazione: (2024)

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

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

Learning and Decision-Making with Data: Optimal Formulations and Phase Transitions
di: Bennouna, Amine, et al.
Pubblicazione: (2021)

Frequentist Regret Analysis of Gaussian Process Thompson Sampling via Fractional Posteriors
di: Roy, Somjit, et al.
Pubblicazione: (2026)

An Improved Analysis of Langevin Algorithms with Prior Diffusion for Non-Log-Concave Sampling
di: Huang, Xunpeng, et al.
Pubblicazione: (2024)