TTVD: Towards a Geometric Framework for Test-Time Adaptation Based on Voronoi Diagram
Not on the map. Why?
Abstract (arXiv)
Deep learning models often struggle with generalization when deploying on real-world data, due to the common distributional shift to the training data. Test-time adaptation (TTA) is an emerging scheme used at inference time to address this issue. In TTA, models are adapted online at the same time when making predictions to test data. Neighbor-based approaches have gained attention recently, where prototype embeddings provide location information to alleviate the feature shift between training and testing data. However, due to their inherit limitation of simplicity, they often struggle to learn useful patterns and encounter performance degradation. To confront this challenge, we study the TTA problem from a geometric point of view. We first reveal that the underlying structure of neighbor-based methods aligns with the Voronoi Diagram, a classical computational geometry model for space partitioning. Building on this observation, we propose the Test-Time adjustment by Voronoi Diagram guidance (TTVD), a novel framework that leverages the benefits of this geometric property. Specifically, we explore two key structures: 1) Cluster-induced Voronoi Diagram (CIVD): This integrates the joint contribution of self-supervision and entropy-based methods to provide richer information. 2) Power Diagram (PD): A generalized version of the Voronoi Diagram that refines partitions by assigning weights to each Voronoi cell. Our experiments under rigid, peer-reviewed settings on CIFAR-10-C, CIFAR-100-C, ImageNet-C, and ImageNet-R shows that TTVD achieves remarkable improvements compared to state-of-the-art methods. Moreover, extensive experimental results also explore the effects of batch size and class imbalance, which are two scenarios commonly encountered in real-world applications. These analyses further validate the robustness and adaptability of our proposed framework.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 41 of its 60 references that are in the map. First posted on arXiv 10 Dec 2024.
Builds on
41 of 60 references.
References · 41
- 2017Attention Is All You Needcited by 60,361
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2020Denoising Diffusion Probabilistic Modelscited by 21,076
- 2016Wide Residual Networkscited by 3,070
- 2015Domain-Adversarial Training of Neural Networkscited by 3,044
- 2014Sequence to Sequence Learning with Neural Networkscited by 2,986
- 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,877
- 2020The Many Faces of Robustness: A Critical Analysis of Out-of-Distribution Generalizationcited by 1,850
- 2020Do We Really Need to Access the Source Data? Source Hypothesis Transfer for Unsupervised Domain Adaptationcited by 848
- 2022Continual Test-Time Domain Adaptationcited by 525
- 2022Efficient Test-Time Model Adaptation without Forgettingcited by 469
- 2020Improving robustness against common corruptions by covariate shift adaptationcited by 431
29 more
- 2023Towards Stable Test-Time Adaptation in Dynamic Wild Worldcited by 415
- 2021MEMO: Test Time Robustness via Adaptation and Augmentationcited by 377
- 2020Universal Source-Free Domain Adaptationcited by 220
- 2022Test-Time Training with Masked Autoencoderscited by 212
- 2020Unsupervised Intra-domain Adaptation for Semantic Segmentation through Self-Supervisioncited by 198
- 2021Exploiting the Intrinsic Neighborhood Structure for Source-free Domain Adaptationcited by 177
- 2020Source Data-absent Unsupervised Domain Adaptation through Hypothesis Transfer and Labeling Transfercited by 173
- 2021Source-Free Domain Adaptation for Semantic Segmentationcited by 168
- 2022NOTE: Robust Continual Test-time Adaptation Against Temporal Correlationcited by 151
- 2019MNIST-C: A Robustness Benchmark for Computer Visioncited by 138
- 2020Self-Supervised Learning for Domain Adaptation on Point-Cloudscited by 99
- 2022Test-Time Adaptation via Conjugate Pseudo-labelscited by 98
- 2023Test-Time Training on Nearest Neighbors for Large Language Modelscited by 88
- 2021RotoGrad: Gradient Homogenization in Multitask Learningcited by 83
- 2019Discriminative Adversarial Domain Adaptationcited by 74
- 2020Action Segmentation with Joint Self-Supervised Temporal Domain Adaptationcited by 74
- 2022Test-Time Adaptation via Self-Training with Nearest Neighbor Informationcited by 64
- 2018Mad Max: Affine Spline Insights into Deep Learningcited by 55
- 2019The Geometry of Deep Networks: Power Diagram Subdivisioncited by 53
- 2023AdaNPC: Exploring Non-Parametric Classifier for Test-Time Adaptationcited by 48
- 2018Deep Adversarial Attention Alignment for Unsupervised Domain Adaptation: the Benefit of Target Expectation Maximizationcited by 40
- 2023SplineCam: Exact Visualization and Characterization of Deep Network Geometry and Decision Boundariescited by 31
- 2023ForkMerge: Mitigating Negative Transfer in Auxiliary-Task Learningcited by 28
- 2024The Entropy Enigma: Success and Failure of Entropy Minimizationcited by 24
- 2023Trust your Good Friends: Source-free Domain Adaptation by Reciprocal Neighborhood Clusteringcited by 9
- 2021Max-Affine Spline Insights Into Deep Network Pruningcited by 5
- 2024Continual Domain Adversarial Adaptation via Double-Head Discriminatorscited by 4
- 2022Few-shot Learning as Cluster-induced Voronoi Diagrams: A Geometric Approachcited by 3
- 2024On Clustering Induced Voronoi Diagramscited by 2
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.