Cover Image

Robust Multi-Agent Path Finding under Observation Attacks: A Principled Adversarial-Plus-Smoothing Training Recipe

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Ahmed, Riad
Format:	Preprint
Published:	2026
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Finding the Weakest Link: Adversarial Attack against Multi-Agent Communications
by: Standen, Maxwell, et al.
Published: (2026)

On the Robustness of Adversarial Training Against Uncertainty Attacks
by: Ledda, Emanuele, et al.
Published: (2024)

Fast Adversarial Training against Sparse Attacks Requires Loss Smoothing
by: Zhong, Xuyang, et al.
Published: (2025)

Where and How to Attack? A Causality-Inspired Recipe for Generating Counterfactual Adversarial Examples
by: Cai, Ruichu, et al.
Published: (2023)

Wolfpack Adversarial Attack for Robust Multi-Agent Reinforcement Learning
by: Lee, Sunwoo, et al.
Published: (2025)

Heterogeneous Multi-Player Multi-Armed Bandits Robust To Adversarial Attacks
by: Magesh, Akshayaa, et al.
Published: (2025)

Adaptive Randomized Smoothing: Certified Adversarial Robustness for Multi-Step Defences
by: Lyu, Saiyue, et al.
Published: (2024)

A Recipe for Improved Certifiable Robustness
by: Hu, Kai, et al.
Published: (2023)

Learning Graph from Smooth Signals under Partial Observation: A Robustness Analysis
by: Nguyen, Hoang-Son, et al.
Published: (2025)

Near Optimal Adversarial Attacks on Stochastic Bandits and Defenses with Smoothed Responses
by: Zuo, Shiliang
Published: (2020)

Dynamic Label Adversarial Training for Deep Learning Robustness Against Adversarial Attacks
by: Liu, Zhenyu, et al.
Published: (2024)

Robust Deep Reinforcement Learning Through Adversarial Attacks and Training : A Survey
by: Schott, Lucas, et al.
Published: (2024)

Stochastic Bandits Robust to Adversarial Attacks
by: Wang, Xuchuang, et al.
Published: (2024)

Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions
by: Ghaffari, Fatemeh, et al.
Published: (2024)

MAPFAST: A Deep Algorithm Selector for Multi Agent Path Finding using Shortest Path Embeddings
by: Ren, Jingyao, et al.
Published: (2021)

Attacking Cooperative Multi-Agent Reinforcement Learning by Adversarial Minority Influence
by: Li, Simin, et al.
Published: (2023)

DARD: Dice Adversarial Robustness Distillation against Adversarial Attacks
by: Zou, Jing, et al.
Published: (2025)

Certifiably-Robust Federated Adversarial Learning via Randomized Smoothing
by: Chen, Cheng, et al.
Published: (2021)

Treatment of Statistical Estimation Problems in Randomized Smoothing for Adversarial Robustness
by: Voracek, Vaclav
Published: (2024)

Multi-Agent Path Finding in Continuous Spaces with Projected Diffusion Models
by: Liang, Jinhao, et al.
Published: (2024)

Hide and Find: A Distributed Adversarial Attack on Federated Graph Learning
by: Liu, Jinshan, et al.
Published: (2026)

Repurposing Language Models into Embedding Models: Finding the Compute-Optimal Recipe
by: Ziarko, Alicja, et al.
Published: (2024)

Predicting Multi-Drug Resistance in Bacterial Isolates Through Performance Comparison and LIME-based Interpretation of Classification Models
by: Wishal, Santanam, et al.
Published: (2026)

Dynamical Low-Rank Compression of Neural Networks with Robustness under Adversarial Attacks
by: Schotthöfer, Steffen, et al.
Published: (2025)

Exploring Sparsity and Smoothness of Arbitrary $\ell_p$ Norms in Adversarial Attacks
by: Duhme, Christof, et al.
Published: (2026)

Multi-Agent Path Finding via Offline RL and LLM Collaboration
by: Atasever, Merve, et al.
Published: (2025)

GRAND: Guidance, Rebalancing, and Assignment for Networked Dispatch in Multi-Agent Path Finding
by: Gaber, Johannes, et al.
Published: (2025)

Test-time Adversarial Defense with Opposite Adversarial Path and High Attack Time Cost
by: Yeh, Cheng-Han, et al.
Published: (2024)

Robust Federated Learning under Adversarial Attacks via Loss-Based Client Clustering
by: Kritharakis, Emmanouil, et al.
Published: (2025)

Certified Adversarial Robustness via Partition-based Randomized Smoothing
by: Goli, Hossein, et al.
Published: (2024)

Towards Certification of Uncertainty Calibration under Adversarial Attacks
by: Emde, Cornelius, et al.
Published: (2024)

Efficient Adversarial Training in LLMs with Continuous Attacks
by: Xhonneux, Sophie, et al.
Published: (2024)

Distributional Adversarial Attacks and Training in Deep Hedging
by: He, Guangyi, et al.
Published: (2025)

SemRoDe: Macro Adversarial Training to Learn Representations That are Robust to Word-Level Attacks
by: Formento, Brian, et al.
Published: (2024)

Generalization Properties of Adversarial Training for $\ell_0$-Bounded Adversarial Attacks
by: Delgosha, Payam, et al.
Published: (2024)

Variational Randomized Smoothing for Sample-Wise Adversarial Robustness
by: Hase, Ryo, et al.
Published: (2024)

Adversarial Training for Robust Coverage Network under Worst-case Facility Losses
by: Miao, Changhao, et al.
Published: (2026)

How Worst-Case Are Adversarial Attacks? Linking Adversarial and Perturbation Robustness
by: Rossolini, Giulio
Published: (2026)

Robustness Against Adversarial Attacks via Learning Confined Adversarial Polytopes
by: Hamidi, Shayan Mohajer, et al.
Published: (2024)

Rethinking Post-Training Recipes for Multimodal Time-Series Forecasting
by: Liu, Haoxin, et al.
Published: (2026)