PAC Guarantees For Cooperative Multi-agent Reinforcement Learning With Restricted Communication

Abstract

We develop model free PAC performance guarantees for multiple concurrent MDPs, extending recent works where a single learner interacts with multiple non-interacting agents in a noise free environment. Our framework allows noisy and resource limited communication between agents, and develops novel PAC guarantees in this extended setting. By allowing communication between the agents themselves, we suggest improved PAC-exploration algorithms that can overcome the communication noise and lead to improved sample complexity bounds. We provide a theoretically motivated algorithm that optimally combines information from the resource limited agents, thereby analyzing the interaction between noise and communication constraints that are ubiquitous in real-world systems. We present empirical results for a simple task that supports our theoretical formulations and improve upon naive information fusion methods.

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyraveh2019pac

Related papers

• Multi-agent Reinforcement Learning With Communication-constrained Priors (2025)0.00
• Effective Communications: A Joint Learning And Communication Framework For Multi-agent Reinforcement Learning Over Noisy Channels (2021)0.00
• Provably Efficient Cooperative Multi-agent Reinforcement Learning With Function Approximation (2021)0.00
• Asynchronous Cooperative Multi-agent Reinforcement Learning With Limited Communication (2025)0.00
• Pareto Actor-critic For Communication And Computation Co-optimization In Non-cooperative Federated Learning Services (2025)0.00
• Cooperative Multi-agent Reinforcement Learning: Asynchronous Communication And Linear Function Approximation (2023)0.00
• Multi-agent Deep Reinforcement Learning With Extremely Noisy Observations (2018)0.00
• Counterfactual Multi-agent Reinforcement Learning With Graph Convolution Communication (2020)0.00