Can Optimal Transport Improve Federated Inverse Reinforcement Learning?

Abstract

In robotics and multi-agent systems, fleets of autonomous agents often operate in subtly different environments while pursuing a common high-level objective. Directly pooling their data to learn a shared reward function is typically impractical due to differences in dynamics, privacy constraints, and limited communication bandwidth. This paper introduces an optimal transport-based approach to federated inverse reinforcement learning (IRL). Each client first performs lightweight Maximum Entropy IRL locally, adhering to its computational and privacy limitations. The resulting reward functions are then fused via a Wasserstein barycenter, which considers their underlying geometric structure. We further prove that this barycentric fusion yields a more faithful global reward estimate than conventional parameter averaging methods in federated learning. Overall, this work provides a principled and communication-efficient framework for deriving a shared reward that generalizes across heterogene

Stats

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

Related papers

• Is Optimal Transport Necessary For Inverse Reinforcement Learning? (2025)0.00
• Understanding Reward Ambiguity Through Optimal Transport Theory In Inverse Reinforcement Learning (2023)0.00
• Imitation Learning From Observation Through Optimal Transport (2023)2.26
• Communication-efficient Consensus Mechanism For Federated Reinforcement Learning (2022)6.77
• Momentum For The Win: Collaborative Federated Reinforcement Learning Across Heterogeneous Environments (2024)0.00
• Optimized Local Updates In Federated Learning Via Reinforcement Learning (2025)0.00
• The Gradient Convergence Bound Of Federated Multi-agent Reinforcement Learning With Efficient Communication (2021)0.00
• Discovering Individual Rewards In Collective Behavior Through Inverse Multi-agent Reinforcement Learning (2023)0.00