Skip to content

Adversarial Frontiers: Minimum-Norm Attack Ensembles for Robustness Evaluation

Jul 2026 · arXiv.org · Vol abs/2607.19855 · 0 citations · 36 references
Computer Science

TL;DR

A unified evaluation framework based on a comprehensive pool of minimum-norm attacks and robustness--perturbation curves across $\ell_0, $\ell_1, $\ell_2$ and $\ell_\infty$ norms", and proposes the Defense Optimality Index to rank defenses by their gap to the defense frontier.

Abstract

Adversarial robustness is commonly evaluated with predefined attack ensembles, such as AutoAttack, at a single perturbation budget $\varepsilon$ and on a selective choice of perturbation norms. We argue this formulation is fundamentally limited. First, robustness--perturbation curves may intersect or decay at different rates across models, making single-$\varepsilon$ rankings unstable. Second, current ensembles provide no evidence of optimality, leaving an unknown gap to worst-case performance. Third, fixed attack configurations provide no systematic control over the trade-off between attack strength and evaluation cost. To address these limitations, we introduce a unified evaluation framework based on a comprehensive pool of minimum-norm attacks and robustness--perturbation curves across $\ell_0$, $\ell_1$, $\ell_2$ and $\ell_\infty$ norms. We define the attack frontier as the worst-case robustness estimate the attack pool produces against a model. We then formalize evaluation as a frontier-approximation problem, constructing minimum-norm attack ensembles, optimized subsets of the comprehensive pool, that approach the frontier under a controllable query budget, with larger budgets monotonically tightening the estimate. Furthermore, we define the defense frontier as the maximum robustness across the model set at each perturbation size. We finally propose the Defense Optimality Index to rank defenses by their gap to the defense frontier, providing a ranking without selecting a reference $\varepsilon$. On CIFAR-10 and ImageNet, our ensembles match or exceed AutoAttack on most defenses at every budget tier, at fixed and controllable query cost, offering practitioners a query-controlled, curve-based alternative to fixed-$\varepsilon$ evaluation.

View source

Similar papers

#machine learning Preprint Oct 2026

Pareto-Improving Adversarial Attacks with Primal-Dual Regularization

Transferable adversarial attacks are arguably the most practical black-box threat model. Under the same perturbation budget, stronger transfer attacks attain higher attack success rate (ASR), yet their imperceptibility also tends to degrade. Under such a fixed-budget protocol, transferability and imperceptibility there...

Yang Dai, Long-Fei Zhang, Wei Tao et al. · 0 citations
#machine learning Preprint Sep 2026

Certifying Lower Bounds for Risk-Sensitive Reinforcement Learning under Adversarial State Perturbations

This paper proposes an empirical method that improves certified lower bounds by selecting the training risk-aversion parameter $\beta$ independently of the risk level used during evaluation, and formulate the risk-sensitive certification problem as a convex optimization and derive its dual to obtain a tractable approxi...

Tong Li, Saunak Kumar Panda, Yi-Sha Xiang · 0 citations
2026

Dueling Bandit: Adversarial Attack and Robust Defense

Dueling bandit algorithms excel in learning from pairwise comparisons, offering robust performance guarantees in benign environments. However, recent evidence suggests that even state-of-the-art methods can be highly susceptible to adversarial manipulation. In this work, we introduce and analyze a post-action attack mo...

Mo Lyu, Chen-Ye Yang, Guan-Lin Liu et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Towards One-for-All Robustness Across a Continuum of Threat Levels

The Threat Conditional Network (TCN) is proposed, grounded in a representation factorization framework that decomposes representation learning into a threat-invariant shared backbone and a lightweight threat-conditional adaptor, enabling flexible and seamless adaptation across an infinite continuum of threat levels dur...

Zhi-Chao Hou, Xiao-Rui Liu · 1 citation
Sep 2026

Combating Overfitting of Adversarial Training Efficiently via Balanced Instance Adaptive Defense

Adversarial training, one of the most effective methods for enhancing neural network robustness, is typically formulated as a min-max game between an attacker and a defender. Despite its success, most adversarial training methods suffer from robust overfitting, leading to a significant gap in robustness between the tra...

Xin-Yue Zhang, Shao-Cong Wu, Qiben Shan et al. · 0 citations
Sep 2026

Towards Transferable Black-Box Attack via Minimizing Maximum Model Discrepancy.

Adversarial attacks on black-box models, which operate without direct access to the target system, present a significant challenge due to the lack of a foundational theory for the transferability of adversarial examples. This paper introduces a paradigm shift in black-box adversarial attacks by minimizing model discrep...

An-Qi Zhao, Tong Chu, Ya-Hao Liu et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.