Pith. sign in

REVIEW 2 cited by

Universal Adversarial Perturbations: A Survey

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2005.08087 v1 pith:QANM4PZ7 submitted 2020-05-16 cs.CV cs.CRcs.LG

Universal Adversarial Perturbations: A Survey

classification cs.CV cs.CRcs.LG
keywords perturbationslearninguniversaladversarialdeepimagedefendnetworks
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Over the past decade, Deep Learning has emerged as a useful and efficient tool to solve a wide variety of complex learning problems ranging from image classification to human pose estimation, which is challenging to solve using statistical machine learning algorithms. However, despite their superior performance, deep neural networks are susceptible to adversarial perturbations, which can cause the network's prediction to change without making perceptible changes to the input image, thus creating severe security issues at the time of deployment of such systems. Recent works have shown the existence of Universal Adversarial Perturbations, which, when added to any image in a dataset, misclassifies it when passed through a target model. Such perturbations are more practical to deploy since there is minimal computation done during the actual attack. Several techniques have also been proposed to defend the neural networks against these perturbations. In this paper, we attempt to provide a detailed discussion on the various data-driven and data-independent methods for generating universal perturbations, along with measures to defend against such perturbations. We also cover the applications of such universal perturbations in various deep learning tasks.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. BackWeak: Backdooring Knowledge Distillation Simply with Weak Triggers and Fine-tuning

    cs.CR 2025-11 conditional novelty 6.0

    Fine-tuning a benign teacher on a weak trigger at a 100x-reduced learning rate is sufficient to make the backdoor survive knowledge distillation into student models.

  2. Non-Parametric Probabilistic Robustness: A Conservative Risk Estimator under Unknown Perturbation Distributions

    cs.CV 2025-11 conditional novelty 5.0

    NPPR is the worst-case probability of correct classification over all perturbation distributions inside a budget; a Gaussian mixture model is fit to approximate it, giving conservative robustness estimates.