Skip to content

Fully Byzantine-Resilient Multi-Agent Reinforcement Learning

Sep 2026 · 0 citations · 45 references
Computer Science Engineering

TL;DR

It is proved that agents'parameters converge almost surely to the same limit points as in the attack-free case over time-varying communication graphs under linear parameterizations of the value and team-reward functions and Byzantine edge attacks.

Abstract

We study distributed Byzantine-resilient actor-critic multi-agent reinforcement learning (AC-MARL), where agents collectively learn policies through local interactions. Existing methods guarantee convergence of the agents'parameters only to a neighborhood of the attack-free limit points, resulting in degraded performance. We propose Fully Resilient AC-MARL (FRAC-MARL), a decentralized method in which each agent leverages redundancy in two-hop messages to identify reliable messages. Under linear parameterizations of the value and team-reward functions and Byzantine edge attacks, where adversarial behavior is confined to the communication layer, we prove that agents'parameters converge almost surely to the same limit points as in the attack-free case over time-varying communication graphs. We introduce a novel topological condition for the convergence of our method, present a systematic method to construct such networks, and prove that this condition can be verified in polynomial time. Finally, we demonstrate our method on cooperative multi-robot formation control tasks.

View source

Similar papers

#machine learning Preprint Sep 2026

NashDreamer: Model-Based Reinforcement Learning for Zero-Sum Imperfect-Information Games

NashDreamer is proposed, a principled MBRL framework for two-player zero-sum IIGs that introduces a centralized Multi-Agent Recurrent State-Space Model (MARSSM) that decouples environment dynamics from the effect of players's strategies on their individual observations.

Tomáš Holeček, Viliam Lisý · 0 citations
Preprint Sep 2026

Fully Decentralized and Safety-Aware Multi-Agent Reinforcement Learning for Control on Networks

This paper develops a safe and fully decentralized multi-agent reinforcement learning (MARL) algorithm to solve a class of discrete-time control problems on networks, including the persistent monitoring problem. Fully decentralized control of agents, while offering numerous benefits, faces issues such as exponentially...

T. Rogalski, Shirantha Welikala · 0 citations
#artificial intelligence Preprint Sep 2026

Robust and Efficient Communication for Multi-Agent Learning

A deep analysis of message characteristics is provided, proving that MARC maintains high operational performance even under significant data compression, offering a scalable path for deploying intelligent agents in resource-constrained environments.

Rafael Pina, Varuna De Silva, Corentin Artaud · 0 citations
#artificial intelligence Preprint Sep 2026

Interactive Distributionally Robust Multi-Agent Learning with General Function Approximation

This work introduces the robust Multi-Agent Decoupling Coefficient (robust MADC) to characterize the intrinsic exploration complexity arising from strategic interactions and adversarial transition uncertainty, and establishes sublinear robust regret guarantees governed by the robust MADC rather than explicitly by the s...

Debamita Ghosh, George Atia, Yue Wang · 0 citations
#machine learning Preprint Sep 2026

Inverting Self-Triggered Control: Adversarial Reinforcement Learning for Sparse Denial-of-Service Attacks

A plant-property lower bound is proved on the minimum jam count required for an immediate hold-last medium-access-control adversary to force a crash against a self-triggered controller (STC) satisfying a Lyapunov contract, and a certificate-level analog of the consecutive-grouping optimality of prior count-budget DoS s...

Adam Haroon, Erick J. Rodríguez-Seda, Tristan K. Schuler et al. · 0 citations

Related blog posts

MIT News · Artificial Intelligence Nov 17, 2026

Learning the language of machine learning

By studying the computational foundations of language learning, Associate Professor Jacob Andreas builds intelligent systems that can communicate effectively with humans.

Microsoft Research Blog Nov 16, 2026

TokenEconomizer: Learning from Experience to Make AI Coding Agents More Efficient

AI coding agents are increasingly help developers fix bugs and build features largely on their own, but every interaction with their models consumes tokens. In each session, an agent sends instructions, tool descriptions, and session history to its model. Most efforts to reduce this cost focus on individual tasks. Yet developers return to the same […] The post TokenEconomizer: Learning from Experience to Make AI Coding Agents More Efficient appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.