Low-Rank Agent-Specific Adaptation (LoRASA) for Multi-Agent Policy Learning
Beining Zhang, Aditya Kapoor, Mingfei Sun

TL;DR
LoRASA introduces a low-rank adaptation method for multi-agent reinforcement learning that enhances agent specialization while maintaining scalability and efficiency, outperforming existing approaches on benchmark tasks.
Contribution
The paper proposes LoRASA, a novel low-rank adaptation technique that enables agent-specific policy refinement from a shared backbone, improving performance and efficiency in MARL.
Findings
LoRASA matches or outperforms baselines on SMAC and MAMuJoCo.
It reduces memory and computational overhead compared to traditional methods.
Ablation studies confirm the method's flexibility and effectiveness.
Abstract
Multi-agent reinforcement learning (MARL) often relies on \emph{parameter sharing (PS)} to scale efficiently. However, purely shared policies can stifle each agent's unique specialization, reducing overall performance in heterogeneous environments. We propose \textbf{Low-Rank Agent-Specific Adaptation (LoRASA)}, a novel approach that treats each agent's policy as a specialized ``task'' fine-tuned from a shared backbone. Drawing inspiration from parameter-efficient transfer methods, LoRASA appends small, low-rank adaptation matrices to each layer of the shared policy, naturally inducing \emph{parameter-space sparsity} that promotes both specialization and scalability. We evaluate LoRASA on challenging benchmarks including the StarCraft Multi-Agent Challenge (SMAC) and Multi-Agent MuJoCo (MAMuJoCo), implementing it atop widely used algorithms such as MAPPO and A2PO. Across diverse tasks,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Stream Mining Techniques
MethodsAdapter
