mlsanityData to 7 Oct 2026

BadCM: Invisible Backdoor Attack Against Cross-Modal Learning

arXiv 2410.02182 ↗First posted 3 Oct 2024cs.CV cs.CR cs.LGcited by 9

Not on the map. Why?

Abstract (arXiv)

Despite remarkable successes in unimodal learning tasks, backdoor attacks against cross-modal learning are still underexplored due to the limited generalization and inferior stealthiness when involving multiple modalities. Notably, since works in this area mainly inherit ideas from unimodal visual attacks, they struggle with dealing with diverse cross-modal attack circumstances and manipulating imperceptible trigger samples, which hinders their practicability in real-world applications. In this paper, we introduce a novel bilateral backdoor to fill in the missing pieces of the puzzle in the cross-modal backdoor and propose a generalized invisible backdoor framework against cross-modal learning (BadCM). Specifically, a cross-modal mining scheme is developed to capture the modality-invariant components as target poisoning areas, where well-designed trigger patterns injected into these regions can be efficiently recognized by the victim models. This strategy is adapted to different image-text cross-modal models, making our framework available to various attack scenarios. Furthermore, for generating poisoned samples of high stealthiness, we conceive modality-specific generators for visual and linguistic modalities that facilitate hiding explicit trigger patterns in modality-invariant regions. To the best of our knowledge, BadCM is the first invisible backdoor method deliberately designed for diverse cross-modal attacks within one unified framework. Comprehensive experimental evaluations on two typical applications, i.e., cross-modal retrieval and VQA, demonstrate the effectiveness and generalization of our method under multiple kinds of attack scenarios. Moreover, we show that BadCM can robustly evade existing backdoor defenses. Our code is available at https://github.com/xandery-geek/BadCM.

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 44 of its 65 references that are in the map. First posted on arXiv 3 Oct 2024.

Builds on

44 of 65 references.

References · 44

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
  4. 2015U-Net: Convolutional Networks for Biomedical Image Segmentationcited by 19,604
  5. 2014Microsoft COCO: Common Objects in Contextcited by 17,498
  6. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
  7. 2015Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networkscited by 9,617
  8. 2016Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localizationcited by 6,690
  9. 2013Intriguing properties of neural networkscited by 5,114
  10. 2016Image-to-Image Translation with Conditional Adversarial Networkscited by 4,510
  11. 2015VQA: Visual Question Answeringcited by 2,489
  12. 2015Show, Attend and Tell: Neural Image Caption Generation with Visual Attentioncited by 1,421
32 more
  1. 2017Bottom-Up and Top-Down Attention for Image Captioning and Visual Question Answeringcited by 1,310
  2. 2021ViLT: Vision-and-Language Transformer Without Convolution or Region Supervisioncited by 1,224
  3. 2017BadNets: Identifying Vulnerabilities in the Machine Learning Model Supply Chaincited by 1,052
  4. 2017Targeted Backdoor Attacks on Deep Learning Systems Using Data Poisoningcited by 1,012
  5. 2018VizWiz Grand Challenge: Answering Visual Questions from Blind Peoplecited by 852
  6. 2018Fine-Pruning: Defending Against Backdooring Attacks on Deep Neural Networkscited by 550
  7. 2020BERT-ATTACK: Adversarial Attack Against BERT Using BERTcited by 488
  8. 2018Stacked Cross Attention for Image-Text Matchingcited by 414
  9. 2019Deep Modular Co-Attention Networks for Visual Question Answeringcited by 338
  10. 2020Invisible Backdoor Attack with Sample-Specific Triggerscited by 338
  11. 2020Weight Poisoning Attacks on Pre-trained Modelscited by 318
  12. 2020Input-Aware Dynamic Backdoor Attackcited by 304
  13. 2018Bilinear Attention Networkscited by 277
  14. 2020ONION: A Simple and Effective Defense Against Textual Backdoor Attackscited by 231
  15. 2019A backdoor attack against LSTM-based text classification systemscited by 214
  16. 2021Hidden Killer: Invisible Textual Backdoor Attacks with Syntactic Triggercited by 203
  17. 2020BadNL: Backdoor Attacks against NLP Models with Semantic-preserving Improvementscited by 191
  18. 2021Mind the Style of Text! Adversarial and Backdoor Attacks Based on Text Style Transfercited by 147
  19. 2021SPECTRE: Defending Against Backdoor Attacks Using Robust Statisticscited by 123
  20. 2017Multi-modal Factorized Bilinear Pooling with Co-Attention Learning for Visual Question Answeringcited by 117
  21. 2021Turn the Combination Lock: Learnable Textual Backdoor Attacks via Word Substitutioncited by 85
  22. 2017Beyond Bilinear: Generalized Multimodal Factorized High-order Pooling for Visual Question Answeringcited by 79
  23. 2016A Comprehensive Survey on Cross-modal Retrievalcited by 62
  24. 2021Triggerless Backdoor Attack for NLP Tasks with Clean Labelscited by 61
  25. 2021FIBA: Frequency-Injection based Backdoor Attack in Medical Image Analysiscited by 60
  26. 2016Deep Cross-Modal Hashingcited by 54
  27. 2021Poison Ink: Robust and Invisible Backdoor Attackcited by 50
  28. 2020Loss re-scaling VQA: Revisiting the LanguagePrior Problem from a Class-imbalance Viewcited by 36
  29. 2021Dual-Key Multimodal Backdoors for Visual Question Answeringcited by 35
  30. 2022Kallima: A Clean-label Framework for Textual Backdoor Attackscited by 22
  31. 2023Attacks in Adversarial Machine Learning: A Systematic Survey from the Life-cycle Perspectivecited by 19
  32. 2024Object-oriented backdoor attack against image captioningcited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 7; 2026: 2.

9 papers.