Cover Image

Federated Q-Learning with Reference-Advantage Decomposition: Almost Optimal Regret and Logarithmic Communication Cost

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Zheng, Zhong, Zhang, Haochen, Xue, Lingzhou
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Regret-Optimal Q-Learning with Low Cost for Single-Agent and Federated Reinforcement Learning
by: Zhang, Haochen, et al.
Published: (2025)

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

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

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

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

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

Smoothed Robust Phase Retrieval
by: Zheng, Zhong, et al.
Published: (2024)

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

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

Generalized Linear Bandits: Almost Optimal Regret with One-Pass Update
by: Zhang, Yu-Jie, et al.
Published: (2025)

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

Logarithmic Regret for Nonlinear Control
by: Wang, James, et al.
Published: (2025)

Bayesian Optimisation with Unknown Hyperparameters: Regret Bounds Logarithmically Closer to Optimal
by: Ziomek, Juliusz, et al.
Published: (2024)

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

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

Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret
by: Qian, Jiachen, et al.
Published: (2025)

Logarithmic Regret and Polynomial Scaling in Online Multi-step-ahead Prediction
by: Qian, Jiachen, et al.
Published: (2025)

Finite-Time Logarithmic Bayes Regret Upper Bounds
by: Atsidakou, Alexia, et al.
Published: (2023)

Degeneracy is OK: Logarithmic Regret for Network Revenue Management with Indiscrete Distributions
by: Jiang, Jiashuo, et al.
Published: (2022)

Logarithmic Neyman Regret for Adaptive Estimation of the Average Treatment Effect
by: Neopane, Ojash, et al.
Published: (2024)

Logarithmic Regret of Exploration in Average Reward Markov Decision Processes
by: Boone, Victor, et al.
Published: (2025)

Logarithmic-Regret Quantum Learning Algorithms for Zero-Sum Games
by: Gao, Minbo, et al.
Published: (2023)

Strongly Consistent Community Detection in Popularity Adjusted Block Models
by: Yuan, Quan, et al.
Published: (2025)

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

Learning Pure Quantum States in Any Dimension (Almost) Without Regret
by: Lumbreras, Josep, et al.
Published: (2026)

Distributed Online Convex Optimization with Compressed Communication: Optimal Regret and Applications
by: Yang, Sifan, et al.
Published: (2026)

Online Nonstochastic Prediction: Logarithmic Regret via Predictive Online Least Squares
by: Pai, Chih-Fan, et al.
Published: (2026)

Simple Projection-Free Algorithm for Contextual Recommendation with Logarithmic Regret and Robustness
by: Sakaue, Shinsaku
Published: (2026)

Logarithmic Regret for Unconstrained Submodular Maximization Stochastic Bandit
by: Zhou, Julien, et al.
Published: (2024)

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

Almost Surely $\sqrt{T}$ Regret for Adaptive LQR
by: Lu, Yiwen, et al.
Published: (2023)

Exploration by Optimization with Hybrid Regularizers: Logarithmic Regret with Adversarial Robustness in Partial Monitoring
by: Tsuchiya, Taira, et al.
Published: (2024)

Local Anti-Concentration Class: Logarithmic Regret for Greedy Linear Contextual Bandit
by: Kim, Seok-Jin, et al.
Published: (2024)

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

Statistical Convergence Rates of Optimal Transport Map Estimation between General Distributions
by: Ding, Yizhe, et al.
Published: (2024)

Extra Clients at No Extra Cost: Overcome Data Heterogeneity in Federated Learning with Filter Decomposition
by: Chen, Wei, et al.
Published: (2025)

Complexity as Advantage: A Regret-Based Perspective on Emergent Structure
by: Naparstek, Oshri
Published: (2025)

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

Eventually LIL Regret: Almost Sure $\ln\ln T$ Regret for a sub-Gaussian Mixture on Unbounded Data
by: Agrawal, Shubhada, et al.
Published: (2025)

EXACT: Explicit Attribute-Guided Decoding-Time Personalization
by: Yu, Xin, et al.
Published: (2026)