DSPrompt: Dynamic Soft Prompt Defense Against M-RAG Corruption
2026-08-17 • Cryptography and Security
Cryptography and SecurityComputation and Language
AI summaryⓘ
The authors address a security problem in systems that combine images and text to find information, which can be tricked by harmful fake data. They propose DSPrompt, a method that adds small learned tweaks inside the search system’s deep layers to make it more resilient without slowing down searches. This method trains by having an attacker and defender compete, improving protection over time while keeping search results accurate and fast. Their tests show DSPrompt works better than old defenses, with less extra computing needed.
Multimodal RetrievalAdversarial AttacksEmbeddingsSoft PromptVisual EncoderTextual EncoderDense RetrievalPoisoning AttacksMin-Max TrainingVector Space
Authors
Chang Liu, Yuni Lai, Mingyue Cui, Cong Tian, Yunyan Zhang, Xian Wu, Kai Zhou, Bin Xiao
Abstract
Multimodal Retrieval Augmented Generation (M-RAG) is increasingly vulnerable to adversarial attacks where malicious data are crafted to produce embeddings that align with benign entries in the vector space, deceiving retrieval and inducing harmful outputs. Existing defenses primarily operate at query time, relying on auxiliary detectors, similarity re-ranking, or feature-consistency checks. However, these approaches suffer from non-trivial inference overhead, generalize poorly to unseen attack strategies, and often assume specific attack distributions. To address this, we propose DSPrompt, a Dynamic Soft Prompt defense framework that directly reshapes the retriever's embedding semantics, without modifying the retrieval pipeline. It inserts few learnable soft prompts into each layer of the visual and textual encoders of a frozen retriever, utilizing a shallow-to-deep length schedule that is adaptive to the capacity in the model layers. These prompts are trained under a dynamic min-max scheme: an online multimodal attacker continually crafts hard adversarial documents against the current retriever, while the defender is updated to push such documents out of the top-k while preserving the ranking and diversity of benign evidence. Because the defended encoder can be pre-computed and indexed exactly as in standard dense retrieval, DSPrompt incurs no additional per-query optimization and introduces fewer than 1% additional parameters. Extensive experiments across four benchmarks and three representative poisoning attacks show that DSPrompt substantially reduces the attack success rate and poison retrieval rate while maintaining near-lossless retrieval utility and generation fidelity, consistently outperforming existing defense baselines at a fraction of their computational cost.