Federated Q-Learning: Linear Regret Speedup with Low Communication Cost
Fuente:
arXiv
Guardado en:
| Autores principales: | Zheng, Zhong, Gao, Fengyu, Xue, Lingzhou, Yang, Jing |
|---|---|
| Formato: | Preprint |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Regret-Optimal Q-Learning with Low Cost for Single-Agent and Federated Reinforcement Learning
por: Zhang, Haochen, et al.
Publicado: (2025)
por: Zhang, Haochen, et al.
Publicado: (2025)
Federated Q-Learning with Reference-Advantage Decomposition: Almost Optimal Regret and Logarithmic Communication Cost
por: Zheng, Zhong, et al.
Publicado: (2024)
por: Zheng, Zhong, et al.
Publicado: (2024)
Q-Learning with Fine-Grained Gap-Dependent Regret
por: Zhang, Haochen, et al.
Publicado: (2025)
por: Zhang, Haochen, et al.
Publicado: (2025)
Gap-Dependent Bounds for Federated $Q$-learning
por: Zhang, Haochen, et al.
Publicado: (2025)
por: Zhang, Haochen, et al.
Publicado: (2025)
Gap-Dependent Bounds for Q-Learning using Reference-Advantage Decomposition
por: Zheng, Zhong, et al.
Publicado: (2024)
por: Zheng, Zhong, et al.
Publicado: (2024)
Gap-Dependent Bounds for Nearly Minimax Optimal Reinforcement Learning with Linear Function Approximation
por: Zhang, Haochen, et al.
Publicado: (2026)
por: Zhang, Haochen, et al.
Publicado: (2026)
Federated Online Prediction from Experts with Differential Privacy: Separations and Regret Speed-ups
por: Gao, Fengyu, et al.
Publicado: (2024)
por: Gao, Fengyu, 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)
por: Zheng, Zhong, et al.
Publicado: (2023)
Smoothed Robust Phase Retrieval
por: Zheng, Zhong, et al.
Publicado: (2024)
por: Zheng, Zhong, et al.
Publicado: (2024)
Achieving Linear Speedup for Composite Federated Learning
por: Huang, Kun, et al.
Publicado: (2026)
por: Huang, Kun, et al.
Publicado: (2026)
On the Linear Speedup of Personalized Federated Reinforcement Learning with Shared Representations
por: Xiong, Guojun, et al.
Publicado: (2024)
por: Xiong, Guojun, et al.
Publicado: (2024)
Achieving Linear Speedup in Asynchronous Federated Learning with Heterogeneous Clients
por: Wang, Xiaolu, et al.
Publicado: (2024)
por: Wang, Xiaolu, et al.
Publicado: (2024)
Understanding the Statistical Accuracy-Communication Trade-off in Personalized Federated Learning with Minimax Guarantees
por: Yu, Xin, et al.
Publicado: (2024)
por: Yu, Xin, et al.
Publicado: (2024)
A Unified Linear Speedup Analysis of Federated Averaging and Nesterov FedAvg
por: Qu, Zhaonan, et al.
Publicado: (2020)
por: Qu, Zhaonan, et al.
Publicado: (2020)
AltLoRA: Towards Better Gradient Approximation in Low-Rank Adaptation with Alternating Projections
por: Yu, Xin, et al.
Publicado: (2025)
por: Yu, Xin, et al.
Publicado: (2025)
Differentially Private Preference Data Synthesis for Large Language Model Alignment
por: Gao, Fengyu, et al.
Publicado: (2026)
por: Gao, Fengyu, et al.
Publicado: (2026)
Quantum Speedups in Regret Analysis of Infinite Horizon Average-Reward Markov Decision Processes
por: Ganguly, Bhargav, et al.
Publicado: (2023)
por: Ganguly, Bhargav, et al.
Publicado: (2023)
Strongly Consistent Community Detection in Popularity Adjusted Block Models
por: Yuan, Quan, et al.
Publicado: (2025)
por: Yuan, Quan, et al.
Publicado: (2025)
Efficient, Low-Regret, Online Reinforcement Learning for Linear MDPs
por: John, Philips George, et al.
Publicado: (2024)
por: John, Philips George, et al.
Publicado: (2024)
Federated UCBVI: Communication-Efficient Federated Regret Minimization with Heterogeneous Agents
por: Labbi, Safwan, et al.
Publicado: (2024)
por: Labbi, Safwan, et al.
Publicado: (2024)
Beyond $\mathcal{O}(\sqrt{T})$ Regret: Decoupling Learning and Decision-making in Online Linear Programming
por: Gao, Wenzhi, et al.
Publicado: (2025)
por: Gao, Wenzhi, et al.
Publicado: (2025)
Distributed Networked Multi-task Learning
por: Hong, Lingzhou, et al.
Publicado: (2024)
por: Hong, Lingzhou, et al.
Publicado: (2024)
Fast Learnings of Coupled Nonnegative Tensor Decomposition Using Optimal Gradient and Low-rank Approximation
por: Wang, Xiulin, et al.
Publicado: (2023)
por: Wang, Xiulin, et al.
Publicado: (2023)
Low-Regret and Low-Complexity Learning for Hierarchical Inference
por: Chattopadhyay, Sameep, et al.
Publicado: (2025)
por: Chattopadhyay, Sameep, et al.
Publicado: (2025)
Achieving Linear Speedup with ProxSkip in Distributed Stochastic Optimization
por: Guo, Luyao, et al.
Publicado: (2023)
por: Guo, Luyao, et al.
Publicado: (2023)
Minibatch and Local SGD: Algorithmic Stability and Linear Speedup in Generalization
por: Lei, Yunwen, et al.
Publicado: (2023)
por: Lei, Yunwen, et al.
Publicado: (2023)
EXACT: Explicit Attribute-Guided Decoding-Time Personalization
por: Yu, Xin, et al.
Publicado: (2026)
por: Yu, Xin, et al.
Publicado: (2026)
A Copula Graphical Model for Multi-Attribute Data using Optimal Transport
por: Zhang, Qi, et al.
Publicado: (2024)
por: Zhang, Qi, et al.
Publicado: (2024)
Improved Regret of Linear Ensemble Sampling
por: Lee, Harin, et al.
Publicado: (2024)
por: Lee, Harin, et al.
Publicado: (2024)
Bayesian Optimization for Unknown Cost-Varying Variable Subsets with No-Regret Costs
por: Hoang, Vu Viet, et al.
Publicado: (2024)
por: Hoang, Vu Viet, et al.
Publicado: (2024)
Regret Bounds for Episodic Risk-Sensitive Linear Quadratic Regulator
por: Xu, Wenhao, et al.
Publicado: (2024)
por: Xu, Wenhao, et al.
Publicado: (2024)
PrunedLoRA: Robust Gradient-Based structured pruning for Low-rank Adaptation in Fine-tuning
por: Yu, Xin, et al.
Publicado: (2025)
por: Yu, Xin, et al.
Publicado: (2025)
Trading-off Accuracy and Communication Cost in Federated Learning
por: Villani, Mattia Jacopo, et al.
Publicado: (2025)
por: Villani, Mattia Jacopo, et al.
Publicado: (2025)
Data-adaptive Differentially Private Prompt Synthesis for In-Context Learning
por: Gao, Fengyu, et al.
Publicado: (2024)
por: Gao, Fengyu, et al.
Publicado: (2024)
The Sample-Communication Complexity Trade-off in Federated Q-Learning
por: Salgia, Sudeep, et al.
Publicado: (2024)
por: Salgia, Sudeep, et al.
Publicado: (2024)
Approximate Thompson Sampling for Learning Linear Quadratic Regulators with $O(\sqrt{T})$ Regret
por: Kim, Yeoneung, et al.
Publicado: (2024)
por: Kim, Yeoneung, et al.
Publicado: (2024)
Prior Diffusiveness and Regret in the Linear-Gaussian Bandit
por: Zhu, Yifan, et al.
Publicado: (2026)
por: Zhu, Yifan, et al.
Publicado: (2026)
Regret Lower Bounds for Learning Linear Quadratic Gaussian Systems
por: Ziemann, Ingvar, et al.
Publicado: (2022)
por: Ziemann, Ingvar, et al.
Publicado: (2022)
Nearly Minimax Optimal Regret for Learning Linear Mixture Stochastic Shortest Path
por: Di, Qiwei, et al.
Publicado: (2024)
por: Di, Qiwei, et al.
Publicado: (2024)
Hypothesis Testing for High-Dimensional Matrix-Valued Data
por: Cui, Shijie, et al.
Publicado: (2024)
por: Cui, Shijie, et al.
Publicado: (2024)
Ejemplares similares
-
Regret-Optimal Q-Learning with Low Cost for Single-Agent and Federated Reinforcement Learning
por: Zhang, Haochen, et al.
Publicado: (2025) -
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) -
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)