mlsanityData to 7 Oct 2026

ATOM: A Framework of Detecting Query-Based Model Extraction Attacks for Graph Neural Networks

arXiv 2503.16693 ↗First posted 20 Mar 2025cs.LG cs.CRcited by 8

Not on the map. Why?

Abstract (arXiv)

Graph Neural Networks (GNNs) have gained traction in Graph-based Machine Learning as a Service (GMLaaS) platforms, yet they remain vulnerable to graph-based model extraction attacks (MEAs), where adversaries reconstruct surrogate models by querying the victim model. Existing defense mechanisms, such as watermarking and fingerprinting, suffer from poor real-time performance, susceptibility to evasion, or reliance on post-attack verification, making them inadequate for handling the dynamic characteristics of graph-based MEA variants. To address these limitations, we propose ATOM, a novel real-time MEA detection framework tailored for GNNs. ATOM integrates sequential modeling and reinforcement learning to dynamically detect evolving attack patterns, while leveraging k-core embedding to capture the structural properties, enhancing detection precision. Furthermore, we provide theoretical analysis to characterize query behaviors and optimize detection strategies. Extensive experiments on multiple real-world datasets demonstrate that ATOM outperforms existing approaches in detection performance, maintaining stable across different time steps, thereby offering a more effective defense mechanism for GMLaaS environments.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 26 of its 62 references that are in the map. First posted on arXiv 20 Mar 2025.

Builds on

26 of 62 references.

References · 26

  1. 2017Attention Is All You Needcited by 59,932
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2017Proximal Policy Optimization Algorithmscited by 14,441
  4. 2014Learning Phrase Representations using RNN Encoder-Decoder for Statistical Machine Translationcited by 4,016
  5. 2020Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecastingcited by 2,141
  6. 2022A Time Series is Worth 64 Words: Long-term Forecasting with Transformerscited by 1,981
  7. 2021Autoformer: Decomposition Transformers with Auto-Correlation for Long-Term Series Forecastingcited by 1,654
  8. 2016Variational Graph Auto-Encoderscited by 1,373
  9. 2016Stealing Machine Learning Models via Prediction APIscited by 602
  10. 2018Deep learning for time series classification: a reviewcited by 575
  11. 2021CrossFormer: A Versatile Vision Transformer Hinging on Cross-scale Attentioncited by 139
  12. 2021Dataset Inference: Ownership Resolution in Machine Learningcited by 115
14 more
  1. 2019Deep Neural Network Fingerprinting by Conferrable Adversarial Examplescited by 90
  2. 2017Active Learning for Graph Embeddingcited by 53
  3. 2020Model Extraction Attacks on Graph Neural Networks: Taxonomy and Realizationcited by 39
  4. 2021Grain: Improving Data Efficiency of Graph Neural Networks via Diversified Influence Maximizationcited by 28
  5. 2024Semi-supervised Credit Card Fraud Detection via Attribute-Driven Graph Representationcited by 25
  6. 2024IDEA: A Flexible Framework of Certified Unlearning for Graph Neural Networkscited by 22
  7. 2023Model Extraction Attacks Revisitedcited by 21
  8. 2022Information Gain Propagation: a new way to Graph Active Learning with Soft Labelscited by 16
  9. 2023GrOVe: Ownership Verification of Graph Neural Networks using Embeddingscited by 16
  10. 2023Identifying Appropriate Intellectual Property Protection Mechanisms for Machine Learning Models: A Systematization of Watermarking, Fingerprinting, Model Access, and Attackscited by 11
  11. 2024Safety in Graph Machine Learning: Threats and Safeguardscited by 11
  12. 2021Stateful Detection of Model Extraction Attackscited by 8
  13. 2023Securing Graph Neural Networks in MLaaS: A Comprehensive Realization of Query-based Integrity Verificationcited by 5
  14. 2022DynaMarks: Defending Against Deep Learning Model Extraction Using Dynamic Watermarkingcited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 4; 2026: 4.

8 papers.