Pith. sign in

REVIEW 1 cited by

SAFER: A Structure-free Approach for Certified Robustness to Adversarial Word Substitutions

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 2005.14424 v1 pith:UNRSL7AU submitted 2020-05-29 cs.LG cs.CLcs.CRstat.ML

classification cs.LGcs.CLcs.CRstat.ML
keywords certifiedrobustnessmodelswordmethodbertensembleprovably
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

State-of-the-art NLP models can often be fooled by human-unaware transformations such as synonymous word substitution. For security reasons, it is of critical importance to develop models with certified robustness that can provably guarantee that the prediction is can not be altered by any possible synonymous word substitution. In this work, we propose a certified robust method based on a new randomized smoothing technique, which constructs a stochastic ensemble by applying random word substitutions on the input sentences, and leverage the statistical properties of the ensemble to provably certify the robustness. Our method is simple and structure-free in that it only requires the black-box queries of the model outputs, and hence can be applied to any pre-trained models (such as BERT) and any types of models (world-level or subword-level). Our method significantly outperforms recent state-of-the-art methods for certified robustness on both IMDB and Amazon text classification tasks. To the best of our knowledge, we are the first work to achieve certified robustness on large systems such as BERT with practically meaningful certified accuracy.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Unsupervised dense retrieval with conterfactual contrastive learning

    cs.IR 2024-12 conditional novelty 4.0 of 10

    A Shapley-value-based counterfactual regularization improves dense retrievers' robustness to adversarial attacks and enables key passage extraction without passage-level relevance annotations.

Pith tools