Pith. sign in

REVIEW 2 cited by

A Unified Wasserstein Distributional Robustness Framework for Adversarial Training

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 2202.13437 v1 pith:XH4LGLJ6 submitted 2022-02-27 cs.LG cs.CV

classification cs.LGcs.CV
keywords adversarialrobustnessdistributionalmethodsframeworktrainingwassersteinalgorithms
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

It is well-known that deep neural networks (DNNs) are susceptible to adversarial attacks, exposing a severe fragility of deep learning systems. As the result, adversarial training (AT) method, by incorporating adversarial examples during training, represents a natural and effective approach to strengthen the robustness of a DNN-based classifier. However, most AT-based methods, notably PGD-AT and TRADES, typically seek a pointwise adversary that generates the worst-case adversarial example by independently perturbing each data sample, as a way to "probe" the vulnerability of the classifier. Arguably, there are unexplored benefits in considering such adversarial effects from an entire distribution. To this end, this paper presents a unified framework that connects Wasserstein distributional robustness with current state-of-the-art AT methods. We introduce a new Wasserstein cost function and a new series of risk functions, with which we show that standard AT methods are special cases of their counterparts in our framework. This connection leads to an intuitive relaxation and generalization of existing AT methods and facilitates the development of a new family of distributional robustness AT-based algorithms. Extensive experiments show that our distributional robustness AT algorithms robustify further their standard AT counterparts in various settings.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. FOCoOp: Enhancing Out-of-Distribution Robustness in Federated Prompt Learning for Vision-Language Models

    cs.CV 2025-06 conditional novelty 5.0 of 10

    FOCoOp uses global, local, and OOD prompts with bi-level distributionally robust optimization and semi-unbalanced optimal transport to improve OOD robustness in federated prompt learning.

  2. Toward Robust Neural Reconstruction from Sparse Point Sets

    cs.CV 2024-12 conditional novelty 5.0 of 10

    A Sinkhorn-regularized DRO training loss improves neural SDF reconstruction from sparse noisy point clouds compared to recent baselines.

Pith tools