Evolutionary Router Feature Generation for Zero-Shot Graph Anomaly Detection with Mixture-of-Experts
On the map: Mixture-of-experts → Vision mixture-of-experts
Abstract (arXiv)
Zero-shot graph anomaly detection (GAD) has attracted increasing attention recent years, yet the heterogeneity of graph structures, features, and anomaly patterns across graphs make existing single GNN methods insufficiently expressive to model diverse anomaly mechanisms. In this regard, Mixture-of-experts (MoE) architectures provide a promising paradigm by integrating diverse GNN experts with complementary inductive biases, yet their effectiveness in zero-shot GAD is severely constrained by distribution shifts, leading to two key routing challenges. First, nodes often carry vastly different semantics across graphs, and straightforwardly performing routing based on their features is prone to generating biased or suboptimal expert assignments. Second, as anomalous graphs often exhibit pronounced distributional discrepancies, existing router designs fall short in capturing domain-invariant routing principles that generalize beyond the training graphs. To address these challenges, we propose a novel MoE framework with evolutionary router feature generation (EvoFG) for zero-shot GAD. To enhance MoE routing, we propose an evolutionary feature generation scheme that iteratively constructs and selects informative structural features via an LLM-based generator and Shapley-guided evaluation. Moreover, a memory-enhanced router with an invariant learning objective is designed to capture transferable routing patterns under distribution shifts. Extensive experiments on six benchmarks show that EvoFG consistently outperforms state-of-the-art baselines, achieving strong and stable zero-shot GAD performance.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Vision mixture-of-experts, one of 12 directions in Mixture-of-experts. Builds on 37 of its 61 references that are in the map. First posted on arXiv 12 Feb 2026.
Builds on
37 of 61 references.
References · 37
- 2017Attention Is All You Needcited by 59,932
- 2017Graph Attention Networkscited by 8,854
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
- 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,085
- 2018Pitfalls of Graph Neural Network Evaluationcited by 994
- 2020Adaptive Universal Generalized PageRank Graph Neural Networkcited by 592
- 2019Graph Transformer Networkscited by 520
- 2019Predicting Dynamic Embedding Trajectory in Temporal Interaction Networkscited by 443
- 2021A Comprehensive Survey on Graph Anomaly Detection with Deep Learningcited by 230
- 2021BernNet: Learning Arbitrary Graph Spectral Filters via Bernstein Approximationcited by 195
25 more
- 2022Rethinking Graph Neural Networks for Anomaly Detectioncited by 185
- 2014Graph-based Anomaly Detection and Description: A Surveycited by 182
- 2021Anomaly Detection on Attributed Networks via Contrastive Self-Supervised Learningcited by 175
- 2022Algorithms to estimate Shapley value feature attributionscited by 114
- 2021Do Feature Attribution Methods Correctly Attribute Features?cited by 98
- 2022The Shapley Value in Machine Learningcited by 97
- 2017Feature Engineering for Predictive Modeling using Reinforcement Learningcited by 78
- 2019The autofeat Python Library for Automated Feature Engineering and Selectioncited by 73
- 2023Ordered GNN: Ordering Message Passing to Deal with Heterophily and Over-smoothingcited by 67
- 2023Graph Mixture of Experts: Learning on Large-Scale Graphs with Explicit Diversity Modelingcited by 63
- 2024Dynamic Mixture of Experts: An Auto-Tuning Approach for Efficient Transformer Modelscited by 55
- 2021Shapley values for feature selection: The good, the bad, and the axiomscited by 54
- 2024Optimized Feature Generation for Tabular Data via LLMs with Decision Tree Reasoningcited by 48
- 2024ARC: A Generalist Graph Anomaly Detector with In-Context Learningcited by 46
- 2025LLM-FE: Automated Feature Engineering for Tabular Data with LLMs as Evolutionary Optimizerscited by 35
- 2021Hop-Count Based Self-Supervised Anomaly Detection on Attributed Networkscited by 31
- 2024Dynamic and Adaptive Feature Generation with LLMcited by 27
- 2024Zero-shot Generalist Graph Anomaly Detection with Unified Neighborhood Promptscited by 24
- 2025AnomalyGFM: Graph Foundation Model for Zero/Few-shot Anomaly Detectioncited by 22
- 2021Graph Classification by Mixture of Diverse Expertscited by 16
- 2024ID-Free Not Risk-Free: LLM-Powered Agents Unveil Risks in ID-Free Recommender Systemscited by 9
- 2024ST-MoE-BERT: A Spatial-Temporal Mixture-of-Experts Framework for Long-Term Cross-City Mobility Predictioncited by 7
- 2024Continual Traffic Forecasting via Mixture of Expertscited by 6
- 2025STAMImputer: Spatio-Temporal Attention MoE for Traffic Data Imputationcited by 2
- 2026PAMAS: Self-Adaptive Multi-Agent System with Perspective Aggregation for Misinformation Detectioncited by 2
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026Routing-Aware Explanations for Mixture of Experts Graph Models in Malware Detection
- 2024Graph Mixture of Experts and Memory-augmented Routers for Multivariate Time Series Anomaly Detection
- 2024Toward Reasoning on the Boundary: A Mixup-based Approach for Graph Anomaly Detection
- 2025Adaptive Graph Mixture of Residual Experts: Unsupervised Learning on Diverse Graphs with Heterogeneous Specialization
- 2024Counterfactual Data Augmentation with Denoising Diffusion for Graph Anomaly Detection
- 2025Backdoor or Manipulation? Graph Mixture of Experts Can Defend Against Various Graph Adversarial Attacks
- 2026Balanced Anomaly-guided Ego-graph Diffusion Model for Inductive Graph Anomaly Detection
- 2025LLM-Powered Text-Attributed Graph Anomaly Detection via Retrieval-Augmented Reasoning