One Word is Enough: Minimal Adversarial Perturbations for Neural Text Ranking

Tanmay Karmakar, Sourav Saha, Debapriyo Majumdar, Surjyanee Halder
1/28/2026
cs.IRcs.CLcs.LG

No confident code implementation found for this paper.

Abstract

Neural ranking models (NRMs) achieve strong retrieval effectiveness, yet prior work has shown they are vulnerable to adversarial perturbations. We revisit this robustness question with a minimal, query-aware attack that promotes a target document by inserting or substituting a single, semantically aligned word - the query center. We study heuristic and gradient-guided variants, including a white-box method that identifies influential insertion points. On TREC-DL 2019/2020 with BERT and monoT5 re-rankers, our single-word attacks achieve up to 91% success while modifying fewer than two tokens per document on average, achieving competitive rank and score boosts with far fewer edits under a comparable white-box setup to ensure fair evaluation against PRADA. We also introduce new diagnostic metrics to analyze attack sensitivity beyond aggregate success rates. Our analysis reveals a Goldilocks zone in which mid-ranked documents are most vulnerable. These findings demonstrate practical risks and motivate future defenses for robust neural ranking.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{karmakar2026word,
  title  = {One Word is Enough: Minimal Adversarial Perturbations for Neural Text Ranking},
  author = {Tanmay Karmakar and Sourav Saha and Debapriyo Majumdar and Surjyanee Halder},
  year   = {2026},
  eprint = {2601.20283},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2601.20283v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2601.20283.svg)](https://codeofpaper.com/paper/2601.20283)

Discussion