mlsanityData to 14 Oct 2026

Don't Waste the Noise: Importance-Guided Perturbation Allocation under Joint Global and Local Constraints

arXiv 2610.00861 ↗First posted 1 Oct 2026cs.LG cs.AI cs.CVcited by 0

Not on the map. Why?

Abstract (arXiv)

Adversarial optimization under a shared ℓ1 budget requires deciding not only how much perturbation to use, but also where that limited budget should be spent. This allocation problem becomes particularly important when individual input coordinates are subject to local magnitude constraints, which restrict the extent to which perturbation can be concentrated on a small number of locations. We introduce an importance-guided allocation mechanism that uses a fixed clean-gradient prior to steer perturbation toward model-sensitive regions while leaving the feasible perturbation set unchanged. A centered allocation objective encourages perturbation at above-average importance locations and discourages unnecessary expenditure elsewhere, thereby redistributing rather than enlarging the available budget. Across ten robust model--dataset configurations under a common capacity-limited threat setting, the proposed method improves attack success over matched APGD- and PMA-based baselines by 2.52 to 17.70 percentage points. Allocation analysis shows that these gains are accompanied by substantially greater perturbation mass in high-importance regions without increased global ℓ1 consumption. Mechanism ablations further show that centered non-uniform redistribution provides part of the benefit, while model-derived importance yields an additional improvement. These results identify perturbation allocation as a distinct and practically relevant dimension of adversarial optimization under shared-budget, locally constrained threat models.

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

Builds on

20 of 30 references.

References · 20

  1. 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 5,045
  2. 2013Deep Inside Convolutional Networks: Visualising Image Classification Models and Saliency Mapscited by 2,371
  3. 2020Reliable evaluation of adversarial robustness with an ensemble of diverse parameter-free attackscited by 1,451
  4. 2015DeepFool: a simple and accurate method to fool deep neural networkscited by 1,318
  5. 2015The Limitations of Deep Learning in Adversarial Settingscited by 790
  6. 2020RobustBench: a standardized adversarial robustness benchmarkcited by 661
  7. 2023Better Diffusion Models Further Improve Adversarial Trainingcited by 208
  8. 2017EAD: Elastic-Net Attacks to Deep Neural Networks via Adversarial Examplescited by 155
  9. 2019Sparse and Imperceivable Adversarial Attackscited by 95
  10. 2018SparseFool: a few pixels make a big differencecited by 94
  11. 2023Revisiting Adversarial Training for ImageNet: Architectures, Training and Generalization across Threat Modelscited by 79
  12. 2020Sparse-RS: a versatile framework for query-efficient sparse black-box adversarial attackscited by 65
8 more
  1. 2018Structured Adversarial Attack: Towards General Implementation and Better Interpretabilitycited by 64
  2. 2022A Light Recipe to Train Robust Vision Transformerscited by 64
  3. 2021Mind the box: l1-APGD for sparse adversarial attacks on image classifierscited by 51
  4. 2021Fast Minimum-norm Adversarial Attacks through Adaptive Norm Constraintscited by 50
  5. 2020GreedyFool: Distortion-Aware Sparse Adversarial Attackcited by 37
  6. 2024AttackBench: Evaluating Gradient-based Attacks for Adversarial Examplescited by 14
  7. 2022Saliency Attack: Towards Imperceptible Black-box Adversarial Attackcited by 12
  8. 2023MIMIR: Masked Image Modeling for Mutual Information-based Adversarial Robustnesscited by 12

Built on by

Not cited yet.