The Power of Order: Fooling LLMs with Adversarial Table Permutations
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866917476427628544 |
|---|---|
| author | Dong, Xinshuai Chen, Haifeng Liu, Xuyuan Chen, Shengyu Wang, Haoyu Xie, Shaoan Zhang, Kun Chen, Zhengzhang |
| author_facet | Dong, Xinshuai Chen, Haifeng Liu, Xuyuan Chen, Shengyu Wang, Haoyu Xie, Shaoan Zhang, Kun Chen, Zhengzhang |
| contents | Large Language Models have achieved remarkable success and are increasingly deployed in critical applications involving tabular data, such as Table Question Answering. However, their robustness to the structure of this input remains a critical, unaddressed question. This paper demonstrates that modern LLMs exhibit a significant vulnerability to the layout of tabular data. Specifically, we show that semantically-invariant permutations of rows and columns - rearrangements that do not alter the table's underlying information - are sometimes sufficient to cause incorrect or inconsistent model outputs. To systematically probe this vulnerability, we introduce Adversarial Table Permutation, a novel, gradient-based attack that efficiently identifies worst-case permutations designed to maximally disrupt model performance. Our extensive experiments demonstrate that ATP significantly degrades the performance of a wide range of LLMs. This reveals a pervasive vulnerability across different model sizes and architectures, including the most recent and popular models. Our findings expose a fundamental weakness in how current LLMs process structured data, underscoring the urgent need to develop permutation-robust models for reliable, real-world applications. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_00445 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | The Power of Order: Fooling LLMs with Adversarial Table Permutations Dong, Xinshuai Chen, Haifeng Liu, Xuyuan Chen, Shengyu Wang, Haoyu Xie, Shaoan Zhang, Kun Chen, Zhengzhang Machine Learning Large Language Models have achieved remarkable success and are increasingly deployed in critical applications involving tabular data, such as Table Question Answering. However, their robustness to the structure of this input remains a critical, unaddressed question. This paper demonstrates that modern LLMs exhibit a significant vulnerability to the layout of tabular data. Specifically, we show that semantically-invariant permutations of rows and columns - rearrangements that do not alter the table's underlying information - are sometimes sufficient to cause incorrect or inconsistent model outputs. To systematically probe this vulnerability, we introduce Adversarial Table Permutation, a novel, gradient-based attack that efficiently identifies worst-case permutations designed to maximally disrupt model performance. Our extensive experiments demonstrate that ATP significantly degrades the performance of a wide range of LLMs. This reveals a pervasive vulnerability across different model sizes and architectures, including the most recent and popular models. Our findings expose a fundamental weakness in how current LLMs process structured data, underscoring the urgent need to develop permutation-robust models for reliable, real-world applications. |
| title | The Power of Order: Fooling LLMs with Adversarial Table Permutations |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2605.00445 |