mlsanityData to 14 Oct 2026

ROOM: Adversarial Machine Learning Attacks Under Real-Time Constraints

arXiv 2201.01621 ↗First posted 5 Jan 2022cs.CR cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

Advances in deep learning have enabled a wide range of promising applications. However, these systems are vulnerable to Adversarial Machine Learning (AML) attacks; adversarially crafted perturbations to their inputs could cause them to misclassify. Several state-of-the-art adversarial attacks have demonstrated that they can reliably fool classifiers making these attacks a significant threat. Adversarial attack generation algorithms focus primarily on creating successful examples while controlling the noise magnitude and distribution to make detection more difficult. The underlying assumption of these attacks is that the adversarial noise is generated offline, making their execution time a secondary consideration. However, recently, just-in-time adversarial attacks where an attacker opportunistically generates adversarial examples on the fly have been shown to be possible. This paper introduces a new problem: how do we generate adversarial noise under real-time constraints to support such real-time adversarial attacks? Understanding this problem improves our understanding of the threat these attacks pose to real-time systems and provides security evaluation benchmarks for future defenses. Therefore, we first conduct a run-time analysis of adversarial generation algorithms. Universal attacks produce a general attack offline, with no online overhead, and can be applied to any input; however, their success rate is limited because of their generality. In contrast, online algorithms, which work on a specific input, are computationally expensive, making them inappropriate for operation under time constraints. Thus, we propose ROOM, a novel Real-time Online-Offline attack construction Model where an offline component serves to warm up the online algorithm, making it possible to generate highly successful attacks under time constraints.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 23 of its 34 references that are in the map. First posted on arXiv 5 Jan 2022.

Builds on

23 of 34 references.

References · 23

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  2. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
  3. 2014Explaining and Harnessing Adversarial Examplescited by 7,364
  4. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
  5. 2016Towards Evaluating the Robustness of Neural Networkscited by 2,998
  6. 2016Adversarial examples in the physical worldcited by 1,769
  7. 2016YOLO9000: Better, Faster, Strongercited by 1,431
  8. 2016Universal adversarial perturbationscited by 784
  9. 2015Distillation as a Defense to Adversarial Perturbations against Deep Neural Networkscited by 678
  10. 2016Stealing Machine Learning Models via Prediction APIscited by 619
  11. 2017Adversarial Examples Are Not Easily Detected: Bypassing Ten Detection Methodscited by 546
  12. 2019On Evaluating Adversarial Robustnesscited by 447
11 more
  1. 2016Transferability in Machine Learning: from Phenomena to Black-Box Attacks using Adversarial Samplescited by 446
  2. 2017Adversarial Examples: Attacks and Defenses for Deep Learningcited by 351
  3. 2019Fooling automated surveillance cameras: adversarial patches to attack person detectioncited by 268
  4. 2019You Only Propagate Once: Accelerating Adversarial Training via Maximal Principlecited by 183
  5. 2018DPatch: An Adversarial Patch Attack on Object Detectorscited by 147
  6. 2018LaVAN: Localized and Visible Adversarial Noisecited by 113
  7. 2017Deep Learning in Robotics: A Review of Recent Researchcited by 43
  8. 2020Enabling Fast and Universal Audio Adversarial Attack Using Generative Modelcited by 32
  9. 2017Foolbox: A Python toolbox to benchmark the robustness of machine learning modelscited by 20
  10. 2020Defensive Approximation: Securing CNNs using Approximate Computingcited by 12
  11. 2019Real-Time Adversarial Attackscited by 11

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 1; 2024: 2; 2025: 1; 2026: 1.

5 papers.