Cascade Adversarial Machine Learning Regularized with a Unified Embedding

Taesik Na, Jong Hwan Ko, Saibal Mukhopadhyay

Introduction

Adversarial attacks pose a significant threat to the reliability of deep neural networks. By introducing subtle, often imperceptible perturbations to input data, attackers can cause models to make incorrect predictions with high confidence. While standard adversarial training—incorporating adversarial examples into the training set—provides some defense against simple one-step attacks like the Fast Gradient Sign Method (FGSM), it often remains vulnerable to more sophisticated iterative attacks. This paper addresses the challenge of creating a more generalized defense that is robust against both iterative and black-box attacks.

Methodology

The authors propose a dual-strategy approach combining a novel training pipeline with a specialized regularization loss.

Cascade Adversarial Training

A key observation in adversarial research is that iterative adversarial noise transfers easily between networks trained with similar strategies. To break this dependency, the authors introduce Cascade Adversarial Training. Instead of generating adversarial examples solely from the model currently being trained, this method utilizes an "already defended" model as a source.

The Cascade Adversarial Training architecture uses iterative adversarial examples from a previously defended network to train a new, more robust model.

By training a "student" model on iterative adversarial images generated by a "teacher" model (which has already undergone adversarial training), the student learns to resist the specific perturbations that typically bypass standard defenses. This process helps the model generalize better to unseen adversarial distributions.

Pivot Loss Regularization

Beyond the training data, the authors focus on the internal representations of the network. A robust model should map a clean image and its adversarial counterpart to similar locations in the high-level feature representation, or "embedding space."

The authors compare two distance-based loss functions to achieve this:

  1. Bidirectional Loss: This moves both the clean and adversarial embeddings toward each other.
  2. Pivot Loss: This treats the clean image embedding as a fixed "pivot" and forces only the adversarial embedding to move toward it.
Pivot loss (right) fixes the clean embedding as a reference point, whereas bidirectional loss (left) moves both embeddings, potentially degrading clean data representation.

The advantage of Pivot Loss is that it prevents the network from "forgetting" how to represent clean data while attempting to accommodate adversarial noise. This regularization encourages the convolutional filters to focus on invariant structural features rather than easily spoofed pixel-level details.

Experimental Results

The proposed methods were evaluated on MNIST and CIFAR-10 datasets using various ResNet architectures (ResNet-20, ResNet-56, and ResNet-110).

Robustness to Iterative Attacks

On MNIST, the Pivot Loss model demonstrated exceptional resilience, achieving 82% accuracy against the Carlini & Wagner (CW) attack, a significant improvement over the 46% accuracy of the standard adversarial training baseline.

For CIFAR-10, the combination of cascade training and pivot loss (R110_P,C) maintained 42.5% accuracy against a 4-step iterative attack (iter-FGSM), whereas the baseline model's performance plummeted to 9.2%.

Black-Box Performance

The research highlights that the strategy used for training matters more than the specific weights. Adversarial examples transfer more effectively between models trained with the same defense strategy. By using cascade training and pivot loss, the authors achieved superior "worst-case" defense in black-box scenarios, where the attacker lacks direct access to the target model's parameters but may use similar source networks.

Conclusion and Future Work

The study demonstrates that combining cascade training with embedding-space regularization significantly hardens neural networks against complex attacks. However, a "robustness trade-off" exists: increasing defense against iterative attacks can sometimes slightly reduce accuracy on clean images or one-step adversarial examples. Furthermore, high regularization strength can lead to training divergence if class distributions in the embedding space begin to overlap. Future research will focus on optimizing the computational efficiency of generating iterative examples for large-scale datasets and further refining the balance between clean accuracy and adversarial robustness.

Summary updated

BibTeX
@inproceedings{na2018cascade,
  author = {Taesik Na and Jong Hwan Ko and Saibal Mukhopadhyay},
  title = {{Cascade Adversarial Machine Learning Regularized with a Unified Embedding}},
  booktitle = {International Conference on Learning Representations},
  year = {2018},
  url = {https://openreview.net/forum?id=HyRVBzap-},
}
Figure