arXiv Machine Learning
Breaking Adversarial Transferability in Fine-Tuned Speech Recognition
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv AI
Jun 6
Beyond Waveform Robustness: Robust Feature-Vocoder Adversarial Attacks on Automatic Speech Recognition
arXiv:2606. 05678v1 Announce Type: cross Abstract: Automatic speech recognition (ASR) systems have become widely used for multilingual speech-to-text transcription.
arXiv Machine Learning
Jul 21
Precision-Varying Prediction (PVP): Robustifying ASR systems against adversarial attacks
arXiv:2603. 22590v2 Announce Type: replace Abstract: With the increasing deployment of automated and agentic systems, ensuring the adversarial robustness of automatic speech recognition (ASR) models has become highly relevant.
arXiv Computer Vision
Oct 9
Boosting the Local Invariance for Better Adversarial Transferability
The paper introduces LI-Boost, a technique that enhances the local invariance of adversarial perturbations to improve their transferability across models. By demonstrating a positive correlation between local invariance and transferability, the authors show that LI-Boost significantly boosts five categories of transfer-based attacks on ImageNet, including CNNs, ViTs, defense mechanisms, commercial APIs, and vision-language models. Extensive experiments confirm the method’s effectiveness across diverse architectures and attack types.
arXiv AI
Jun 9
Defending Against Malicious Finetuning by Scaling Train-time Adversarial Attacks
arXiv:2606. 07970v1 Announce Type: cross Abstract: Current open-weight large language models (LLMs) are prone to malicious finetuning attacks, which could compromise the safety alignment of LLMs with only a few steps of supervised finetuning (SFT) on poisoned datasets.
arXiv Machine Learning
Oct 9
Fast Adversarial Attacks with Gradient Prediction
The paper introduces a new class of adversarial attacks that eliminate the need for a backward pass by predicting input gradients from forward-pass hidden states using lightweight linear regression. The authors theoretically derive exact affine conditional gradient means, proving optimality in the idealized NTK regime, and empirically demonstrate that their methods recover most of FGSM’s performance while achieving a 532% increase in throughput on practical finite-width models. This approach offers a simple and general way to generate adversarial examples much faster under realistic wall‑clock constraints.
arXiv Machine Learning
Oct 8
Open-Weight LLM Fine-Tuning Defenses are Susceptible to Simple Attacks
The paper examines the vulnerability of open‑weight large language model safeguards that aim to block harmful usage by assuming new harmful behavior arises only through fine‑tuning. It demonstrates that simple, low‑cost attacks—abliteration and prefilling—can significantly increase attack success rates across multiple benchmarks, and proposes an abliteration‑resistant tuning (ART) method that mitigates these attacks. The study shows that safeguarding defenses must be evaluated against a broader range of attack strategies beyond fine‑tuning.