Fool Your (Vision and) Language Model With Embarrassingly Simple Permutations

Yongshuo Zong, Tingyang Yu, Bingchen Zhao, Ruchika Chavhan, Timothy M. Hospedales
2/12/2026

No official code found. Best implementation: ys-zong/FoolyourVLLMs (15 stars, last commit 2023-10-28).

Abstract

Large language and vision-language models are rapidly being deployed in practice thanks to their impressive capabilities in instruction following, in-context learning, and so on. This raises an urgent need to carefully analyse their robustness so that stakeholders can understand if and when such models are trustworthy enough to be relied upon in any given application. In this paper, we highlight a specific vulnerability in popular models, namely permutation sensitivity in multiple-choice question answering (MCQA). Specifically, we show empirically that popular models are vulnerable to adversarial permutation in answer sets for multiple-choice prompting, which is surprising as models should ideally be as invariant to prompt permutation as humans are. These vulnerabilities persist across various model sizes, and exist in very recent language and vision-language models. Code is available at https://github.com/ys-zong/FoolyourVLLMs.

View on arXivView PDF

Code Implementations(1)

[ICML 2024] Fool Your (Vision and) Language Model With Embarrassingly Simple Permutations

154Python, Jupyter NotebookOct 2, 20232 years ago
adversarial-attacksllmsmcqvision-and-language

Similar Papers

Cite this paper

@article{zong2026fool,
  title  = {Fool Your (Vision and) Language Model With Embarrassingly Simple Permutations},
  author = {Yongshuo Zong and Tingyang Yu and Bingchen Zhao and Ruchika Chavhan and Timothy M. Hospedales},
  year   = {2026},
  eprint = {2310.01651},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/pdf/2310.01651},
  journal = {ICML 2023 2023}
}

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/2310.01651.svg)](https://codeofpaper.com/paper/2310.01651)

Discussion