Skip to content

Learning What to Fail On: Failure-Mode Contextual Bandits for Adversarial Data Curation

Aug 2026 · Trans. Mach. Learn. Res. · Vol 2026 · 0 citations · 35 references
Computer Science

TL;DR

A failure-aware adversarial retrieval-augmented framework for improving robustness in natural language understanding that combines retrieval, automated validation, contextual-bandit failure selection, and controlled adversarial retraining, enables scalable robustness improvement without additional human annotation.

Abstract

We introduce a failure-aware adversarial retrieval-augmented framework for improving robustness in natural language understanding. Rather than selecting synthetic examples with a fixed reward threshold, our method formulates adversarial data curation as a failure-mode contextual bandit problem. Candidate examples are generated with retrieval-augmented prompting, filtered by the current target model, automatically validated by an LLM judge ensemble, and clustered into recurring failure modes. A stochastic policy then selects which failure modes to sample for retraining, and is updated using validation-based reward that balances robustness gains, forgetting, and data cost. This makes the data curator itself the learning agent, enabling adaptive selection of the most useful model failures across training rounds. On standard benchmarks, our approach improves RoBERTa-base accuracy from 88.48% to 92.60% on SNLI, from 75.04% to 80.95% on ANLI, and from 54.67% to 71.99% on MultiNLI, while consistently outperforming prior adversarial augmentation methods. We further demonstrate transfer to FEVER fact verification, achieving up to 79.86\% FEVER score and 82.45\% accuracy with RoBERTa-large. Finally, we provide a theoretical interpretation showing that, under stated assumptions, failure-mode sampling can reduce shortcut-aligned gradient contributions while inducing bounded distributional drift. By combining retrieval, automated validation, contextual-bandit failure selection, and controlled adversarial retraining, our framework enables scalable robustness improvement without additional human annotation.

View source

Similar papers

Preprint Jul 2026

Automatic Hard Example Synthesis with Multi-Level Agentic Data Curation

Multimodal Large Language Models (MLLMs) are increasingly deployed for nuanced content safety and moderation tasks, yet they remain vulnerable to adversarial attacks and out-of-distribution edge cases. Traditional active learning and manual annotation fail to scale against the complexity and volume of novel multimodal...

Genglin Liu, Muye Zhang, Krishnamurthy Viswanathan et al. · 0 citations
Preprint Aug 2026

Can LLMs Truly Forget? Revealing Unlearning Gaps Through Adversarial Evaluation

Strong standard-metric performance alone is insufficient to establish robustness after unlearning and motivate adversarial stress-testing as a complementary component of unlearning evaluation, showing a substantial gap between clean-query forgetting and adversarial robustness.

A. Gupta, Hima Varshini Surisetty, Sreevidya Bollineni et al. · 1 citation
Open access Jul 2026

From Evaluation to Optimisation: Hierarchy-Aware Training Signals for CWE Prediction in Python

Testing three delivery mechanisms–supervised fine-tuning, a dual-head classification loss, and reinforcement learning with a dense reward derived from the normalised penalty finds that supervised approaches consistently regress below the zero-shot baseline under distribution shift, while GRPO succeeds and generalises a...

Muntasir Adnan, Manile Srun, Carlos C. N. Kuhn · 0 citations
Preprint Jul 2026

Position: It's Time to Optimize LLMs for Self-Consistency

This position paper observes that a wide variety of techniques designed to improve specific aspects of LM behavior-targeting properties as diverse as adversarial robustness and factual coherence-can be understood as special cases of a common "consistency optimization" procedure and addressed with a standard set of opti...

Itamar Hagay Pres, Belinda Z. Li, L. Ruis et al. · 2 citations
Preprint Aug 2026

Catastrophic Learning: A New Attack Vector on Continual Learning Networks

The results demonstrate a strong vulnerability: an adversary can selectively impede plasticity to hinder the acquisition of new knowledge, while promoting loss of prior knowledge, inducing a catastrophic learning scenario.

Benedikt Kluss, Niklas Bunzel · 0 citations

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