We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We study a Federated Reinforcement Learning (FedRL) problem in which $n$ agents collaboratively learn a single policy without sharing the trajectories they collected during agent-environment interaction. We stress the constraint of environment heterogeneity, which means $n$ environments corresponding to these $n$ agents have different state transitions. To obtain a value function or a policy function which optimizes the overall performance in all environments, we propose two federated RL algorithms, \texttt{QAvg} and \texttt{PAvg}. We theoretically prove that these algorithms converge to suboptimal solutions, while such suboptimality depends on how heterogeneous these $n$ environments are. Moreover, we propose a heuristic that achieves personalization by embedding the $n$ environments into $n$ vectors. The personalization heuristic not only improves the training but also allows for better generalization to new environments.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2204.02634")
get_code_for_paper("2204.02634")
have("2204.02634")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2204.02634.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2204.02634)
Connect an agent — have() is free.