Metraipolis › archive › dc_d15c6945fca2

Interactive Distributionally Robust Multi-Agent Learning with General Function Approximation — arXiv:2609.32048

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.32048
License (as archived)
CC0-1.0
Archived
2026-10-07T20:59:49.882Z
SHA-256 of the archived text
a5f68cbd49a27d8591614906a6acca09c59292444b902838ab4b65ee39b4fee8
Stable URL of this page
https://metraipolis.com/documento/dc_d15c6945fca2

How to cite

Interactive Distributionally Robust Multi-Agent Learning with General Function Approximation — arXiv:2609.32048 — arXiv (en), https://arxiv.org/abs/2609.32048 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d15c6945fca2 (Metraipolis archive dc_d15c6945fca2, sha256 a5f68cbd49a27d8591614906a6acca09c59292444b902838ab4b65ee39b4fee8)
BibTeX
@misc{dcd15c6945fca2,
  title = {Interactive Distributionally Robust Multi-Agent Learning with General Function Approximation — arXiv:2609.32048},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.32048},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d15c6945fca2; sha256 a5f68cbd49a27d8591614906a6acca09c59292444b902838ab4b65ee39b4fee8},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.32048. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Model misspecification poses a fundamental challenge in multi-agent reinforcement learning, where transition uncertainty can be amplified by strategic interactions among agents. Distributionally robust Markov games (DRMGs) provide a principled framework for addressing such uncertainty, yet existing methods often rely on restrictive assumptions or scale poorly to large state and joint action spaces. We study online learning in general-sum DRMGs with general function approximation and $\phi$-divergence uncertainty sets. We propose RoMEX-$\phi$, a model-free framework that integrates equilibrium-based exploration with dual fitted learning. Through a functional dual representation of the robust multi-agent Bellman operator, RoMEX-$\phi$ enables tractable worst-case value estimation from nominal interaction data using a centered empirical robust discrepancy. We introduce the robust Multi-Agent Decoupling Coefficient (robust MADC) to characterize the intrinsic exploration complexity arising from strategic interactions and adversarial transition uncertainty. We establish sublinear robust regret guarantees governed by the robust MADC rather than explicitly by the state and joint action space sizes, replacing tabular dependence with intrinsic function-class complexity. Numerical experiments on a scalable general-sum DRMG under total variation uncertainty show that RoMEX-$\phi$ is substantially more resilient to transition shifts than its non-robust counterpart while remaining competitive with an exact tabular robust baseline. Our results provide a scalable framework for distributionally robust multi-agent reinforcement learning with general function approximation.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-29 in cs.AI).
Categorie arXiv: Machine Learning (cs.LG) ; Artificial Intelligence (cs.AI).
Pagina del lavoro: https://arxiv.org/abs/2609.32048 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T20:29:02.214Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).