Skip to content

Toward compositional adversarial robustness: generalizing adversarial training to composite semantic perturbations

Towards Compositional Adversarial Robustness: Generalizing Adversarial Training to Composite Semantic Perturbations

arXiv· arXiv:2202.04235· CVPR 2023· Lei Hsiung, Yun-Yun Tsai, Pin-Yu Chen, Tsung-Yi HoNational Tsing Hua University; The Chinese University of Hong Kong; Columbia University; IBM ResearchIndexed by this site · 16 days ago· Originally publishedAttacks

Quick read

Defenses

Based on the paper PDF (AI-generated); refer to the original

The authors propose the combined adversarial attack CAA and generalized adversarial training GAT, and claim that GAT's robust accuracy on ImageNet and CIFAR-10 for single and combined semantic perturbations exceeds that of ℓ∞ adversarial training baselines.

Threat modelThe attacker combines multiple perturbation types (semantic perturbations such as Hue, Saturation, Brightness, Contrast, and Rotation, and ℓp-norm perturbations), each perturbation has its strength constrained by an interval ϵk=[αk,βk], and they are applied sequentially to the input image; the attack optimizes each perturbation strength via component-wise PGD and learns the optimal attack order, with the goal of maximizing classification error.

Questions
Adversarial training mostly targets only a single perturbation type (such as ℓp-ball), and robustness to multiple semantic perturbations and their combinations (Hue, Saturation, Rotation, etc.) is understudied; the authors argue that evaluation against only a single threat model leads to unrealistic conclusions.
Methods
Propose the combined adversarial attack CAA: use component-wise PGD to optimize the strength of each perturbation, and use a scheduling algorithm based on Sinkhorn normalization to learn the optimal attack order; then use the samples generated by CAA for adversarial training to obtain generalized adversarial training GAT.
Experiments and results
Experiments on ImageNet and CIFAR-10; the authors claim that GAT remains robust to all tested single attacks and their combinations, with robust accuracy exceeding baselines by an average of 30%∼60% (semantic attacks) and 15%∼22% (full attacks); the learned attack order improves ASR over random order by an average of 9% (CIFAR-10) and 7% (ImageNet).
Limitations and future work
The attached text contains only the beginning of the paper; the limitations discussion, complete experimental setup, and appendix are not attached, so the limitations pointed out by the authors cannot be listed; the experimental details in the attached portion (model list, sample size, number of repetitions) are not fully presented.
Experimental setupResNet50 · ImageNet、CIFAR-10 · ASR、robust accuracy (RA)
Evaluated models
ResNet50
Benchmarks
ImageNetCIFAR-10
Metrics
ASRrobust accuracy (RA)
AI summaryResearchers propose generalized adversarial training (GAT), which extends model robustness from ℓp balls to arbitrary combinations of composite semantic perturbations such as hue, saturation, brightness, contrast and rotation. Its composite adversarial example generation method uses component-wise projected gradient descent and automatic attack order scheduling to search for the optimal attack combination. On ImageNet and CIFAR-10, GAT remains robust to all tested single-category attacks and their arbitrary combinations, and significantly outperforms baseline adversarial training constrained by the ℓ∞ norm.

Researchers propose generalized adversarial training (GAT), which extends model robustness from ℓp balls to arbitrary combinations of composite semantic perturbations such as hue, saturation, brightness, contrast and rotation. Its composite adversarial example generation method uses component-wise projected gradient descent and automatic attack order scheduling to search for the optimal attack combination. On ImageNet and CIFAR-10, GAT remains robust to all tested single-category attacks and their arbitrary combinations, and significantly outperforms baseline adversarial training constrained by the ℓ∞ norm.

Paper analysis

6 questions; open one to read the full answer

  1. What problem does this paper attempt to solve?

    How to generalize adversarial training from a single ℓp threat model to multiple semantic perturbations and their combinations.

    Core problem: adversarial training mostly targets only a single perturbation type (such as ℓp-ball), and the robustness of models to multiple semantic perturbations and their ordered combinations is understudied.

    • Problem setting: The authors point out that image classification models are used in scenarios such as face recognition, medical diagnosis, and traffic sign classification, but are easily deceived by adversarial perturbations; models robust to perturbations within an ℓp-ball may not simultaneously resist semantic perturbations such as hue, saturation, rotation, brightness, and contrast.
    • Shortcomings of existing methods: The authors argue that current adversarial training mainly considers only a single threat model characterized by a specific distance metric (such as ℓp-ball), and that exploring only a single threat model leads to unrealistic conclusions and biased robustness evaluations; Figure 1 shows that Madry's ℓ∞ robust model is robust to attacks of the same kind but vulnerable to semantic attacks and their combinations.
    • Core observation: In combined perturbations, each perturbation is applied sequentially, and the attack order affects the effectiveness of the combined adversarial example, so directly extending standard adversarial training to combined perturbations is challenging.
    • What the paper proposes: Propose the combined adversarial attack CAA (component-wise PGD + automatic attack order scheduling) and generalized adversarial training GAT, extending model robustness from ℓp-ball to combined semantic perturbations such as Hue, Saturation, Brightness, Contrast, and Rotation.
    • Threat model (as stated in Section 3.1 of the paper):
      • Attacker's goal: Maximize classification error (such as cross-entropy loss), causing the classifier to misclassify.
      • Attacker's capability: Combine n attack types from the attack set Ω={A1,...,An} (semantic perturbations and ℓp-norm perturbations), with the strength δk of each attack limited to the perturbation interval ϵk=[αk,βk], applied sequentially to the input image in some order.
      • Victim system: Image classifier F : X → R^d (such as ResNet50 on ImageNet in the experiments).
      • Knowledge: The paper uses PGD to optimize perturbations; the attached text does not explicitly state the white-box/black-box setting.
  2. What related research exists?

    Related work is divided into three groups: semantic perturbation attacks, combined adversarial perturbations, and adversarial training and its multi-threat extensions.

    Adversarial semantic perturbations

    • Hosseini and Poovendran [11] — randomly shifting Hue and Saturation in HSV space can reduce neural network accuracy by up to 88%.
    • Bhattad et al. [1] — proposed colorization and texture transfer attacks; Xiao et al. [45], Engstrom et al. [8], Dunn et al. [7] — attacks targeting geometric/spatial transformations such as rotation (the paper states that Xiao et al.'s per-pixel coordinate optimization is computationally expensive).
    • Mohapatra et al. [26] — studied certified robustness to semantic perturbations; the paper notes that they do not discuss adversarial training.

    Composed adversarial perturbations

    • Laidlaw and Feizi [19] — proposed ReColorAdv, combining multiple threat models and adding an additional ℓp-norm threat, perturbing every input pixel.
    • Mao et al. [23] — used a genetic algorithm to search for the best combination of multiple attacks; the paper notes that they search the order of attack combinations only in specific norm spaces (ℓ2, ℓ∞, and the corruption semantic space) and cannot handle all attacks simultaneously.
    • Yuan et al. [46] — combined different image transformation operations to improve adversarial example transferability; Kang et al. [14] — measured robustness using an ensemble of unseen attacks from a broader threat model (JPEG, Fog, Snow, Gabor, etc.), considering the worst case over all attacks.

    Adversarial training (AT)

    • Madry et al. [21] — minimizes the worst-case loss within a region around the input, one of the pioneering works in AT; Zhang et al. [48] — considers both natural and adversarial samples in the loss and adjusts the proportion with parameter β.
    • Laidlaw et al. [20] — extended adversarial training from a single to multiple threat models using a neural perceptual distance metric; Mao et al. [24] — composed robust components to build a vision transformer.
    • Tramer et al. [38] — multi-norm adversarial training, alternately optimizing perturbation types under a fixed attack order; the paper notes that they do not discuss searching for the strongest attack order, and that perturbations are added to the same sample simultaneously rather than applied sequentially.

    Baselines and positioning: The paper's comparison baselines are adversarial training methods [20, 21, 42, 44, 48, 49], and the experimental benchmarks are ImageNet and CIFAR-10. The authors position this paper's distinction as follows: on the attack side, it considers attack order scheduling and goes beyond ℓp-norm attacks, incorporating multiple semantic perturbations; on the defense side, it trains with composed adversarial examples to improve robustness to multiple threats.

  3. How does the paper address this problem?

    First propose the combined adversarial attack CAA with attack order scheduling, then use the samples it generates for adversarial training to obtain GAT.

    Overall approach: first construct a composed adversarial attack (CAA) that can optimize the strength and application order of each perturbation, then incorporate CAA into adversarial training to obtain generalized adversarial training (GAT), making the model robust to both single and composed threats.

    Problem setting and formalization

    • Classifier and attack set: Let the classifier be F : X → R^d, and the attack set Ω={A1,...,An} contain n attack types; each attack Ak has a perturbation interval ϵk=[αk,βk] limiting attack strength, and E is the set of all perturbation intervals.
    • Composed attack form: The i-th schedule uses an assignment function πi to determine the attack order, and the composed adversarial example is xc-adv = Aπi(n)(Aπi(n−1)(⋯ Aπi(1)(x))), i.e., the input is perturbed sequentially in the order Aπi(1) → Aπi(2) → … → Aπi(n).
    • Single-attack strength optimization: The perturbation level δk ∈ ϵk of each attack is optimized by projected gradient descent to maximize the classification loss, argmaxδk ∈ ϵk ℒ(ℱ(Ak(x;δk)), y), which the authors call component-wise PGD (Comp-PGD).

    Attack order scheduling

    • Scheduling matrix: The assignment function is essentially a permutation matrix (Birkhoff polytope), and the authors transform attack order optimization into optimization over a doubly stochastic matrix Z; according to proofs by Sinkhorn and Knopp, any square matrix can be turned into a doubly stochastic matrix by alternating row and column normalization, and they cite Mena et al. [25] for learning the optimal permutation matrix with Sinkhorn normalization.
    • Surrogate composed image: Since xc-adv contains only one attack perturbation per iteration, it is difficult to optimize the likelihood of the other attacks in the scheduling matrix, so the authors introduce a surrogate composed adversarial image xsurr, weighting each type of attack perturbation by its corresponding probability at each iteration and updating Z by maximizing the loss L(F(xsurr), y); given n attacks, the surrogate image is computed over n iterations, with the i-th iteration xsurr^i = Σj zij·Aj(xsurr^{i-1}; δj), x0surr = x.
    • Order determination: The optimized scheduling matrix is passed through Hungarian assignment to obtain the final attack order (Figure 2 pipeline).

    From CAA to GAT

    • Training method: The authors propose using the composed adversarial examples generated by CAA for adversarial training, called generalized adversarial training (GAT), with the goal of generalizing model robustness from a single ℓp-ball to composed semantic perturbations.
    • Design motivation: The authors state that composed perturbations are applied sequentially and that the attack order affects the effectiveness of the composed example, so a sequential scheduling algorithm is needed; this is the key difficulty in extending standard AT to composed perturbations.

    Evaluation method

    • Metrics: On the attack side, attack success rate ASR is used (higher means less robust); on the defense side, robust accuracy RA is used; the ASR in Figure 1(b) is computed on the test samples each model classifies correctly, with the corresponding RA listed in Table 3 (Table 3 is not included in the supplied text).
    • Comparison setting: Figure 1 compares standard training, Madry's ℓ∞ robust training [21], and GAT on ResNet50 on ImageNet, with attacks increasing stepwise from a single Hue to the combination Hue+Sat.+Rot.+Bri.+Con.+ℓ∞.
  4. What experiments did the paper conduct?

    Compare GAT with standard training and ℓ∞ robust training on ImageNet and CIFAR-10 in terms of ASR and robust accuracy under combined attacks.

    Experimental setup

    • Datasets: ImageNet and CIFAR-10 (abstract and introduction); the supplied text does not give the sample sizes used.
    • Models tested: Figure 1 uses ResNet50 on ImageNet, comparing three training methods: standard training (Normal), Madry's ℓ∞ robust training [21], and GAT (this paper's method); the models on CIFAR-10 are not specified in the supplied text.
    • Attack setting: From a single Hue attack stepwise up to Hue+Sat., Hue+Sat.+Rot., Hue+Sat.+Rot.+Bri., Hue+Sat.+Rot.+Bri.+Con., Hue+Sat.+Rot.+Bri.+Con.+ℓ∞, 6 levels of combination in total (horizontal axis of Figure 1(b)).
    • Metrics: ASR (computed on the test samples each model classifies correctly; higher means less robust) and robust accuracy RA (corresponding values in Table 3, which is not included in the supplied text).
    • Baselines: Adversarial training methods [20, 21, 42, 44, 48, 49]; the supplied text does not contain a per-item results table for these baselines.
    • Review method and number of repetitions: Not reported in the supplied text (image classification accuracy, no LLM review).

    Main results

    Figure 1(b) gives the ASR (%) of ResNet50 on ImageNet under the 6 levels of composed attacks (higher means less robust; the numbers in the figure are listed in the order of the converted text, and individual attributions may be misaligned due to layout, as noted):

    Swipe horizontally to read the table

    Attack combinationNormalMadry ℓ∞GAT (Proposed)
    Hue34.339.917.7
    Hue + Sat.45.856.240 (attribution uncertain, see note)
    Hue + Sat. + Rot. + Bri.6566.229.6 (attribution uncertain)
    Hue + Sat. + Rot. + Bri. + Con.72.976.925.8 (attribution uncertain)
    Hue + Sat. + Rot. + Bri. + Con. + ℓ∞95.585.634.6 (attribution uncertain)

    Note: Based on the converted text of Figure 1(b); the row/column attribution of values such as 40, 29.6, 25.8, 34.6, and 19.8 in the plain text is not fully certain, and two further values, 80.3 and 19.8, cannot be attributed, so they are not filled in; the values for the Hue + Sat. + Rot. level are missing from the supplied text.

    • The authors state that Figure 1 shows GAT can maintain robust accuracy as the number of attack types increases, whereas the ℓ∞ robust model is vulnerable to semantic attacks and their combinations.
    • The authors state that, compared with random attack orders, the attack order learned by CAA yields an average ASR improvement of 9% and 7% on CIFAR-10 and ImageNet, respectively.
    • The authors state that, compared with adversarial training baselines [20, 21, 42, 44, 48, 49], GAT's robust accuracy is on average 30%∼60% higher (semantic attacks) and 15%∼22% higher (full attacks); these summary numbers are the authors' claims, and the supplied text does not contain a verifiable baseline results table.

    Other experiments

    The supplied text contains only about the first 4 pages of the paper (up to method Section 3.1); the experiments subsection, Table 3 and the remaining results tables, ablations, and appendices are not included, so no further experimental groups can be listed; no assertions are made about parts the paper did not do.

    Other ablations and analyses

    • Attack order scheduling: Learned attack order vs. random order, average ASR improvement 9% (CIFAR-10), 7% (ImageNet) (introduction contribution item 3).
  5. What are some points that can be further explored?

    The attached text contains no discussion of limitations; the experiments cover ResNet50 on ImageNet/CIFAR-10 and 6 levels of combined attacks.

    Limitations and future directions pointed out by the authors

    • The attached text (abstract, introduction, related work, beginning of method Section 3.1) contains no Limitations, Discussion, or Future Work subsection; the paper does not specifically discuss limitations in the attached portion.

    Scope of experimental coverage

    • Models tested: The models explicitly appearing in the attached portion are ResNet50 on ImageNet (Figure 1), with training methods including standard training, Madry ℓ∞ robust training, and GAT; the models used in the CIFAR-10 experiments are not specified in the attached text.
    • Attack coverage: Semantic perturbations Hue, Saturation, Brightness, Contrast, Rotation and ℓ∞ perturbation, from single attacks to 6 combinations (Figure 1(b)).
    • Baselines: The authors state a comparison with 6 adversarial training baselines [20, 21, 42, 44, 48, 49], but the attached text does not contain the per-item results of these baselines.
    • Metrics and computation method: ASR is computed on the test samples that each model itself classifies correctly (Figure 1(b) caption); the corresponding RA is in Table 3, which is not attached in the text.
    • Information not reported: The attached text does not report sample size, number of repetitions, attack iteration budget, or hyperparameters (such as the number of PGD steps and the specific values of each perturbation interval ϵk).
  6. Summarize the main content of the paper

    Proposes the combined attack CAA and generalized adversarial training GAT, which the authors claim remains robust to both single and combined semantic perturbations.

    This is a paper about combined adversarial robustness: the authors argue that adversarial training targeting only a single ℓp-ball threat model cannot guarantee robustness to multiple semantic perturbations and their combinations, and that evaluation conclusions would be unrealistic.

    • Problem: ℓ∞ robust models are robust to attacks of the same kind, but are vulnerable to semantic attacks such as Hue, Saturation, and Rotation and their combinations (Figure 1); combined perturbations are applied sequentially, and the attack order affects attack effectiveness.
    • Method: Propose CAA—use component-wise PGD to optimize the strength of each attack within its respective perturbation interval, and use a scheduling algorithm based on Sinkhorn normalization and Hungarian assignment to learn the optimal attack order on a doubly stochastic matrix (computing the loss with the aid of the surrogate combined image xsurr); then use CAA samples for adversarial training to obtain GAT.
    • Results (ImageNet, ResNet50, Figure 1(b)): Under the combined attack Hue+Sat.+Rot.+Bri.+Con.+ℓ∞, the ASR of the Normal and Madry ℓ∞ models is 95.5% and 85.6%, respectively, and that of GAT is 34.6% (the attribution of this value follows the order of the converted text, with a risk of layout misalignment).
    • Results (overall figures claimed by the authors): The learned attack order improves ASR over random order by an average of 9% (CIFAR-10) and 7% (ImageNet); GAT's robust accuracy exceeds adversarial training baselines by an average of 30%∼60% (semantic attacks) and 15%∼22% (full attacks).
    • Authors' conclusions: The authors claim that GAT remains robust to all tested single attack types and any of their combinations, and is a step toward robust models that can defend against multiple adversarial attacks; the authors claim this paper is the first work to use a scheduling algorithm to find the optimal attack order for combined adversarial attacks.

Related papers

Show 3 more papers
Read originalCVPR 2023