Pith. sign in

REVIEW 2 cited by

Certified Robustness to Text Adversarial Attacks by Randomized [MASK]

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 2105.03743 v3 pith:F5KTRNKA submitted 2021-05-08 cs.CL

classification cs.CL
keywords defensecertifiedmethodmethodstextwordsadversarialattacks
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Recently, few certified defense methods have been developed to provably guarantee the robustness of a text classifier to adversarial synonym substitutions. However, all existing certified defense methods assume that the defenders are informed of how the adversaries generate synonyms, which is not a realistic scenario. In this paper, we propose a certifiably robust defense method by randomly masking a certain proportion of the words in an input text, in which the above unrealistic assumption is no longer necessary. The proposed method can defend against not only word substitution-based attacks, but also character-level perturbations. We can certify the classifications of over 50% texts to be robust to any perturbation of 5 words on AGNEWS, and 2 words on SST2 dataset. The experimental results show that our randomized smoothing method significantly outperforms recently proposed defense methods across multiple datasets.

Discussion (0). Sign in 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. CluCERT: Certifying LLM Robustness via Clustering-Guided Denoising Smoothing

    cs.LG 2025-12 reject novelty 5.0 of 10

    A clustering-based denoising smoothing method claims tighter certified robustness bounds and lower cost for LLMs, but its central certificate depends on a fitted stability factor and an assumed cluster shift.

  2. Bridging Robustness and Generalization Against Word Substitution Attacks in NLP via the Growth Bound Matrix Approach

    cs.CL 2025-07 reject novelty 4.0 of 10

    A Jacobian-magnitude regularization called GBM improves empirical robustness of CNN/LSTM/S4 text classifiers to synonym-substitution attacks, but the claimed certified robustness is not delivered.

Pith tools