Improving Black-box Robustness with In-Context Rewriting
Kyle O'Brien, Nathan Ng, Isha Puri, Jorge Mendez, Hamid Palangi, Yoon Kim, Marzyeh Ghassemi, Thomas Hartvigsen
TL;DR
This work tackles the challenge of out-of-distribution robustness in NLP under black-box constraints by introducing LLM-TTA, a test-time augmentation framework that uses large language models to generate faithful input augmentations. It explores two augmentation modes—zero-shot paraphrasing and In-Context Rewriting (ICR)—and adds entropy-based selective augmentation to reduce expensive LLM calls. Across sentiment, toxicity, and news topic tasks with BERT and T5, LLM-TTA generally improves OOD accuracy, with ICR delivering the strongest gains and only modest or no degradation on ID performance; selective augmentation further boosts efficiency by cutting augmentation rates by about 57.74%. The method is architecture-agnostic, does not require OOD labels, and remains effective in both data-scarce and data-rich settings, with data, models, and code shared for reproducibility.
Abstract
Machine learning models for text classification often excel on in-distribution (ID) data but struggle with unseen out-of-distribution (OOD) inputs. Most techniques for improving OOD robustness are not applicable to settings where the model is effectively a black box, such as when the weights are frozen, retraining is costly, or the model is leveraged via an API. Test-time augmentation (TTA) is a simple post-hoc technique for improving robustness that sidesteps black-box constraints by aggregating predictions across multiple augmentations of the test input. TTA has seen limited use in NLP due to the challenge of generating effective natural language augmentations. In this work, we propose LLM-TTA, which uses LLM-generated augmentations as TTA's augmentation function. LLM-TTA outperforms conventional augmentation functions across sentiment, toxicity, and news classification tasks for BERT and T5 models, with BERT's OOD robustness improving by an average of 4.48 percentage points without regressing average ID performance. We explore selectively augmenting inputs based on prediction entropy to reduce the rate of expensive LLM augmentations, allowing us to maintain performance gains while reducing the average number of generated augmentations by 57.74\%. LLM-TTA is agnostic to the task model architecture, does not require OOD labels, and is effective across low and high-resource settings. We share our data, models, and code for reproducibility.
