Cover Image

The Sample-Communication Complexity Trade-off in Federated Q-Learning

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Salgia, Sudeep, Chi, Yuejie
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Characterizing the Accuracy-Communication-Privacy Trade-off in Distributed Stochastic Convex Optimization
by: Salgia, Sudeep, et al.
Published: (2025)

Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis
by: Li, Gen, et al.
Published: (2021)

Communication-Efficient Federated Optimization over Semi-Decentralized Networks
by: Wang, He, et al.
Published: (2023)

Trade-off in Estimating the Number of Byzantine Clients in Federated Learning
by: Chen, Ziyi, et al.
Published: (2025)

Exploration from a Primal-Dual Lens: Value-Incentivized Actor-Critic Methods for Sample-Efficient Online RL
by: Yang, Tong, et al.
Published: (2025)

A Theoretical Analysis of Self-Supervised Learning for Vision Transformers
by: Huang, Yu, et al.
Published: (2024)

When to Forget? Complexity Trade-offs in Machine Unlearning
by: Van Waerebeke, Martin, et al.
Published: (2025)

Communication-efficient Vertical Federated Learning via Compressed Error Feedback
by: Valdeira, Pedro, et al.
Published: (2024)

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

Sample Complexity of Variance-reduced Distributionally Robust Q-learning
by: Wang, Shengbo, et al.
Published: (2023)

Agentic Transformers Provably Learn to Search via Reinforcement Learning
by: Yang, Tong, et al.
Published: (2026)

Variance-Reduced Cascade Q-learning: Algorithms and Sample Complexity
by: Boveiri, Mohammad, et al.
Published: (2024)

Vertical Federated Learning with Missing Features During Training and Inference
by: Valdeira, Pedro, et al.
Published: (2024)

Optimization Trade-offs in Asynchronous Federated Learning: A Stochastic Networks Approach
by: Alahyane, Abdelkrim, et al.
Published: (2026)

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

Transformers Provably Learn Chain-of-Thought Reasoning with Length Generalization
by: Huang, Yu, et al.
Published: (2025)

The Power of Preconditioning in Overparameterized Low-Rank Matrix Sensing
by: Xu, Xingyu, et al.
Published: (2023)

Preconditioning Benefits of Spectral Orthogonalization in Muon
by: Ma, Jianhao, et al.
Published: (2026)

Provably Robust Score-Based Diffusion Posterior Sampling for Plug-and-Play Image Reconstruction
by: Xu, Xingyu, et al.
Published: (2024)

A Multi-Token Coordinate Descent Method for Semi-Decentralized Vertical Federated Learning
by: Valdeira, Pedro, et al.
Published: (2023)

How hard is learning to cut? Trade-offs and sample complexity
by: Khalife, Sammy, et al.
Published: (2025)

Beyond Expectations: Learning with Stochastic Dominance Made Practical
by: Cen, Shicong, et al.
Published: (2024)

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

On Convergence of Average-Reward Q-Learning in Weakly Communicating Markov Decision Processes
by: Wan, Yi, et al.
Published: (2024)

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

Multiplayer Federated Learning: Reaching Equilibrium with Less Communication
by: Yoon, TaeHo, et al.
Published: (2025)

Sample Complexity of Distributionally Robust Average-Reward Reinforcement Learning
by: Chen, Zijun, et al.
Published: (2025)

Communication Efficient Federated Learning with Linear Convergence on Heterogeneous Data
by: Liu, Jie, et al.
Published: (2025)

The Implicit Curriculum: Learning Dynamics in RL with Verifiable Rewards
by: Huang, Yu, et al.
Published: (2026)

Convergence and Sample Complexity of First-Order Methods for Agnostic Reinforcement Learning
by: Sherman, Uri, et al.
Published: (2025)

Sample Complexity of the Linear Quadratic Regulator: A Reinforcement Learning Lens
by: Moghaddam, Amirreza Neshaei, et al.
Published: (2024)

The Sample Complexity of Online Reinforcement Learning: A Multi-model Perspective
by: Muehlebach, Michael, et al.
Published: (2025)

Accelerated Methods with Complexity Separation Under Data Similarity for Federated Learning Problems
by: Bylinkin, Dmitry, et al.
Published: (2026)

Provable Reduction in Communication Rounds for Non-Smooth Convex Federated Learning
by: Palenzuela, Karlo, et al.
Published: (2025)

Information Theoretically Optimal Sample Complexity of Learning Dynamical Directed Acyclic Graphs
by: Veedu, Mishfad Shaikh, et al.
Published: (2023)

A Convex Loss Function for Set Prediction with Optimal Trade-offs Between Size and Conditional Coverage
by: Bach, Francis
Published: (2025)

Adaptive Federated Minimax Optimization with Lower Complexities
by: Huang, Feihu, et al.
Published: (2022)

Sample Complexity of Stochastic Optimization with Integer Variables
by: Cheng, Hongyu, et al.
Published: (2026)

Delayed Momentum Aggregation: Communication-efficient Byzantine-robust Federated Learning with Partial Participation
by: Otsuka, Kaoru, et al.
Published: (2025)

Policy Mirror Descent with Temporal Difference Learning: Sample Complexity under Online Markov Data
by: Li, Wenye, et al.
Published: (2025)