mlsanityData to 14 Oct 2026

The Limits of Query Monitoring against Distributed Model Extraction

arXiv 2610.13083 ↗First posted 9 Oct 2026cs.CR cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Model providers now face distillation campaigns run through thousands of accounts, each of which looks like an ordinary user. When network and payment metadata cannot link those accounts, the only evidence left is what they ask. We study what a provider can and cannot learn from those queries alone, using one million real chat turns for development and 17 later weeks that no design choice touched for a single frozen evaluation. The answer is set less by anything specific to extraction than by benign coordination: a campaign is visible only if it is more distinctive than the most distinctive group of ordinary users in the same week. We make this precise, show that a small but positive difference between campaign and users buys a detection time rather than detectability, and identify the campaign that is hardest to detect. Empirically, a calibrated monitor catches naive distributed extraction that per-account monitors miss (0.86-1.00 of weeks), and one variant - selecting accounts that move together after discounting how topical each one is - still catches campaigns padded with natural text (0.50-0.96 of weeks) where the other two spectral detectors catch none. Distilling each campaign into a small student shows that, in our testbed, campaigns that evaded every detector kept at most 42% of the capability of a detectable one. The limits are equally concrete: a campaign that ramps up slowly poisons every detector's calibration, benign evaluation pipelines look exactly like distillation, we found no deployable detector at colluder shares of 2.5% or below, and campaigns that relay real users' requests may be invisible to any query-only monitor.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 36 of its 91 references that are in the map. First posted on arXiv 9 Oct 2026.

Builds on

36 of 91 references.

References · 36

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2015Distilling the Knowledge in a Neural Networkcited by 10,324
  3. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  4. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,170
  5. 2024Qwen2.5 Technical Reportcited by 4,942
  6. 2020MiniLM: Deep Self-Attention Distillation for Task-Agnostic Compression of Pre-Trained Transformerscited by 1,463
  7. 2023MetaMath: Bootstrap Your Own Mathematical Questions for Large Language Modelscited by 735
  8. 2024WildChat: 1M ChatGPT Interaction Logs in the Wildcited by 629
  9. 2016Stealing Machine Learning Models via Prediction APIscited by 619
  10. 2025SmolLM2: When Smol Goes Big -- Data-Centric Training of a Small Language Modelcited by 335
  11. 2018Knockoff Nets: Stealing Functionality of Black-Box Modelscited by 292
  12. 2023The False Promise of Imitating Proprietary LLMscited by 263
24 more
  1. 2023Magicoder: Empowering Code Generation with OSS-Instructcited by 256
  2. 2018PRADA: Protecting against DNN Model Stealing Attackscited by 165
  3. 2022Game-theoretic statistics and safe anytime-valid inferencecited by 155
  4. 2019DAWN: Dynamic Adversarial Watermarking of Neural Networkscited by 100
  5. 2013Spectral redemption: clustering sparse networkscited by 56
  6. 2019Stateful Detection of Black-Box Adversarial Attackscited by 56
  7. 2020Identifying Coordinated Accounts on Social Media through Hidden Influence and Group Behaviourscited by 47
  8. 2017Model Extraction Warning in MLaaS Paradigmcited by 40
  9. 2023Privacy Side Channels in Machine Learning Systemscited by 40
  10. 2020Design and Analysis of Switchback Experimentscited by 38
  11. 2020Blacklight: Scalable Defense for Neural Networks against Query-Based Black-Box Attackscited by 37
  12. 2018Heteroskedastic PCA: Algorithm, Optimality, and Applicationscited by 34
  13. 2019Testing randomnesscited by 34
  14. 2021Retrain or not retrain: Conformal test martingales for change-point detectioncited by 32
  15. 2015Concentration and regularization of random graphscited by 25
  16. 2014Spectral Clustering of Graphs with the Bethe Hessiancited by 23
  17. 2014Computational Lower Bounds for Community Detection on Random Graphscited by 22
  18. 2020On the Detection of Disinformation Campaign Activity with Network Analysiscited by 15
  19. 2025HoneypotNet: Backdoor Attacks Against Model Extractioncited by 6
  20. 2022Characterizing, Detecting, and Predicting Online Ban Evasioncited by 4
  21. 2021HODA: Hardness-Oriented Detection of Model Extraction Attackscited by 3
  22. 2026An Embarrassingly Simple Detector for Model Extraction Attacks in Large Language Model API Trafficcited by 3
  23. 2026Let Them Steal: Trapping Large Language Model Extraction Attacks with Knowledge Honeypotcited by 3
  24. 2026Lossless Anti-Distillation Samplingcited by 1

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2025Audit the Whisper: Detecting Steganographic Collusion in Multi-Agent LLMs
  2. 2026Distill to Detect: Exposing Stealth Biases in LLMs through Cartridge Distillation
  3. 2026Tracing the Data Trail: A Survey of Data Provenance, Transparency and Traceability in LLMs
  4. 2025If It's Nice, Do It Twice: We Should Try Iterative Corpus Curation
  5. 2026Low-Cost Assays for Measuring Model Behavior Across Vendors and Releases
  6. 2026Leak It: Per-Document Extraction Beyond Aggregate Membership Inference
  7. 2026Fidelity Is Not Enough: Dispatch-Level Instrumentation for Agentic Datasheet Extraction
  8. 2026Curating Merchant-Matching Training Data with Two Confidence-Gated Local LLM Judges