Enhancing Swarms Durability to Threats via Graph Signal Processing and GNN-based Generative Modeling

• URL: http://arxiv.org/abs/2507.03039v1
• Date: Thu, 03 Jul 2025 06:47:49 GMT
• Title: Enhancing Swarms Durability to Threats via Graph Signal Processing and GNN-based Generative Modeling
• Abstract summary: We study the role of external perturbations in affecting swarm stability.<n>By examining predation, we uncover a "detectability-durability trade-off"<n>We introduce SwaGen, a graph neural network-based generative model.
• Score: 2.1301560294088318
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Swarms, such as schools of fish or drone formations, are prevalent in both natural and engineered systems. While previous works have focused on the social interactions within swarms, the role of external perturbations--such as environmental changes, predators, or communication breakdowns--in affecting swarm stability is not fully understood. Our study addresses this gap by modeling swarms as graphs and applying graph signal processing techniques to analyze perturbations as signals on these graphs. By examining predation, we uncover a "detectability-durability trade-off", demonstrating a tension between a swarm's ability to evade detection and its resilience to predation, once detected. We provide theoretical and empirical evidence for this trade-off, explicitly tying it to properties of the swarm's spatial configuration. Toward task-specific optimized swarms, we introduce SwaGen, a graph neural network-based generative model. We apply SwaGen to resilient swarm generation by defining a task-specific loss function, optimizing the contradicting trade-off terms simultaneously.With this, SwaGen reveals novel spatial configurations, optimizing the trade-off at both ends. Applying the model can guide the design of robust artificial swarms and deepen our understanding of natural swarm dynamics.

Related papers

• Beyond Homophily: Towards Generalized Graph Reconstruction Attack and Defense [80.28330585803133]
  Graph neural networks (GNNs) are widely deployed on computation data, yet they can leak sensitive or proprietary information about the training graph adjacency.<n>This work studies graph reconstruction attacks (GRA), a form of model inversion that reconstructs the training adjacency from a trained GNN.<n>We propose MC-GRA (+), which reconstructs the adjacency by optimizing a surrogate adjacency whose GNN-induced representations align with those of the target model.<n>On the defense side, we propose MC-GPB (+), which suppresses adjacency-dependent information throughout the representation chain
  arXiv  Detail & Related papers  (2026-06-06T09:29:27Z)
• On Swarm Leader Identification using Probing Policies [2.707154152696381]
  This work introduces the interactive Swarm Leader Identification problem.<n>An adversarial probing agent identifies a swarm's leader by physically interacting with its members.<n>We employ Deep Reinforcement Learning to train the prober's policy.
  arXiv  Detail & Related papers  (2025-12-20T00:02:58Z)
• TrendGNN: Towards Understanding of Epidemics, Beliefs, and Behaviors [9.74230427221556]
  Epidemic outcomes have a complex interplay with human behavior and beliefs.<n>To better understand the mechanisms and predict the impact of interventions, we need the ability to forecast signals associated with beliefs and behaviors in an interpretable manner.<n>We propose a graph-based forecasting framework that first constructs a graph of interrelated signals based on trend similarity, and then applies graph neural networks (GNNs) for prediction.
  arXiv  Detail & Related papers  (2025-11-29T09:53:59Z)
• Graph Signal Generative Diffusion Models [74.75869068073577]
  We introduce U-shaped encoder-decoder graph neural networks (U-GNNs) for graph signal generation using denoising diffusion processes.<n>The architecture learns node features at different resolutions with skip connections between the encoder and decoder paths.<n>We demonstrate the effectiveness of the diffusion model in probabilistic forecasting of stock prices.
  arXiv  Detail & Related papers  (2025-09-21T21:57:27Z)
• Langevin Flows for Modeling Neural Latent Dynamics [81.81271685018284]
  We introduce LangevinFlow, a sequential Variational Auto-Encoder where the time evolution of latent variables is governed by the underdamped Langevin equation.<n>Our approach incorporates physical priors -- such as inertia, damping, a learned potential function, and forces -- to represent both autonomous and non-autonomous processes in neural systems.<n>Our method outperforms state-of-the-art baselines on synthetic neural populations generated by a Lorenz attractor.
  arXiv  Detail & Related papers  (2025-07-15T17:57:48Z)
• GALDS: A Graph-Autoencoder-based Latent Dynamics Surrogate model to predict neurite material transport [1.104960878651584]
  We propose a Graph-Autoencoder-based Latent Dynamics Surrogate model to streamline the simulation of material transport in neural trees.<n>Our approach achieves mean relative error of 3% with maximum relative error 8% and demonstrates a 10-fold speed improvement compared to previous surrogate model approaches.
  arXiv  Detail & Related papers  (2025-07-15T00:22:00Z)
• Unifying Physics- and Data-Driven Modeling via Novel Causal Spatiotemporal Graph Neural Network for Interpretable Epidemic Forecasting [4.791960848500047]
  We propose a novel Causpatioal Neural Graph Network (CSTG) framework to model the temporal dynamics of infectious diseases.<n>We use an adaptive static connectivity graph to represent the stable components of human mobility and utilize a temporal dynamics model fluctuations within these patterns.<n>We validate our model using real-world datasets at the provincial level in China and the state level in Germany.
  arXiv  Detail & Related papers  (2025-04-07T14:46:11Z)
• Adversarial Training for Graph Neural Networks via Graph Subspace Energy Optimization [39.720316105589326]
  We propose a new concept of graph subspace energy (GSE) as an indicator of GNN robustness against topology perturbations.<n>An extensive set of experiments shows that AT-GSE outperforms consistently the state-of-the-art GNN adversarial training methods.
  arXiv  Detail & Related papers  (2024-12-25T12:04:18Z)
• Out-of-Distribution Generalized Dynamic Graph Neural Network with Disentangled Intervention and Invariance Promotion [61.751257172868186]
  Dynamic graph neural networks (DyGNNs) have demonstrated powerful predictive abilities by exploiting graph and temporal dynamics. Existing DyGNNs fail to handle distribution shifts, which naturally exist in dynamic graphs.
  arXiv  Detail & Related papers  (2023-11-24T02:42:42Z)
• Resilient Graph Neural Networks: A Coupled Dynamical Systems Approach [12.856220339384269]
  Graph Neural Networks (GNNs) have established themselves as a key component in addressing diverse graph-based tasks. Despite their notable successes, GNNs remain susceptible to input perturbations in the form of adversarial attacks. This paper introduces an innovative approach to fortify GNNs against adversarial perturbations through the lens of coupled dynamical systems.
  arXiv  Detail & Related papers  (2023-11-12T20:06:48Z)
• Dynamic Causal Explanation Based Diffusion-Variational Graph Neural Network for Spatio-temporal Forecasting [60.03169701753824]
  We propose a novel Dynamic Diffusion-al Graph Neural Network (DVGNN) fortemporal forecasting. The proposed DVGNN model outperforms state-of-the-art approaches and achieves outstanding Root Mean Squared Error result.
  arXiv  Detail & Related papers  (2023-05-16T11:38:19Z)
• Resisting Graph Adversarial Attack via Cooperative Homophilous Augmentation [60.50994154879244]
  Recent studies show that Graph Neural Networks are vulnerable and easily fooled by small perturbations. In this work, we focus on the emerging but critical attack, namely, Graph Injection Attack. We propose a general defense framework CHAGNN against GIA through cooperative homophilous augmentation of graph data and model.
  arXiv  Detail & Related papers  (2022-11-15T11:44:31Z)
• Adversarial Robustness Assessment of NeuroEvolution Approaches [1.237556184089774]
  We evaluate the robustness of models found by two NeuroEvolution approaches on the CIFAR-10 image classification task. Our results show that when the evolved models are attacked with iterative methods, their accuracy usually drops to, or close to, zero. Some of these techniques can exacerbate the perturbations added to the original inputs, potentially harming robustness.
  arXiv  Detail & Related papers  (2022-07-12T10:40:19Z)
• Handling Distribution Shifts on Graphs: An Invariance Perspective [78.31180235269035]
  We formulate the OOD problem on graphs and develop a new invariant learning approach, Explore-to-Extrapolate Risk Minimization (EERM) EERM resorts to multiple context explorers that are adversarially trained to maximize the variance of risks from multiple virtual environments. We prove the validity of our method by theoretically showing its guarantee of a valid OOD solution.
  arXiv  Detail & Related papers  (2022-02-05T02:31:01Z)
• Spatially Focused Attack against Spatiotemporal Graph Neural Networks [8.665638585791235]
  Deep Spatiotemporal graph neural networks (GNNs) have achieved great success in traffic forecasting applications. If GNNs are vulnerable in real-world prediction applications, a hacker can easily manipulate the results and cause serious traffic congestion and even a city-scale breakdown.
  arXiv  Detail & Related papers  (2021-09-10T01:31:53Z)
• Heterogeneous Face Frontalization via Domain Agnostic Learning [74.86585699909459]
  We propose a domain agnostic learning-based generative adversarial network (DAL-GAN) which can synthesize frontal views in the visible domain from thermal faces with pose variations. DAL-GAN consists of a generator with an auxiliary classifier and two discriminators which capture both local and global texture discriminations for better synthesis.
  arXiv  Detail & Related papers  (2021-07-17T20:41:41Z)
• Graph Backdoor [53.70971502299977]
  We present GTA, the first backdoor attack on graph neural networks (GNNs) GTA departs in significant ways: it defines triggers as specific subgraphs, including both topological structures and descriptive features. It can be instantiated for both transductive (e.g., node classification) and inductive (e.g., graph classification) tasks.
  arXiv  Detail & Related papers  (2020-06-21T19:45:30Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.