Less is More: Pseudo-Label Filtering for Continual Test-Time Adaptation
Not on the map. Why?
Abstract (arXiv)
Continual Test-Time Adaptation (CTTA) aims to adapt a pre-trained model to a sequence of target domains during the test phase without accessing the source data. To adapt to unlabeled data from unknown domains, existing methods rely on constructing pseudo-labels for all samples and updating the model through self-training. However, these pseudo-labels often involve noise, leading to insufficient adaptation. To improve the quality of pseudo-labels, we propose a pseudo-label selection method for CTTA, called Pseudo Labeling Filter (PLF). The key idea of PLF is to keep selecting appropriate thresholds for pseudo-labels and identify reliable ones for self-training. Specifically, we present three principles for setting thresholds during continuous domain learning, including initialization, growth and diversity. Based on these principles, we design Self-Adaptive Thresholding to filter pseudo-labels. Additionally, we introduce a Class Prior Alignment (CPA) method to encourage the model to make diverse predictions for unknown domain samples. Through extensive experiments, PLF outperforms current state-of-the-art methods, proving its effectiveness in CTTA.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 24 of its 48 references that are in the map. First posted on arXiv 3 Jun 2024.
Builds on
24 of 48 references.
References · 24
- 2020FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidencecited by 2,080
- 2020Do We Really Need to Access the Source Data? Source Hypothesis Transfer for Unsupervised Domain Adaptationcited by 844
- 2020RobustBench: a standardized adversarial robustness benchmarkcited by 659
- 2013Domain Generalization via Invariant Feature Representationcited by 622
- 2017Mean teachers are better role models: Weight-averaged consistency targets improve semi-supervised deep learning resultscited by 470
- 2022Efficient Test-Time Model Adaptation without Forgettingcited by 467
- 2020Improving robustness against common corruptions by covariate shift adaptationcited by 427
- 2019A Fourier Perspective on Model Robustness in Computer Visioncited by 288
- 2016Revisiting Batch Normalization For Practical Domain Adaptationcited by 285
- 2022FreeMatch: Self-adaptive Thresholding for Semi-supervised Learningcited by 232
- 2024SuRe: Summarizing Retrievals using Answer Candidates for Open-domain QA of LLMscited by 67
- 2021MT3: Meta Test-Time Training for Self-Supervised Test-Time Adaptioncited by 65
12 more
- 2020Tent: Fully Test-time Adaptation by Entropy Minimizationcited by 59
- 2019Test-Time Training with Self-Supervision for Generalization under Distribution Shiftscited by 55
- 2023IEBins: Iterative Elastic Bins for Monocular Depth Estimationcited by 53
- 2022Exploring Example Influence in Continual Learningcited by 44
- 2021Sinkhorn Label Allocation: Semi-Supervised Classification via Annealed Self-Trainingcited by 32
- 2023Switching Temporary Teachers for Semi-Supervised Semantic Segmentationcited by 23
- 2024Commonsense Prototype for Outdoor Unsupervised 3D Object Detectioncited by 13
- 2023PG-LBO: Enhancing High-Dimensional Bayesian Optimization with Pseudo-Label and Gaussian Process Guidancecited by 9
- 2022TTAPS: Test-Time Adaption by Aligning Prototypes using Self-Supervisioncited by 8
- 2024PALM: Pushing Adaptive Learning Rate Mechanisms for Continual Test-Time Adaptationcited by 8
- 2024DomainVerse: A Benchmark Towards Real-World Distribution Shifts For Tuning-Free Adaptive Domain Generalizationcited by 3
- 2023Geometric Data Augmentations to Mitigate Distribution Shifts in Pollen Classification from Microscopic Imagescited by 2
Built on by
Not cited yet.