Pith. sign in

REVIEW 1 cited by

Interpretable Adversarial Perturbation in Input Embedding Space for Text

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 1805.02917 v1 pith:GFI5PNDE submitted 2018-05-08 cs.LG cs.CLstat.ML

classification cs.LGcs.CLstat.ML
keywords inputadversarialspaceembeddingfieldperturbationsprocessingapproach
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Following great success in the image processing field, the idea of adversarial training has been applied to tasks in the natural language processing (NLP) field. One promising approach directly applies adversarial training developed in the image processing field to the input word embedding space instead of the discrete input space of texts. However, this approach abandons such interpretability as generating adversarial texts to significantly improve the performance of NLP tasks. This paper restores interpretability to such methods by restricting the directions of perturbations toward the existing words in the input embedding space. As a result, we can straightforwardly reconstruct each input with perturbations to an actual text by considering the perturbations to be the replacement of words in the sentence while maintaining or even improving the task performance.

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. Statistical Runtime Verification for LLMs via Robustness Estimation

    cs.LG 2025-04 conditional novelty 5.0 of 10

    RoMA, a statistical robustness estimator, is adapted to black-box language models and is shown to approximate exact verification within 1% on small networks while scaling to BERT sentiment analysis.

Pith tools