The paper examines inference‑time observation attacks on Safe Multi‑Agent Reinforcement Learning (SMARL), where an adversary perturbs observations of some agents to alter their actions. It introduces the MinMax Attack framework, which jointly selects adversarial target actions for compromised agents while considering the cooperative resistance of benign agents. The authors derive a bound on the induced safety cost and show through experiments that MinMax Attack causes higher safety costs than existing baselines while maintaining task reward, thus improving attack effectiveness and stealthiness.
arXiv:2402.03741v4 Announce Type: replace-cross Abstract: Recent advancements in multi-agent reinforcement learning (MARL) have opened up vast application prospects, such as swarm control of drones,...
The paper introduces Adversarial Importance Sampling (Advis), a technique that leverages importance sampling over standard training trajectories to estimate and optimize worst‑case returns without extra environment interactions or auxiliary networks, thereby capturing long‑term robustness. It also presents advrl, a modular PyTorch library that consolidates existing robustness methods and adversarial attacks into single‑file implementations for easier prototyping and reproducible evaluation. Finally, the authors highlight that optimal adversarial hyperparameters do not transfer across agents, prompting evaluation against a broader set of attackers (6–14× more configurations) and demonstrate the effectiveness of their approach on continuous control tasks.
arXiv:2510. 09041v3 Announce Type: replace-cross Abstract: Deep reinforcement learning (DRL) has demonstrated remarkable success in developing autonomous driving policies.
arXiv:2602.16543v2 Announce Type: replace Abstract: Safe reinforcement learning (Safe RL) learns robotic controllers that optimize task rewards under safety constraints, yet observation perturbations...
arXiv:2604. 10062v3 Announce Type: replace Abstract: We study reward poisoning attacks in reinforcement learning (RL), where an adversary manipulates rewards within constrained budgets to force the target RL agent to adopt a policy that aligns with the attacker's objectives.
SafeDiSTL is a constrained multi‑agent reinforcement learning framework that decomposes joint constraints using Signal Temporal Logic robustness to assign credit to individual agents. By measuring episode‑level violations through running‑maximum cost increments and computing action sensitivities, the method distributes each cost increment among agents at the same decision time, accounting for delayed effects. Experiments on cooperative payload transport, connected navigation, and networked traffic control show that SafeDiSTL improves safe‑success rates and throughput compared to constrained baselines while preserving unconstrained policy performance.
arXiv:2403. 00420v3 Announce Type: replace-cross Abstract: Deep Reinforcement Learning (DRL) is a subfield of machine learning for training autonomous agents that take sequential actions across complex environments.
arXiv:2607. 08137v1 Announce Type: cross Abstract: Federated reinforcement learning (FRL) is crucial for enabling collaborative learning across multiple agents without sharing raw data, thereby enhancing privacy and scalability in the decision-making process within dynamic vehicular environments.
arXiv:2503. 01734v3 Announce Type: replace-cross Abstract: Attacks on machine learning models have been extensively studied through stateless optimization.
The paper investigates how to infer agents’ underlying incentives in strategic multi‑agent settings, where traditional inverse reinforcement learning (IRL) may fail to produce rewards that guide optimal play. It introduces the concept of strategic identifiability and shows that learning from a fixed pair of policies can be insufficient regardless of sample size. To address this, the authors propose an active IRL algorithm for two‑player repeated Stackelberg games, combining maximum‑likelihood estimation with experimental design to achieve finite‑sample guarantees on sub‑optimality, and validate the approach in an anti‑poaching scenario.
arXiv:2608. 11658v1 Announce Type: cross Abstract: Many reinforcement learning systems, from fleet management to traffic signal control, must serve an objective that changes dynamically after deployment, and retraining a policy for each new objective is prohibitively expensive.
The paper presents a robust multi‑agent reinforcement learning framework for small unmanned aircraft systems (sUAS) to maintain separation assurance when GPS data is degraded or spoofed. By modeling state observation corruption as a zero‑sum game, the authors derive a closed‑form adversarial perturbation that eliminates iterative inner optimization and can be evaluated in linear time. Integrating this perturbation into a policy‑gradient MARL algorithm yields a counter‑policy that achieves near‑zero collision rates in high‑density simulations even with up to 35% observation corruption, outperforming non‑adversarial baselines.