Panda: Test-Time Adaptation with Negative Data Augmentation
Not on the map. Why?
Abstract (arXiv)
Pretrained VLMs exhibit strong zero-shot classification capabilities, but their predictions degrade significantly under common image corruptions. To improve robustness, many test-time adaptation (TTA) methods adopt positive data augmentation (PDA), which generates multiple views of each test sample to reduce prediction variance. However, these methods suffer from two key limitations. First, it introduces considerable computational overhead due to the large number of augmentations required per image. Second, it fails to mitigate prediction bias, where the model tends to predict certain classes disproportionately under corruption, as PDA operates on corrupted inputs and typically does not remove the corruption itself. To address these challenges, we propose Panda, a novel TTA method based on negative data augmentation (NDA). Unlike positive augmentations that preserve object semantics, Panda generates negative augmentations by disrupting semantic content. It divides images into patches and randomly assembles them from a shared patch pool. These negatively augmented images retain corruption-specific features while discarding object-relevant signals. We then subtract the mean feature of these negative samples from the original image feature, effectively suppressing corruption-related components while preserving class-relevant information. This mitigates prediction bias under distribution shifts. Panda allows augmentation to be shared across samples within a batch, resulting in minimal computational overhead. Panda can be seamlessly integrated into existing test-time adaptation frameworks and substantially improve their robustness. Our experiments indicate that Panda delivers superior performance compared to PDA methods, and a wide range of TTA methods exhibit significantly enhanced performance when integrated with Panda. Our code is available at https://github.com/ruxideng/Panda .
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 13 Nov 2025.
Builds on
0 of 0 references.
No references here yet.
Built on by
Citing papers per year: 2026: 5.
5 papers.
- 2026Subspace Alignment for Vision-Language Model Test-time Adaptationcited by 5
- 2026What Drives Test-Time Adaptation for CLIP? A Controlled Empirical Study from an Update Perspectivecited by 2
- 2026Temporal Structure Matters for Efficient Test-Time Adaptation in Wearable Human Activity Recognitioncited by 1
- 2026Ramen: Robust Test-Time Adaptation of Vision-Language Models with Active Sample Selectioncited by 0
- 2026Entropy Minimization without Model Collapse: Mitigating Prediction Bias in Medical Imagingcited by 0
- 2026What Drives Test-Time Adaptation for CLIP? A Controlled Empirical Study from an Update Perspective12 Jun 2026
- 2026Entropy Minimization without Model Collapse: Mitigating Prediction Bias in Medical Imaging1 Jun 2026
- 2026Temporal Structure Matters for Efficient Test-Time Adaptation in Wearable Human Activity Recognition6 May 2026
- 2026Ramen: Robust Test-Time Adaptation of Vision-Language Models with Active Sample Selection23 Apr 2026
- 2026Subspace Alignment for Vision-Language Model Test-time Adaptation13 Jan 2026
Similar, not cited
Close in wording, no citation either way
- 2026Efficient Test-time Adaptation through Candidate Verification and Divergence Shifts
- 2025Noisy Test-Time Adaptation in Vision-Language Models
- 2026Dual Distribution Estimation for Zero-shot Noisy Test-Time Adaptation with VLMs
- 2025Adapt in the Wild: Test-Time Entropy Minimization with Sharpness and Feature Regularization
- 2025Segmentation Assisted Incremental Test Time Adaptation in an Open World
- 2025Bayesian Test-Time Adaptation for Vision-Language Models
- 2025Uniformity First: Uniformity-aware Test-time Adaptation of Vision-language Models against Image Corruption
- 2025Free on the Fly: Enhancing Flexibility in Test-Time Adaptation with Online EM