Jun 2025· arXiv.org· Vol abs/2506.24048· 5 citations· 113 references
Computer ScienceMathematics
TL;DR
This work establishes a connection between the so-called consensus hopping as introduced by Riedl et al. and natural evolution strategies commonly applied in the context of adversarial attacks and rigorously relate both methods to gradient-based optimization schemes.
Abstract
Consensus-based optimization (CBO) has established itself as an efficient gradient-free optimization scheme, with attractive mathematical properties, such as mean-field convergence results for non-convex loss functions. In this work, we study CBO in the context of closed-box adversarial attacks, which are imperceptible input perturbations that aim to fool a classifier, without accessing its gradient. Our contribution is to establish a connection between the so-called consensus hopping as introduced by Riedl et al. and natural evolution strategies (NES) commonly applied in the context of adversarial attacks and to rigorously relate both methods to gradient-based optimization schemes. Beyond that, we provide a comprehensive experimental study that shows that despite the conceptual similarities, CBO can outperform NES and other evolutionary strategies in certain scenarios.
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.· IEEE Transactions on Pattern...· 0 citations
This paper proposes a methodology for crafting principled frequency-based adversarial attacks, via a dedicated optimization framework, and proves that the attacks emerge as weighted $\ell_2$-projections onto this set, yielding a general and controlled attack generation mechanism.
Vicky Kouni, Stelios Perrakis, Francis R. Bach et al.· 0 citations
The stealthy transfer attack ST is introduced, a plug-in primal-dual wrapper that adds an $L_\infty$ saturation regularizer to the standard constrained objective and resolves it through a two-step primal-dual update, confirming that the latent imperceptibility advantage of strong transfer attacks can be unlocked by a p...
Yang Dai, Long-Fei Zhang, Wei Tao et al.· 0 citations
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.· IEEE Transactions on Image P...· 0 citations
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.· IEEE Transactions on Signal...· 0 citations
Unrestricted Adversarial Examples (UAEs) pose a growing security challenge to Deep Neural Networks by introducing substantial, semantically natural modifications to images. While current diffusion-based methods improve the naturalness of UAEs, they suffer from two key limitations: an underutilization of the diffusion m...
Zhen-Zhao Pan, Xiao-Gang Zhang, Hua Chen et al.· IEEE Transactions on Pattern...· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 28, 2026
Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.
MIT News · Artificial Intelligence· news.mit.eduOct 27, 2026
Prabha Jha used her experience with MIT Open Learning’s program for senior executives to develop AI solutions for her employer, Verizon, and to write a book.
Assistant Professor Benjamin Lindquist studies how engineers deliberately injected randomness into early AI, giving rise to deep-learning models that sometimes hallucinate.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
