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

Zhong Zheng, Haochen Zhang, Lingzhou Xue
2/12/2026

No confident code implementation found for this paper.

Semantic Scholar

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{zheng2026federated,
  title  = {Federated Q-Learning with Reference-Advantage Decomposition: Almost Optimal Regret and Logarithmic Communication Cost},
  author = {Zhong Zheng and Haochen Zhang and Lingzhou Xue},
  year   = {2026},
  url    = {https://api.semanticscholar.org/CorpusID:989400ad87178cee0beaf21e2e044f66f08277e1},
  journal = {ICLR 2025 2025}
}

Discussion