arXiv (All)
open access
Personalized Federated Reinforcement Learning via Model-Agnostic Meta-Learning: Convergence of Exact and Hessian-Free Meta-Policy Gradients
We study personalized federated reinforcement learning, in which $n$ agents, each acting in its own Markov decision process, collaborate through a server to learn a shared MAML-style policy initialization that becomes effective for an individual agent once that agent adapts it with a single local po
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Sample Efficient Hierarchical Reinforcement Learning via Best Policy Identification#422271
- Freeform Preference Learning for Robotic Manipulation#324873
- Fairness-Aware Federated Learning with Trajectory Shapley Value#238593
- Near-Optimal Reinforcement Learning with Multi-Step Transition Lookahead#999493
- Almost Sure Convergence of Networked Policy Gradient over Time-Varying Networks in Markov Potential Games#1035271
Record · ID 1037516
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive