Graph
Carlini–Wagner Attack

🎯Carlini–Wagner Attack

NEW

Also known as: C&W Attack

An optimization-based adversarial attack that minimizes perturbation under norm constraints while enforcing misclassification with a tunable confidence.

DESCRIPTION

The Carlini–Wagner (C&W) attack formulates adversarial example generation as a constrained optimization problem, typically minimizing L2 (or other) norm subject to targeted misclassification. It introduces a confidence parameter to adjust attack strength and transferability. The approach proved effective against defenses like defensive distillation and became a benchmark for worst-case robustness. Variants exist for L2, L-infinity, and L0 norms and for targeted or untargeted settings. Although computationally heavier than first-order methods, it frequently finds smaller, more imperceptible perturbations. Implementations are available in common robustness libraries.

ALTERNATIVE DEFINITIONS

Wikipedia

The Carlini–Wagner attack is an optimization-based method for constructing adversarial examples that cause misclassification while keeping the perturbation small.

Highlights optimization formulation and minimal perturbation.

Source

Carlini and Wagner, arXiv

We propose a new attack algorithm that is able to reliably find adversarial examples that defeat defensive distillation and are often with minimal perturbation.

Introduces the attack and its effectiveness against proposed defenses.

Source

IBM ART

The Carlini & Wagner L2 attack is an optimization-based method to generate adversarial examples with minimal L2 perturbation.

Specifies the L2 variant and optimization target.

Source

CleverHans

The Carlini and Wagner L2 attack optimizes an objective function to find small-norm adversarial perturbations that induce misclassification.

Emphasizes objective-based formulation and small norm solutions.

Source

Adversarial Examples Optimization-based Attack L2 Norm Defensive Distillation Targeted Attack Confidence Parameter White-box Attack Evasion Attack Robust Optimization

COMPETING TERMS

PGD Attack FGSM

RELATIONS

KNOWLEDGE AREAS

AI Data Science Testing & Validation Mathematics Data Security

TARGET AUDIENCE

AI Engineer MLOps Engineer Data Scientist Cybersecurity Engineer Chief AI Officer

EXTERNAL SOURCES

TOP QUESTIONS

What is the Carlini–Wagner Attack in adversarial ML?

It is a strong optimization-based attack that minimizes perturbation while ensuring misclassification. It’s a common benchmark for worst-case robustness.

Category: Definition

Why is the Carlini–Wagner Attack considered strong?

It solves a targeted optimization problem, often finding smaller, less perceptible perturbations than first-order methods.

Category: Relevancy

Which norms are used in the Carlini–Wagner Attack?

Common variants target L2, L-infinity, and L0 norms, each balancing imperceptibility and computational cost differently.

Category: Concepts

How does the attack handle targeted vs. untargeted objectives?

A configurable loss enforces a desired target class or any misclassification, controlled by a confidence parameter.

Category: HowTo

What defenses did Carlini–Wagner challenge?

It notably defeated defensive distillation, revealing the fragility of gradient-obfuscation defenses.

Category: History

Is the Carlini–Wagner Attack computationally expensive?

Yes, it typically requires iterative optimization, making it heavier than simple gradient sign methods.

Category: Tradeoffs

When should I prefer C&W over PGD?

Use C&W when you need minimal-norm examples or to evaluate defenses beyond first-order baselines.

Category: Decision

What are common mistakes using C&W?

Poor tuning of confidence and regularization can produce weak examples. Ensure convergence criteria and bounds are set correctly.

Category: Mistakes

Which tools implement Carlini–Wagner?

IBM ART, CleverHans, and Foolbox provide implementations with configurable parameters.

Category: Tooling