Imagen de Portada

Regret-Optimal Q-Learning with Low Cost for Single-Agent and Federated Reinforcement Learning

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Zhang, Haochen, Zheng, Zhong, Xue, Lingzhou
Formato:	Preprint
Publicado:	2025
Materias:	Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Federated Q-Learning with Reference-Advantage Decomposition: Almost Optimal Regret and Logarithmic Communication Cost
por: Zheng, Zhong, et al.
Publicado: (2024)

Q-Learning with Fine-Grained Gap-Dependent Regret
por: Zhang, Haochen, et al.
Publicado: (2025)

Federated Q-Learning: Linear Regret Speedup with Low Communication Cost
por: Zheng, Zhong, et al.
Publicado: (2023)

Gap-Dependent Bounds for Nearly Minimax Optimal Reinforcement Learning with Linear Function Approximation
por: Zhang, Haochen, et al.
Publicado: (2026)

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

Gap-Dependent Bounds for Q-Learning using Reference-Advantage Decomposition
por: Zheng, Zhong, et al.
Publicado: (2024)

Smoothed Robust Phase Retrieval
por: Zheng, Zhong, et al.
Publicado: (2024)

A New Inexact Proximal Linear Algorithm with Adaptive Stopping Criteria for Robust Phase Retrieval
por: Zheng, Zhong, et al.
Publicado: (2023)

Optimal Dynamic Regret by Transformers for Non-Stationary Reinforcement Learning
por: Chen, Baiyuan, et al.
Publicado: (2025)

Kernelized Reinforcement Learning with Order Optimal Regret Bounds
por: Vakili, Sattar, et al.
Publicado: (2023)

A Copula Graphical Model for Multi-Attribute Data using Optimal Transport
por: Zhang, Qi, et al.
Publicado: (2024)

Transfer in Reinforcement Learning via Regret Bounds for Learning Agents
por: Tuynman, Adrienne, et al.
Publicado: (2022)

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

Open Problem: Order Optimal Regret Bounds for Kernel-Based Reinforcement Learning
por: Vakili, Sattar
Publicado: (2024)

Provably Efficient Exploration in Quantum Reinforcement Learning with Logarithmic Worst-Case Regret
por: Zhong, Han, et al.
Publicado: (2023)

Optimal Regret for Single Index Bandits
por: Dey, Devdan, et al.
Publicado: (2026)

Distributed Networked Multi-task Learning
por: Hong, Lingzhou, et al.
Publicado: (2024)

Tackling Heavy-Tailed Rewards in Reinforcement Learning with Function Approximation: Minimax Optimal and Instance-Dependent Regret Bounds
por: Huang, Jiayi, et al.
Publicado: (2023)

Efficient, Low-Regret, Online Reinforcement Learning for Linear MDPs
por: John, Philips George, et al.
Publicado: (2024)

AltLoRA: Towards Better Gradient Approximation in Low-Rank Adaptation with Alternating Projections
por: Yu, Xin, et al.
Publicado: (2025)

Logarithmic Regret for Online KL-Regularized Reinforcement Learning
por: Zhao, Heyang, et al.
Publicado: (2025)

Stochastic Minimum-Cost Reach-Avoid Reinforcement Learning
por: Pan, Jingduo, et al.
Publicado: (2026)

ProFL: Performative Robust Optimal Federated Learning
por: Zheng, Xue, et al.
Publicado: (2024)

Low-Regret and Low-Complexity Learning for Hierarchical Inference
por: Chattopadhyay, Sameep, et al.
Publicado: (2025)

Tighter Regret Bounds for Contextual Action-Set Reinforcement Learning
por: Chen, Zijun, et al.
Publicado: (2026)

Stagewise Reinforcement Learning and the Geometry of the Regret Landscape
por: Elliott, Chris, et al.
Publicado: (2026)

Understanding the Statistical Accuracy-Communication Trade-off in Personalized Federated Learning with Minimax Guarantees
por: Yu, Xin, et al.
Publicado: (2024)

No-Regret Reinforcement Learning in Smooth MDPs
por: Maran, Davide, et al.
Publicado: (2024)

Improved Regret Bound for Safe Reinforcement Learning via Tighter Cost Pessimism and Reward Optimism
por: Yu, Kihyun, et al.
Publicado: (2024)

Test-Time Regret Minimization in Meta Reinforcement Learning
por: Mutti, Mirco, et al.
Publicado: (2024)

Efficient Exploration in Average-Reward Constrained Reinforcement Learning: Achieving Near-Optimal Regret With Posterior Sampling
por: Provodin, Danil, et al.
Publicado: (2024)

Federated UCBVI: Communication-Efficient Federated Regret Minimization with Heterogeneous Agents
por: Labbi, Safwan, et al.
Publicado: (2024)

Tail Distribution of Regret in Optimistic Reinforcement Learning
por: Khodadadian, Sajad, et al.
Publicado: (2025)

Regret-Free Reinforcement Learning for LTL Specifications
por: Majumdar, Rupak, et al.
Publicado: (2024)

Regret-Based Defense in Adversarial Reinforcement Learning
por: Belaire, Roman, et al.
Publicado: (2023)

Reinforcement Learning and Regret Bounds for Admission Control
por: Weber, Lucas, et al.
Publicado: (2024)

Disentangling Recognition and Decision Regrets in Image-Based Reinforcement Learning
por: Hüyük, Alihan, et al.
Publicado: (2024)

Minimax-Optimal Multi-Agent Robust Reinforcement Learning
por: Jiao, Yuchen, et al.
Publicado: (2024)

Fast and Regret Optimal Best Arm Identification: Fundamental Limits and Low-Complexity Algorithms
por: Zhang, Qining, et al.
Publicado: (2023)

In-Context Compositional Q-Learning for Offline Reinforcement Learning
por: Xu, Qiushui, et al.
Publicado: (2025)