The Sample-Communication Complexity Trade-off in Federated Q-Learning | NSF Public Access Repository

skip to main content

An official website of the United States government Here's how you know

Official websites use .gov

A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS

A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Citation Details

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

Award ID(s):: 2007911 2106778 2148212 2318441

PAR ID:: 10593009

Author(s) / Creator(s):: Salgia, Sudeep; Chi, Yuejie

Publisher / Repository:: 38th Conference on Neural Information Processing Systems

Date Published:: 2024-12-10

Format(s):: Medium: X

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
Accepted Manuscript
Conference Paper:
The DOI is not currently available.