Pith. sign in

REVIEW 1 cited by

Adversarial Semantic Collisions

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 2011.04743 v1 pith:S7QZL3SH submitted 2020-11-09 cs.CL cs.CR

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

We study semantic collisions: texts that are semantically unrelated but judged as similar by NLP models. We develop gradient-based approaches for generating semantic collisions and demonstrate that state-of-the-art models for many tasks which rely on analyzing the meaning and similarity of texts-- including paraphrase identification, document retrieval, response suggestion, and extractive summarization-- are vulnerable to semantic collisions. For example, given a target query, inserting a crafted collision into an irrelevant document can shift its retrieval rank from 1000 to top 3. We show how to generate semantic collisions that evade perplexity-based filtering and discuss other potential mitigations. Our code is available at https://github.com/csong27/collision-bert.

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. Search results diversification in competitive search

    cs.IR 2025-01 reject novelty 6.0 of 10

    The paper argues, via game theory and student ranking competitions, that diversity-based search ranking reduces 'mimicking the winner' herding, but the equilibrium proof and the empirical test are both flawed.

Pith tools