Adversarial robustness in structured data remains an underexplored frontier compared to vision and language domains. In this work, we introduce a novel black-box, decision-based adversarial attack tailored for tabular data. Our approach combines gradient-free direction estimation with an iterative boundary search, enabling efficient navigation of discrete and continuous feature spaces under minimal oracle access. Extensive experiments demonstrate that our method successfully compromises nearly the entire test set across diverse models, ranging from classical machine learning classifiers to large language model (LLM)-based pipelines. Remarkably, the attack achieves success rates consistently above 90%, while requiring only a small number of queries per instance. These results highlight the critical vulnerability of tabular models to adversarial perturbations, underscoring the urgent need for stronger defenses in real-world decision-making systems.
@article{arxiv.2509.22850,
title = {Boundary on the Table: Efficient Black-Box Decision-Based Attacks for Structured Data},
author = {Roie Kazoom and Yuval Ratzabi and Etamar Rothstein and Ofer Hadar},
journal= {arXiv preprint arXiv:2509.22850},
year = {2025}
}