Skip to main content
Search

# Adversarial Robustness

8 related articles

Subscribe to updates
  1. arXiv

    Speech tokenizers turn out to be a semantic attack surface: T-SemAttack lifts word error rates on nine ASR systems from roughly 1–4% to 20–63.6%

    Speech tokenizers compress continuous speech into discrete tokens and serve as the front end of ASR systems and large audio-language models. T-SemAttack skips the full recognition pipeline and instead jointly drifts the representation spaces of several semantic encoders, with a psychoacoustic masking constraint keeping the noise acceptable to listeners while pulling downstream semantic encoding off course. On bilingual multi-speaker data it raises word error rates on nine open-source and black-box ASR systems from about 1–4% on clean speech to 20.004–63.555%, and it introduces ROSETok, a tokenizer trained with noisy training and semantic distillation.

  2. aclanthology.org

    FOM-UL unlearns by editing only a few layers: under 4-bit quantization its residual memorization stays below whole-model baselines with higher retain utility

    Unlearning a large language model no longer requires diffuse updates across the whole model. FOM-UL scores each transformer layer by the ratio of its forget-set gradient norm to its retain-set gradient norm, updates only the few high-scoring layers, and adds layers one at a time when forgetting falls short. Across TOFU, KnowUnDo and MUSE-style evaluations it leaves less residual memorization than GA, NPO and KLD baselines while keeping retain-set utility close to the vanilla model, and it holds a favorable forgetting-utility trade-off under 8-bit and 4-bit post-training quantization, though residual memorization does rise under 4-bit relative to full precision.

  3. Emotion-reading robots can be fooled: attacked accuracy falls below 0.16 while confidence stays at 0.964

    Facial emotion recognition for human-robot interaction is usually judged by clean-set accuracy, yet a robot that maps an emotion estimate to an action also needs to know whether that estimate can be trusted. Comparing five pipelines on a five-class FER2013 subset, the strongest deep residual CNN reaches 0.760 accuracy and 0.753 macro-F1 but collapses with every other trained architecture under gradient attacks: FGSM drops all four below 0.16 accuracy at epsilon 0.01, and PGD drives them near zero at epsilon 0.02 and above. The attacked predictions stay confident, with mean confidence 0.964 under PGD and 96.0% still above a 0.70 threshold after temperature scaling, so thresholding the maximum softmax probability does not separate legitimate from adversarial predictions.

  4. aclanthology.org

    No retraining, fewer harmful compliances: scaling three internal component groups lifts attack-time safety from 43.2% to 69.7%

    The work decomposes an LLM's refusal behavior into a cross-layer pathway: harmful detection heads in early and middle layers pick out harmful tokens, safety neurons in mid-to-late layers carry and stabilize that signal in the residual stream, and refusal heads turn it into a refusal. Scaling the weights of these three component groups without changing architecture raised average safety under GCG attacks from 43.2% to 69.7% across six models, with a 1.7% average accuracy drop on four standard benchmarks.

  5. arXiv

    One character changed, the decision changed: 30 text models and 17 vision models take the same attack candidates

    DecisionRobust evaluates JEV-style decision models under text and image perturbations and prompt injection, and finds that 30 text models and 17 vision models take the same candidate set, with held-out models excluded from candidate selection also incurring errors while label-consistency checks sharply reduce apparent attack success.

  6. Intrusion detection stops leaning on correlation alone: causal graph plus entropy compression cuts 78 flow features to 18 and reaches 97.4% accuracy

    A hybrid intrusion-detection framework that chains causal graph learning, entropy-guided compression, attention fusion, adversarial calibration and trust-weighted federated aggregation into one pipeline reaches 97.4% detection accuracy on CICIDS2017 while cutting the input from 78 features to 18.

  7. arXiv

    Skeleton action recognition gets a quantization plug-in: white-box attack success drops from near 100% to single digits, accuracy stays comparable

    Mainstream contrastive models for self-supervised skeleton-based action recognition had almost no defense against adversarial attacks, where tiny perturbations to skeleton data could sharply degrade recognition. QCLR adds quantization as a plug-in module at two levels of the encoding pipeline, mapping continuous inputs and features to discrete codebooks so small perturbations are absorbed and gradient propagation is broken; integrated into SkeletonCLR, AimCLR and ActCLR on NTU-60, NTU-120 and PKU-MMD, it cuts PGD and SMART attack success rates to single digits while keeping classification accuracy comparable to the original models.

  8. arXiv

    Qwen2.5-VL-7B shows a train/inference gap on 200 COCO images: target-token rank is fixed at 3,488 per step, and the language decoder, not the visual encoder, decides whether the attack lands

    Using a controlled two-stage PGD attack on 200 held-out COCO images with Qwen2.5-VL-7B-Instruct, the authors show that a targeted perturbation can drive teacher-forced training loss for a fixed target caption to near zero while free generation still produces the original correct description, localize this train/inference gap to a single autoregressive step (target-token rank fixed at exactly 3,488 of 152,064 vocabulary entries with zero variance), and trace all 28 decoder layers to show the visual encoder corrupts every image by a comparable margin while the language decoder amplifies the corrupted signal for susceptible images and actively suppresses it for resistant ones (p<0.001, rank-biserial r=0.579).

You’re all caught up