Reliable Neural Collapse Approximation for Open-World Test-Time Adaptation

# Reliable Neural Collapse Approximation for Open-World Test-Time Adaptation
Source: [https://arxiv.org/html/2608.19890](https://arxiv.org/html/2608.19890)
Yuangang PanChang\-Dong WangHaizhang ZhangAffiliation:Ivor W\. Tsang, and Joey Tianyi Zhou

###### Abstract

Test\-Time Adaptation \(TTA\) methods aim to bridge the domain gap between the source and target domains\. However, traditional TTA methods become ineffective when the label distribution shift occurs, a challenge commonly referred to as an open\-world scenario\. In this paper, we introduce a new method named Reliable Neural Collapse approximation \(ReNC\) for Open\-World Test\-Time Adaptation \(OWTTA\)\. Specifically, we leverage neural collapse as a structural prior for reliable target\-domain adaptation\. Guided by this prior, we justify that the pre\-trained classifier weights can serve as the prototypes of the source domain\. By measuring the similarity between samples and prototypes, we filter out the Out\-Of\-Distribution \(OOD\) samples for reliable updates\. Furthermore, we propose a neural collapse approximation mechanism to refine these prototypes, ensuring they can gradually adapt to the target domain while maintaining the neural collapse structure\. Extensive experiments on several open\-world benchmarks demonstrate the superiority of the proposed method\. Our empirical analysis suggests that ReNC better preserves NC\-related properties in the target domain, providing useful evidence for explaining reliable OWTTA and offering new insights for model design\. Code is available athttps://github\.com/JiaqiLin\-AI/ReNC\.

111Jia\-Qi Lin, Yuangang Pan, Ivor W\. Tsang, and Joey Tianyi Zhou are with the Centre for Frontier AI Research, Agency for Science, Technology and Research \(A\*STAR\), Singapore 138632\. E\-mails: Lin\_Jiaqi@a\-star\.edu\.sg, Pan\_Yuangang@a\-star\.edu\.sg, ivor\_tsang@a\-star\.edu\.sg, joey\_zhou@a\-star\.edu\.sg\. Jia\-Qi Lin completed this work during his Ph\.D\. study at Sun Yat\-sen University\. Chang\-Dong Wang is with School of Computer Science and Engineering, Sun Yat\-sen University, Guangzhou, China, Key Laboratory of Machine Intelligence and Advanced Computing, Ministry of Education, China, and Guangdong Province Key Laboratory of Computational Science, Guangzhou, China\. E\-mail: changdongwang@hotmail\.com\. Haizhang Zhang is with School of Mathematics \(Zhuhai\), Sun Yat\-sen University, Zhuhai, China\. E\-mail: zhhaizh2@mail\.sysu\.edu\.cn\. Corresponding author: Chang\-Dong Wang\.

## 1Introduction

Test\-Time Adaptation \(TTA\) has attracted significant attention\[[3](https://arxiv.org/html/2608.19890#bib.bib27),[2](https://arxiv.org/html/2608.19890#bib.bib26),[71](https://arxiv.org/html/2608.19890#bib.bib28)\]for its ability to improve the generalization of deep learning models without requiring access to the entire batch of data\. It aims to bridge the distribution gap between training and testing data under conditions ofdata distribution shift, where the training and testing data originate from different domains\. Existing TTA methods\[[4](https://arxiv.org/html/2608.19890#bib.bib16),[47](https://arxiv.org/html/2608.19890#bib.bib29),[7](https://arxiv.org/html/2608.19890#bib.bib30),[17](https://arxiv.org/html/2608.19890#bib.bib31)\]address domain adaptation by either aligning target features with the source distribution or minimizing the entropy of model outputs\. Both approaches have shown impressive effectiveness in enhancing model performance under data distribution shifts\.

![Refer to caption](https://arxiv.org/html/2608.19890v1/imgs/motivation_1_3.png)\(a\)Existing Methods
![Refer to caption](https://arxiv.org/html/2608.19890v1/imgs/motivation_2_3.png)\(b\)ReNC
![Refer to caption](https://arxiv.org/html/2608.19890v1/imgs/motivation_caption.png)\(c\)

Figure 1:Motivation of ReNC\. \(a\) Existing methods use fixed source\-domain prototypes, which may mismatch the target domain\. \(b\) ReNC improves feature\-prototype consistency and adapts prototypes toward target\-domain neural collapse\.A basic assumption of TTA is that the training and testing samples share the same label space\. However, this assumption may be violated in more realistic open\-world scenarios\[[36](https://arxiv.org/html/2608.19890#bib.bib1)\]\. Under the open\-world scenarios, the test data may not only contain seen classes, known asIn\-Distribution \(ID\)data, but also unseen classes, referred to asOut\-Of\-Distribution \(OOD\)data\. This phenomenon, which we refer to as alabel distribution shift, can render existing TTA methods ineffective\. For example, in medical imaging, data distribution shift and label distribution shift often occur due to differences in acquisition devices and new disease that the model has not encountered during training\[[72](https://arxiv.org/html/2608.19890#bib.bib63)\]\. Adapting models to simultaneous data distribution shift and label distribution shift is the known as Open\-World Test\-Time Adaptation \(OWTTA\), which remains a challenge for the community\. There are two primary challenges in OWTTA: 1\) The label distribution shift caused by OOD samples renders the model update process unreliable\. 2\) The domain gap introduced by the data distribution shift further increases the difficulty of effective adaptation\.

Most recently, a limited number of studies\[[36](https://arxiv.org/html/2608.19890#bib.bib1),[31](https://arxiv.org/html/2608.19890#bib.bib58),[15](https://arxiv.org/html/2608.19890#bib.bib25)\]have explored OWTTA as an effective strategy to enhance the generalization abilities of deep neural networks\. They typically employ a two\-step process\[[31](https://arxiv.org/html/2608.19890#bib.bib58),[15](https://arxiv.org/html/2608.19890#bib.bib25)\]to address the aforementioned challenges\. First, the OOD samples are filtered out from the target data to mitigate the negative effects of label distribution shift\. This is typically achieved by measuring the similarity between features and their nearest prototypes to distinguish between ID and OOD samples\. Next, TTA is applied to the remaining ID samples to address the distribution gap caused by data distribution shift\. However, these methods optimize the model using fixed prototypes, which are typically derived either from the source domain or the pre\-trained classifier\. In practice, source prototypes are often unavailable due to computational constraints\[[38](https://arxiv.org/html/2608.19890#bib.bib13),[29](https://arxiv.org/html/2608.19890#bib.bib57)\], privacy concerns\[[39](https://arxiv.org/html/2608.19890#bib.bib72),[34](https://arxiv.org/html/2608.19890#bib.bib73)\], or copyright restrictions\[[13](https://arxiv.org/html/2608.19890#bib.bib50)\]\. Moreover, even when accessible, prototypes from the source domain often fail to align well with the target domain due to the data distribution shift\. As illustrated in Figure[1a](https://arxiv.org/html/2608.19890#S1.F1.sf1), existing method\[[36](https://arxiv.org/html/2608.19890#bib.bib1)\]push features toward fixed prototypes of the source domain leading to suboptimal performance due to the domain gap with the target domain\.

In this paper, we introduce a new OWTTA method, Reliable Neural Collapse Approximation \(ReNC\), which addresses the aforementioned challenges by approximating the neural collapse structure in the target domain\. Neural collapse\[[73](https://arxiv.org/html/2608.19890#bib.bib2)\]describes a terminal geometry of well\-trained classification neural networks, where features become intra\-class compact, class means align with classifier weights, and classification behaves like nearest\-class\-center prediction\. Motivated by this property, we leverage neural collapse as a reliable structural prior to guide OWTTA\.However, as neural collapse typically occurs only with labeled source data, it cannot be directly achieved on unlabeled target data\.Therefore, our ReNC method is proposed to reliably approximate the neural collapse state in the target domain\. As illustrated in Figure[1b](https://arxiv.org/html/2608.19890#S1.F1.sf2), ReNC not only pushes target features toward their corresponding prototypes, but also updates the prototypes to approximate the target\-domain neural collapse state\. Specifically, considering that the pre\-trained source model has already collapsed, we introduce a parameter\-free mechanism to filter out OOD samples for reliable updates\. This mechanism evaluates the similarity of the target domain features to prototypes, ensuring the adaptation process focuses on ID samples\. Furthermore, we formulate neural collapse approximation as a progressive adaptation process that encourages reliable target features to approach their corresponding prototypes, while updating the prototypes with prior\-regularized adaptation to preserve the underlying neural collapse geometry\. Benefiting from reliable and efficient updates, ReNC achieves a better neural collapse state in the target domain without access to the entire target data batch\. We summarize the contributions as follows:

- ∙\\bulletWe are the first study to introduce the concept of neural collapse to OWTTA\. And we justify that classifier weights are equivalent to source domain prototypes from the neural collapse perspective\.
- ∙\\bulletWe introduce a new OWTTA framework, called ReNC, featuring an efficient updating mechanism to approximate the neural collapse state in the target domain, which provides a reliable structural prior for TTA\.
- ∙\\bulletExtensive experiments on several open\-world benchmarks demonstrate the effectiveness of ReNC in OWTTA, and further analyses show that ReNC better preserves NC\-related representation properties during target adaptation\.

The rest of this paper is organized as follows: In Section[2](https://arxiv.org/html/2608.19890#S2), we define the problem definition of OWTTA and provide a brief review of the related literature\. Section[3](https://arxiv.org/html/2608.19890#S3)introduces our ReNC method, progressing from the basic concepts to the final approach\. In Section[4](https://arxiv.org/html/2608.19890#S4), we present a thorough evaluation based on extensive experiments to validate the effectiveness of the ReNC approach\. Finally, Section[5](https://arxiv.org/html/2608.19890#S5)provides a summary of the key findings and concludes the paper\.

## 2Problem Definition and Literature Review

In this section, we first introduce the setting of closed\-world test\-time adaptation\. Then, we extend the problem to the open\-world scenario, where data contains label distribution shifts\. Lastly, we compare this setting with OOD detection and universal domain adaptation, discussing the differences between them and OWTTA\.

### 2\.1Test\-Time Adaptation

Data Distribution Shift:We consider the classification tasks where𝒳\\mathcal\{X\}and𝒴\\mathcal\{Y\}represent the data space and the label space, respectively\. There are two distinct distributions over𝒳×𝒴\\mathcal\{X\}\\times\\mathcal\{Y\}, referred to as the source domain𝒟S\\mathcal\{D\}\_\{S\}and the target domain𝒟T\\mathcal\{D\}\_\{T\}\. The data distribution shift occurs because the source data set𝒮S\\mathcal\{S\}\_\{S\}and the target data set𝒮T\\mathcal\{S\}\_\{T\}are drawn independently from two different domains,𝒟S\\mathcal\{D\}\_\{S\}and𝒟T\\mathcal\{D\}\_\{T\}, respectively, resulting in differences in their distributions:

𝒮S=\{\(𝐱i,yi\)\|𝐱i∈𝒟S\},𝒮T=\{𝐱i\|𝐱i∈𝒟T\}\.\\mathcal\{S\}\_\{S\}=\\left\\\{\\left\(\\mathbf\{x\}\_\{i\},y\_\{i\}\\right\)\|\\mathbf\{x\}\_\{i\}\\in\\mathcal\{D\}\_\{S\}\\right\\\},\\quad\\mathcal\{S\}\_\{T\}=\\left\\\{\\mathbf\{x\}\_\{i\}\|\\mathbf\{x\}\_\{i\}\\in\\mathcal\{D\}\_\{T\}\\right\\\}\.
Various domain adaptation methods\[[42](https://arxiv.org/html/2608.19890#bib.bib61),[22](https://arxiv.org/html/2608.19890#bib.bib62)\]have been proposed to eliminate the domain gap between𝒟S\\mathcal\{D\}\_\{S\}and𝒟T\\mathcal\{D\}\_\{T\}\. Among all these methods, Test\-Time Adaptation \(TTA\)\[[68](https://arxiv.org/html/2608.19890#bib.bib20),[59](https://arxiv.org/html/2608.19890#bib.bib19)\]has gained significant attention for its assumption that the model cannot access source data and target labels, making it more suitable for real\-world applications\.

A number of TTA methods are inspired by the self\-training and employ various techniques for unlabeled target data adaptation\[[17](https://arxiv.org/html/2608.19890#bib.bib31),[14](https://arxiv.org/html/2608.19890#bib.bib32)\]\. Test\-time entropy minimization \(TENT\)\[[65](https://arxiv.org/html/2608.19890#bib.bib14)\]is proposed to update only the parameters in the batch normalization layer by minimizing the entropy of logits\. Source Hypothesis Transfer \(SHOT\)\[[38](https://arxiv.org/html/2608.19890#bib.bib13)\]freezes the classifier of the source model and updates the feature extraction module by minimizing entropy while maintaining balanced distribution in the target domain\.

Besides, the distribution alignment techniques are also utilized in TTA by treating the source domain distribution as an anchor for aligning the features of the target domain\[[58](https://arxiv.org/html/2608.19890#bib.bib33),[28](https://arxiv.org/html/2608.19890#bib.bib34),[44](https://arxiv.org/html/2608.19890#bib.bib35)\]\. Test\-time training method\[[41](https://arxiv.org/html/2608.19890#bib.bib22)\]modified pre\-training procedure to acquire the statistic information of source domain without accessing source data when adaptation\. Nevertheless, such a scheme is still impractical since it alternates the pre\-training procedure\. To tackle this issue,\[[60](https://arxiv.org/html/2608.19890#bib.bib23)\]improves TTA performance by saving the distribution of the source domain and aligning the high\-confidence target features towards the distribution for updating without altering pre\-training\.

Additionally, self\-supervised learning techniques are also widely used in TTA since they do not need to consider the semantic information of the target data\[[18](https://arxiv.org/html/2608.19890#bib.bib36)\]\. For example, contrastive learning is introduced\[[6](https://arxiv.org/html/2608.19890#bib.bib24)\]to refine the online pseudo labeling process, leveraging the self\-supervised techniques to enhance the target feature adaptation\. The self\-supervised training branch is introduced\[[63](https://arxiv.org/html/2608.19890#bib.bib21)\]to fine\-tune the parameters of the feature encoder during adaptation\.

While most test\-time adaptation \(TTA\) methods have been developed under the assumption of static target distributions and focus primarily on visual data, recent works have begun exploring more complex and realistic settings\. Some studies consider scenarios where the target domain distribution changes continuously over time\[[67](https://arxiv.org/html/2608.19890#bib.bib18),[48](https://arxiv.org/html/2608.19890#bib.bib17),[16](https://arxiv.org/html/2608.19890#bib.bib69),[10](https://arxiv.org/html/2608.19890#bib.bib64)\], and\[[74](https://arxiv.org/html/2608.19890#bib.bib66)\]further extend this to evolving environments where the proportions of existing classes vary dynamically, potentially leading to class imbalance\. In parallel,\[[75](https://arxiv.org/html/2608.19890#bib.bib70)\]investigates TTA in the context of tabular data, and proposes a method that estimates the test\-time label distribution using confident predictions and calibrates model outputs accordingly\. Furthermore, Vision\-Language Models \(VLMs\)\[[53](https://arxiv.org/html/2608.19890#bib.bib67)\]have also been explored for test\-time adaptation through prompt tuning, where prompts are optimized without labels to improve both accuracy and calibration during inference\[[70](https://arxiv.org/html/2608.19890#bib.bib68)\]\.

### 2\.2Open\-World Test\-Time Adaptation

Label distribution shift:Existing TTA methods have achieved significant improvement, assuming that the source and target domain have the same label space\. In the open\-world scenario, however, this assumption may be violated\[[50](https://arxiv.org/html/2608.19890#bib.bib71)\], with the distribution shift existing in both the data space𝒳\\mathcal\{X\}and the label space𝒴\\mathcal\{Y\}, simultaneously\.

This shift is characterized by the divergence between the source label space and the target label space\. The label set of the target domain𝒴T\\mathcal\{Y\}\_\{T\}contains not only the labels from the source domain𝒴S\\mathcal\{Y\}\_\{S\}, but also additional labels from new classes, denoted as𝒴O\\mathcal\{Y\}\_\{O\}:

𝒴T=\{𝒴S∪𝒴O\},𝒴S∩𝒴𝒪=∅\.\\mathcal\{Y\}\_\{T\}=\\left\\\{\\mathcal\{Y\}\_\{S\}\\cup\\mathcal\{Y\}\_\{O\}\\right\\\},\\quad\\mathcal\{Y\}\_\{S\}\\cap\\mathcal\{Y\_\{O\}\}=\\emptyset\.
Based on the label of samples, the target data set𝒮T\\mathcal\{S\}\_\{T\}can be further partitioned into the In\-Distribution \(ID\) sample set𝒮TI\\mathcal\{S\}\_\{T\_\{I\}\}and the Out\-Of\-Distribution \(OOD\) sample set𝒟TO\\mathcal\{D\}\_\{T\_\{O\}\}:

𝒮TI=\\displaystyle\\mathcal\{S\}\_\{T\_\{I\}\}=\{𝐱i\|𝐱i∈𝒟TI,Ψ\(𝐱i\)∈𝒴S\},\\displaystyle\\left\\\{\\mathbf\{x\}\_\{i\}\|\\mathbf\{x\}\_\{i\}\\in\\mathcal\{D\}\_\{T\_\{I\}\},\\Psi\(\\mathbf\{x\}\_\{i\}\)\\in\\mathcal\{Y\}\_\{S\}\\right\\\},𝒮TO=\\displaystyle\\mathcal\{S\}\_\{T\_\{O\}\}=\{𝐱i\|𝐱i∈𝒟TO,Ψ\(𝐱i\)∈𝒴O\},\\displaystyle\\left\\\{\\mathbf\{x\}\_\{i\}\|\\mathbf\{x\}\_\{i\}\\in\\mathcal\{D\}\_\{T\_\{O\}\},\\Psi\(\\mathbf\{x\}\_\{i\}\)\\in\\mathcal\{Y\}\_\{O\}\\right\\\},where𝒟TI\\mathcal\{D\}\_\{T\_\{I\}\}represents the domain of ID samples,𝒟TO\\mathcal\{D\}\_\{T\_\{O\}\}represents the domain of OOD samples, andΨ\\Psiis the ground truth mapping\. OWTTA requires a robust method to ensure that the adaptation process focuses on the ID samples while minimizing the adverse impact of the OOD samples\.

Few TTA methods have taken the open\-world scenario into consideration\. Open\-World Test\-Time Training \(OWT3222To avoid confusion, we renamed the OWTTT method to OWT3\.\)\[[36](https://arxiv.org/html/2608.19890#bib.bib1)\]distinguishes OOD samples based on the distance between target data and prototypes from the source domain\. It then expands the prototype pool and aligns the ID samples with statistical information from the source domain for reliable adaptation\. OSTTA\[[31](https://arxiv.org/html/2608.19890#bib.bib58)\]measures sample confidence based on the probability values of logits\. It leverages the wisdom of crowds to select high\-confidence samples and applies entropy minimization exclusively to these selected samples\. The Unified Entropy Optimization \(UniEnt\)\[[15](https://arxiv.org/html/2608.19890#bib.bib25)\]method introduces two Gaussian Mixture Models \(GMMs\) to model ID and OOD samples based on their distance to the nearest prototypes\. UniEnt then minimizes the entropy of ID samples while maximizing the entropy of OOD samples to enhance the TTA performance\.

### 2\.3Related Branches

Out\-of\-Distribution Detection\.OOD detection aims to identify samples outside the training distribution, which is important for reliable model deployment\. Existing methods usually design post\-hoc scoring functions based on logits\[[21](https://arxiv.org/html/2608.19890#bib.bib37),[40](https://arxiv.org/html/2608.19890#bib.bib38),[61](https://arxiv.org/html/2608.19890#bib.bib40)\], feature representations\[[62](https://arxiv.org/html/2608.19890#bib.bib39),[55](https://arxiv.org/html/2608.19890#bib.bib41),[66](https://arxiv.org/html/2608.19890#bib.bib42)\], or gradient information\[[23](https://arxiv.org/html/2608.19890#bib.bib43),[24](https://arxiv.org/html/2608.19890#bib.bib44)\]\. Some studies further improve OOD detection by re\-training classifiers with auxiliary OOD datasets\[[35](https://arxiv.org/html/2608.19890#bib.bib45),[43](https://arxiv.org/html/2608.19890#bib.bib46)\]or generated synthetic OOD samples\[[64](https://arxiv.org/html/2608.19890#bib.bib47),[32](https://arxiv.org/html/2608.19890#bib.bib48),[12](https://arxiv.org/html/2608.19890#bib.bib49)\]\. OOD detection methods require access to entire batches of data at once and do not account for data distribution shifts\. In contrast, OWTTA must adapt and make inferences instantly with new incoming batches, addressing both data and label distribution shifts simultaneously\.

Universal Domain Adaptation\.Similar to TTA, existing domain adaptation methods focus on data distribution shifts while neglecting label distribution shifts in the target domain\. To provide more flexibility in real\-world scenarios, universal \(or open\-set\) domain adaptation methods have been proposed\[[71](https://arxiv.org/html/2608.19890#bib.bib28),[5](https://arxiv.org/html/2608.19890#bib.bib51),[33](https://arxiv.org/html/2608.19890#bib.bib52),[54](https://arxiv.org/html/2608.19890#bib.bib53)\]\. These methods require access to both source and target data, making them impractical in real\-world scenarios where source data is inaccessible due to privacy or security concerns\. To address this issue, source\-free universal domain adaptation methods\[[52](https://arxiv.org/html/2608.19890#bib.bib55),[13](https://arxiv.org/html/2608.19890#bib.bib50),[37](https://arxiv.org/html/2608.19890#bib.bib54),[51](https://arxiv.org/html/2608.19890#bib.bib56)\]have been developed, which only require target data for adaptation\. Unlike universal domain adaptation, which requires access to entire batches of data, OWTTA handles a more challenging scenario\. In OWTTA, while all test data can be processed at once, inference and adaptation must be performed instantly with new incoming batches\.

Test\-Time Augmentation\.Test\-time augmentation improves prediction robustness by generating multiple augmented views of each test sample and aggregating their predictions\[[56](https://arxiv.org/html/2608.19890#bib.bib74),[27](https://arxiv.org/html/2608.19890#bib.bib75),[26](https://arxiv.org/html/2608.19890#bib.bib76)\]\. These methods mainly exploit input\-level diversity to obtain more stable predictions\. Test\-time augmentation improves generalization under domain shifts by leveraging input\-level diversity, whereas OWTTA focusing on adapting the model to a specific target domain in the presence of OOD interference\.

## 3Methodology

In this section, we propose Reliable Neural Collapse approximation \(ReNC\) for open\-world test\-time adaptation\. The key motivation of ReNC is to exploit neural collapse as a structural prior for reliable target\-domain adaptation\. Specifically, we theoretically justify that, when a well\-trained source model exhibits an NC\-like geometry, its classifier weights can be interpreted as class prototypes\. Based on this prior, ReNC first identifies reliable target samples according to their distances to the nearest prototypes, thereby filtering out OOD samples for reliable updates\. Then, it progressively refines the source\-domain prototypes with reliable target features and updates the model parameters under a geometry\-preserving constraint in an alternating manner, encouraging the target representation to evolve toward an NC\-like structure\. In this way, ReNC effectively adapts the model to the target domain while maintaining a compact, balanced, and well\-structured representation space\.

![Refer to caption](https://arxiv.org/html/2608.19890v1/imgs/noise_entropy_histogram.png)\(a\)CIFAR10\-C & Noise
![Refer to caption](https://arxiv.org/html/2608.19890v1/imgs/SVHN_entropy_histogram.png)\(b\)CIFAR10\-C & SVHN

Figure 2:Entropy of CIFAR10\-C with OOD samples \(\(a\) Gaussian noise and \(b\) SVHN\) pre\-trained on CIFAR10\. Minimizing entropy facilitates adaptation to the target domain\. However, indiscriminately minimizing all entropy in an open\-world scenario would degrade the model performance\.We start by developing a simple, reliable update rule and then progressively refine our approach to handle more practical scenarios in an open\-world setting\.

### 3\.1Reliable Update by Filtering Out OOD Samples

Given a model pre\-trained on the source domainF⁡\(𝜽,⋅\)F\\left\(\\bm\{\\theta\},\\cdot\\right\), its logits𝐩it\\mathbf\{p\}\_\{i\}^\{t\}can be represented by:

𝐩it=F⁡\(𝜽,𝐱it\)=σ⁡\(𝐰​f​\(𝜽,𝐱it\)\+𝐛\)=σ⁡\(𝐰𝐳it\+𝐛\),\\displaystyle\\mathbf\{p\}\_\{i\}^\{t\}=F\\left\(\\bm\{\\theta\},\\mathbf\{x\}\_\{i\}^\{t\}\\right\)=\\sigma\\left\(\\mathbf\{w\}f\\left\(\\bm\{\\theta\},\\mathbf\{x\}\_\{i\}^\{t\}\\right\)\+\\mathbf\{b\}\\right\)=\\sigma\\left\(\\mathbf\{w\}\\mathbf\{z\}\_\{i\}^\{t\}\+\\mathbf\{b\}\\right\),where𝐱it\\mathbf\{x\}\_\{i\}^\{t\}is the input at thett\-th batch,f⁡\(𝜽,⋅\)f\(\\bm\{\\theta\},\\cdot\)is the encoder,𝐳it\\mathbf\{z\}^\{t\}\_\{i\}is the feature,σ⁡\(⋅\)\\sigma\(\\cdot\)is the activation function, and𝐰\\mathbf\{w\}and𝐛\\mathbf\{b\}denote the classifier weights and bias, respectively\.

Existing closed\-world TTA methods assume that, despite the presence of data distribution shifts, the entropy values\[[1](https://arxiv.org/html/2608.19890#bib.bib3)\]for target domain samples corresponding to each class remain relatively low during inferring\. Based on this assumption, a straightforward way to adaptF⁡\(𝜽,⋅\)F\(\\bm\{\\theta\},\\cdot\)to the target domain𝒟T\\mathcal\{D\}\_\{T\}is to minimize the entropy of each logit:

ℒe​\(𝜽\)=1N​∑i=1NH⁡\(𝐩it\),\\mathcal\{L\}\_\{e\}\\left\(\\bm\{\\theta\}\\right\)=\\frac\{1\}\{N\}\\sum\_\{i=1\}^\{N\}H\\left\(\\mathbf\{p\}\_\{i\}^\{t\}\\right\),\(1\)whereH⁡\(⋅\)H\(\\cdot\)is the entropy function\.

However, in the open\-world scenario, label distribution shift exists in test samples\. As shown in Figure[2](https://arxiv.org/html/2608.19890#S3.F2), the entropy of ID and OOD samples are mixed together, complicating the process of minimizing entropy\. Since the goal of minimizing entropy is to encourage each logit to form a sharp \(one\-hot\) distribution, simply reducing the entropy of all test samples can disrupt the adaptation process\.

![Refer to caption](https://arxiv.org/html/2608.19890v1/imgs/ood_noise.png)\(a\)CIFAR10\-C&Noise
![Refer to caption](https://arxiv.org/html/2608.19890v1/imgs/ood_SVHN.png)\(b\)CIFAR10\-C&SVHN

Figure 3:t\-SNE visualization of extracted features on CIFAR10\-C with OOD samples \(\(a\) Gaussian noise and \(b\) SVHN\) pre\-trained on CIFAR10\. Prototypes are generated using the feature class\-means of source samples\.![Refer to caption](https://arxiv.org/html/2608.19890v1/imgs/noise_ss_histogram.png)\(a\)CIFAR10\-C & Noise
![Refer to caption](https://arxiv.org/html/2608.19890v1/imgs/SVHN_ss_histogram.png)\(b\)CIFAR10\-C & SVHN

Figure 4:Similarity scores of CIFAR10\-C with OOD samples \(\(a\) Gaussian noise and \(b\) SVHN\) pre\-trained on CIFAR10\. The differences in the similarity scores between ID and OOD samples provide a basis for their discrimination\.To enhance the reliability of the update process, we investigate a selective updating strategy to split the ID and OOD samples\. As shown in Figure[3](https://arxiv.org/html/2608.19890#S3.F3), ID and OOD samples exhibit distinct feature distributions, where ID samples tend to cluster around their corresponding class prototypes, computed by averaging the samples in each class\. Inspired by few\-shot learning\[[57](https://arxiv.org/html/2608.19890#bib.bib4)\], we aim to transform the problem of distinguishing between ID and OOD samples into a two\-cluster clustering problem\. To achieve this, we construct a similarity\-based measure using multiple prototypes to differentiate between ID and OOD samples\.

Specifically, givenKKprototypes from source domain as𝐂=\{𝐜j\}j=1K\\mathbf\{C\}=\\left\\\{\\mathbf\{c\}\_\{j\}\\right\\\}\_\{j=1\}^\{K\}, where𝐜j\\mathbf\{c\}\_\{j\}is calculated by the mean value of the features fromjj\-th class, the similarity score between the test sample and its nearest prototype is:

sit=1−max𝐜j∈𝐂​𝐳it⊤​𝐜j‖𝐳it‖​‖𝐜j‖\.s^\{t\}\_\{i\}=1\-\\underset\{\\mathbf\{c\}\_\{j\}\\in\\mathbf\{C\}\}\{\\max\}\\frac\{\\mathbf\{z\}\_\{i\}^\{t^\{\\top\}\}\\mathbf\{c\}\_\{j\}\}\{\\\|\\mathbf\{z\}\_\{i\}^\{t\}\\\|\\\|\\mathbf\{c\}\_\{j\}\\\|\}\.\(2\)
Some existing method\[[15](https://arxiv.org/html/2608.19890#bib.bib25)\]utilize a symmetric Gaussian Mixture Models \(GMMs\) with two components to fit ID and OOD samples based on their similarity scores\. However, it is inappropriate because each component does not adhere to a symmetric Gaussian distribution, as shown in Figure[4](https://arxiv.org/html/2608.19890#S3.F4)\. Instead, we approach this problem by learning an adaptive thresholdτt\\tau\_\{t\}to partition ID and OOD samples, effectively treating it as a clustering task:

minτt\\displaystyle\\underset\{\\tau\_\{t\}\}\{\\min\}1N\+​∑i\[sit−1N\+​∑j𝟏​\(sjt≤τt\)​sjt\]2\\displaystyle\\frac\{1\}\{N^\{\+\}\}\\sum\_\{i\}\\Big\[s\_\{i\}^\{t\}\-\\frac\{1\}\{N^\{\+\}\}\\sum\_\{j\}\\mathbf\{1\}\(s\_\{j\}^\{t\}\\leq\\tau\_\{t\}\)s\_\{j\}^\{t\}\\Big\]^\{2\}\(3\)\+1N−∑i\[sit−1N−∑j𝟏\(sjt\>τt\)sjt\]2,\\displaystyle\+\\frac\{1\}\{N^\{\-\}\}\\sum\_\{i\}\\Big\[s\_\{i\}^\{t\}\-\\frac\{1\}\{N^\{\-\}\}\\sum\_\{j\}\\mathbf\{1\}\(s\_\{j\}^\{t\}\>\\tau\_\{t\}\)s\_\{j\}^\{t\}\\Big\]^\{2\},whereN\+=∑i𝟏​\(sit≤τt\)N^\{\+\}=\\sum\_\{i\}\\mathbf\{1\}\\left\(s^\{t\}\_\{i\}\\leq\\tau\_\{t\}\\right\)andN−=∑i𝟏​\(sit\>τt\)N^\{\-\}=\\sum\_\{i\}\\mathbf\{1\}\\left\(s\_\{i\}^\{t\}\>\\tau\_\{t\}\\right\)represent the number of ID and OOD samples respectively\. Optimizing Eq\. \([3](https://arxiv.org/html/2608.19890#S3.E3)\) enables finding an optimal thresholdτt∗\\tau\_\{t\}^\{\*\}to minimize the intra\-cluster variations\. Then, the objective function can be revised into:

ℒe\+​\(𝜽,𝐂\)=1N\+​∑i=1N\+H⁡\(𝐩it\)\.\\mathcal\{L\}\_\{e\}^\{\+\}\\left\(\\bm\{\\theta\},\\mathbf\{C\}\\right\)=\\frac\{1\}\{N^\{\+\}\}\\sum\_\{i=1\}^\{N^\{\+\}\}H\\left\(\\mathbf\{p\}\_\{i\}^\{t\}\\right\)\.\(4\)
By applying Eq\. \([4](https://arxiv.org/html/2608.19890#S3.E4)\), reliable updates can be achieved by minimizing the entropy ofN\+N^\{\+\}samples\.

In this process, the prototypes𝐂\\mathbf\{C\}serve as reliable class anchors for distinguishing ID samples from OOD ones, and thus are crucial for stable target\-domain updates\.

![Refer to caption](https://arxiv.org/html/2608.19890v1/imgs/ETF2.png)\(a\)K=2K=2
![Refer to caption](https://arxiv.org/html/2608.19890v1/imgs/ETF3.png)\(b\)K=3K=3
![Refer to caption](https://arxiv.org/html/2608.19890v1/imgs/ETF4.png)\(c\)K=4K=4

Figure 5:Simplex Equiangular Tight Frame \(Simplex ETF\) with different class numbers\.
### 3\.2Source\-Free Update with Pre\-trained Classifier Weights

As discussed in Subsection[3\.1](https://arxiv.org/html/2608.19890#S3.SS1), reliable updates rely on access to class prototypes\. However, in Open\-World Test\-Time Adaptation \(OWTTA\), such prototype information is unavailable, since only a pre\-trained model is given and unlabeled target samples arrive batch\-by\-batch\. Therefore, we derive the prototypes directly from the pre\-trained model itself\.

Recent neural collapse theory\[[76](https://arxiv.org/html/2608.19890#bib.bib5)\]provides a principled explanation for the final state of supervised training\. Specifically, when a sufficiently large neural network is well\-trained on the training data, it tends to exhibit the following properties\.

###### Theorem 1\(Convergence to Simplex ETF\[[76](https://arxiv.org/html/2608.19890#bib.bib5)\]\)

For a sufficiently large neural network, the class\-means of the embeddings centered at the global mean become both linearly separable and maximally distant when the model converges\. These class\-means lie on a sphere centered at the origin, forming a Simplex ETF:

⟨𝐜i−𝐜G,𝐜j−𝐜G⟩‖𝐜i−𝐜G‖2​‖𝐜j−𝐜G‖2=\{1,i=j−1K−1,i≠j,,\\frac\{\\langle\\mathbf\{c\}\_\{i\}\-\\mathbf\{c\}\_\{G\},\\mathbf\{c\}\_\{j\}\-\\mathbf\{c\}\_\{G\}\\rangle\}\{\\\|\\mathbf\{c\}\_\{i\}\-\\mathbf\{c\}\_\{G\}\\\|\_\{2\}\\\|\\mathbf\{c\}\_\{j\}\-\\mathbf\{c\}\_\{G\}\\\|\_\{2\}\}\{=\}\\begin\{cases\}1,&i=j\\\\ \-\\frac\{1\}\{K\-1\},&i\\neq j,\\end\{cases\},‖𝐜i−𝐜G‖2−‖𝐜j−𝐜G‖2=0,∀1≤i,j≤K,\\\|\\mathbf\{c\}\_\{i\}\-\\mathbf\{c\}\_\{G\}\\\|\_\{2\}\-\\\|\\mathbf\{c\}\_\{j\}\-\\mathbf\{c\}\_\{G\}\\\|\_\{2\}\{=\}0,\\quad\\forall 1\\leq i,j\\leq K,where𝐜j=∑i=1N𝐳i​𝕀​\(Ψ⁡\(𝐳i\)=j\)∑i=1N𝕀⁡\(Ψ⁡\(𝐳i\)=j\)\\mathbf\{c\}\_\{j\}=\\frac\{\\sum\_\{i=1\}^\{N\}\\mathbf\{z\}\_\{i\}\\mathbb\{I\}\(\{\\Psi\}\(\\mathbf\{z\}\_\{i\}\)=j\)\}\{\\sum\_\{i=1\}^\{N\}\\mathbb\{I\}\(\{\\Psi\}\(\\mathbf\{z\}\_\{i\}\)=j\)\}is the class\-mean ofjj\-th class and𝐜G=1N​∑i=1N𝐳i\\mathbf\{c\}\_\{G\}=\\frac\{1\}\{N\}\\sum\_\{i=1\}^\{N\}\\mathbf\{z\}\_\{i\}is the global mean of feature, both are computed under the neural collapse state\.

###### Theorem 2\(Convergence to Self\-duality\[[76](https://arxiv.org/html/2608.19890#bib.bib5)\]\)

For a sufficiently large neural network, the last\-layer linear classifiers reside in the dual vector space of the class\-means when the model has converged:

𝒩​C3:=‖𝐖​𝐂¯‖𝐖​𝐂¯‖F−1K−1​\(𝐈K−1K​𝟏K​𝟏K⊤\)‖F,\\mathcal\{N\}C\_\{3\}:=\\left\\\|\\frac\{\\mathbf\{W\}\\overline\{\\mathbf\{C\}\}\}\{\\left\\\|\\mathbf\{W\}\\overline\{\\mathbf\{C\}\}\\right\\\|\_\{F\}\}\-\\frac\{1\}\{\\sqrt\{K\-1\}\}\\left\(\\mathbf\{I\}\_\{K\}\-\\frac\{1\}\{K\}\\mathbf\{\\mathbf\{1\}\}\_\{K\}\\mathbf\{\\mathbf\{1\}\}\_\{K\}^\{\\top\}\\right\)\\right\\\|\_\{F\},\(5\)where𝐂¯=\[𝐜1−𝐜G,…,𝐜K−𝐜G\]\\overline\{\\mathbf\{C\}\}=\[\\mathbf\{c\}\_\{1\}\-\\mathbf\{c\}\_\{G\},\\dots,\\mathbf\{c\}\_\{K\}\-\\mathbf\{c\}\_\{G\}\]represents the centered class\-mean matrix\.

###### Theorem 3\(Variability Collapse\[[76](https://arxiv.org/html/2608.19890#bib.bib5)\]\)

As training progresses, the features within each class converge to their respective class\-means, causing within\-class variation to collapse to zero\. Let the within\-class covariance matrix be denoted asΣ𝐖∈ℝd×d\\Sigma\_\{\\mathbf\{W\}\}\\in\\mathbb\{R\}^\{d\\times d\}and the between\-class covariance matrix asΣ𝐁∈ℝd×d\\Sigma\_\{\\mathbf\{B\}\}\\in\\mathbb\{R\}^\{d\\times d\}, defined as follows:

Σ𝐖:=1N​K​∑i=1N∑j=1K𝐝i​j​𝐝i​jT,\\displaystyle\\Sigma\_\{\\mathbf\{W\}\}:=\\frac\{1\}\{NK\}\\sum\_\{i=1\}^\{N\}\\sum\_\{j=1\}^\{K\}\\mathbf\{d\}\_\{ij\}\\mathbf\{d\}\_\{ij\}^\{T\},Σ𝐁:=1K​∑j=1K\(𝐜j−𝐜G\)​\(𝐜j−𝐜G\)T,\\displaystyle\\Sigma\_\{\\mathbf\{B\}\}:=\\frac\{1\}\{K\}\\sum\_\{j=1\}^\{K\}\\left\(\\mathbf\{c\}\_\{j\}\-\\mathbf\{c\}\_\{G\}\\right\)\\left\(\\mathbf\{c\}\_\{j\}\-\\mathbf\{c\}\_\{G\}\\right\)^\{T\},where𝐝i​j=𝕀⁡\(Ψ⁡\(𝐳i\)=j\)⋅\(𝐳i−𝐜j\)\\mathbf\{d\}\_\{ij\}=\\mathbb\{I\}\(\{\\Psi\}\(\\mathbf\{z\}\_\{i\}\)=j\)\\cdot\(\\mathbf\{z\}\_\{i\}\-\\mathbf\{c\}\_\{j\}\)is the distance between theii\-th feature and its class\-mean\. Then, we can measure the extent of within\-class variability collapse by analyzing the relative magnitudes ofΣ𝐁\\Sigma\_\{\\mathbf\{B\}\}andΣ𝐖\\Sigma\_\{\\mathbf\{W\}\}for the learned features:

𝒩​𝒞1:=Σ𝐁†​Σ𝐖→0,\\mathcal\{NC\}\_\{1\}:=\\Sigma^\{\\dagger\}\_\{\\mathbf\{B\}\}\\Sigma\_\{\\mathbf\{W\}\}\\to 0,\(6\)where†\\daggerdenotes the pseudo\-inverse\.

These theorems indicate that, at convergence, both the class means and classifier weights tend to align with a Simplex ETF structure, as depicted in Figure[5](https://arxiv.org/html/2608.19890#S3.F5)\. Since OWTTA starts from a pre\-trained source model, we assume that the source model has been sufficiently trained and thus approximately satisfies this neural collapse property\. See Table[7](https://arxiv.org/html/2608.19890#S4.T7)for empirical verification\.

###### Assumption 1

The pre\-trained model can be considered well\-trained on the source domain, with its classifier weights collapsing into a Simplex ETF\.

###### Assumption 2

LetF⁡\(𝛉∗,⋅\)=σ⁡\(𝐰∗​f​\(𝛉∗,⋅\)\+𝐛∗\)F\(\\bm\{\\theta\}^\{\*\},\\cdot\)=\\sigma\\bigl\(\\mathbf\{w\}^\{\*\}f\(\\bm\{\\theta\}^\{\*\},\\cdot\)\+\\mathbf\{b\}^\{\*\}\\bigr\)be a classification network that has reached the neural collapse state, where𝐰∗\\mathbf\{w\}^\{\*\}and𝐛∗\\mathbf\{b\}^\{\*\}are its classifier weights and bias, respectively\. Let𝐳=f⁡\(𝛉∗,𝐱\)\\mathbf\{z\}=f\(\\bm\{\\theta\}^\{\*\},\\mathbf\{x\}\)denote the feature representations of the training set𝒮S∈\{\(𝐱i,yi\)\|𝐱i∈𝒟S\}\\mathcal\{S\}\_\{S\}\\in\\\{\(\\mathbf\{x\}\_\{i\},y\_\{i\}\)\|\\mathbf\{x\}\_\{i\}\\in\\mathcal\{D\}\_\{S\}\\\}\. Then, for some sufficiently small positive realϵ\\epsilon, it holds that

‖𝐛j∗‖⟨𝐰∗:,j,𝐳Ψ⁡\(𝐳\)=j⟩<ϵ,∀j\.\\frac\{\\\|\\mathbf\{b\}\_\{j\}^\{\*\}\\\|\}\{\\langle\\mathbf\{w\}^\{\*\}\_\{:,j\},\\mathbf\{z\}\_\{\\Psi\(\{\\mathbf\{z\}\)=j\}\}\\rangle\}<\\epsilon,\\quad\\forall j\.\(7\)

Under Assumption[2](https://arxiv.org/html/2608.19890#Thmassumption2), the optimal bias𝐛∗\\mathbf\{b\}^\{\*\}is negligible in the neural collapse state\. See Table[4\.5](https://arxiv.org/html/2608.19890#S4.SS5)for empirical verification\. Accordingly, the bias term can be omitted, and the optimization problemmax𝐰:,j,𝐛j⟨𝐰:,j,𝐳Ψ⁡\(𝐳\)=j⟩\+𝐛j\\underset\{\\mathbf\{w\}\_\{:,j\},\\mathbf\{b\}\_\{j\}\}\{\\max\}\\,\\langle\\mathbf\{w\}\_\{:,j\},\\mathbf\{z\}\_\{\\Psi\(\\mathbf\{z\}\)=j\}\\rangle\+\\mathbf\{b\}\_\{j\}reduces tomax𝐰:,j⟨𝐰:,j,𝐳Ψ⁡\(𝐳\)=j⟩\\underset\{\\mathbf\{w\}\_\{:,j\}\}\{\\max\}\\,\\langle\\mathbf\{w\}\_\{:,j\},\\mathbf\{z\}\_\{\\Psi\(\\mathbf\{z\}\)=j\}\\rangle\. This indicates that the classifier weight of each class is optimized toward the same direction as its corresponding class prototype\. We formalize this relation in the following lemma\.

###### Lemma 1

LetF⁡\(𝛉∗,⋅\)=σ⁡\(𝐰∗​f​\(𝛉∗,⋅\)\+𝐛∗\)F\(\\bm\{\\theta\}^\{\*\},\\cdot\)=\\sigma\\bigl\(\\mathbf\{w\}^\{\*\}f\(\\bm\{\\theta\}^\{\*\},\\cdot\)\+\\mathbf\{b\}^\{\*\}\\bigr\)be a sufficiently trained classification network that approximately satisfies the neural collapse property\. Letf⁡\(𝛉∗,𝐱\)f\(\\bm\{\\theta\}^\{\*\},\\mathbf\{x\}\)denote the feature representation of a source training sample𝐱\\mathbf\{x\}from𝒮S=\{\(𝐱i,yi\)∣𝐱i∈𝒟S\}\\mathcal\{S\}\_\{S\}=\\\{\(\\mathbf\{x\}\_\{i\},y\_\{i\}\)\\mid\\mathbf\{x\}\_\{i\}\\in\\mathcal\{D\}\_\{S\}\\\}\. Let𝐜j\\mathbf\{c\}\_\{j\}be the prototype of thejj\-th class\. Then we have:

𝐜j‖𝐜j‖=𝐰∗:,j∥𝐰∗:,j∥,∀j\.\\frac\{\\mathbf\{c\}\_\{j\}\}\{\\\|\\mathbf\{c\}\_\{j\}\\\|\}=\\frac\{\\mathbf\{w\}^\{\*\}\_\{:,j\}\}\{\\\|\\mathbf\{w\}^\{\*\}\_\{:,j\}\\\|\},\\quad\\forall j\.\(8\)

Following Lemma[1](https://arxiv.org/html/2608.19890#Thmlemma1), we use the normalized classifier weights as class prototypes under the source\-free setting\. Therefore, Eq\. \([3](https://arxiv.org/html/2608.19890#S3.E3)\) can be computed at each batch step without accessing source data, enabling reliable updates with selected target samples\.

### 3\.3Neural Collapse Approximation

We further consider the effect of data distribution shifts\. The neural collapse structure learned by the source model reflects the source\-domain feature geometry, but may become misaligned with target\-domain representations due to the data distribution shifts\. From the neural collapse perspective, this feature\-prototype misalignment between shifted target representations and source\-domain prototypes becomes a key reason for performance degradation\.

###### Proposition 1

Given a source domain training set𝒮S∈\{\(𝐱i,yi\)\|𝐱i∈𝒟S\}\\mathcal\{S\}\_\{S\}\\in\\\{\(\\mathbf\{x\}\_\{i\},y\_\{i\}\)\|\\mathbf\{x\}\_\{i\}\\in\\mathcal\{D\}\_\{S\}\\\}and a target domain test set𝒮T∈\{𝐱i\|𝐱i∈𝒟T\}\\mathcal\{S\}\_\{T\}\\in\\\{\\mathbf\{x\}\_\{i\}\|\\mathbf\{x\}\_\{i\}\\in\\mathcal\{D\}\_\{T\}\\\}\. Under the neural collapse state, let𝐜S∗\\mathbf\{c\}^\{\*\}\_\{S\}and𝐜T∗\\mathbf\{c\}^\{\*\}\_\{T\}denote the prototypes of source and target domains, respectively, each forming a Simplex ETF:

𝐜S∗𝐜S∗⁣⊤=α\(𝐈K−1K1K𝟏K⊤\),𝐜T∗𝐜T∗⁣⊤=β\(𝐈K−1K1K𝟏K⊤\),\\displaystyle\\mathbf\{c\}\_\{S\}^\{\*\}\\,\\mathbf\{c\}\_\{S\}^\{\*\\top\}=\\alpha\\Bigl\(\\mathbf\{I\}\_\{K\}\-\\tfrac\{1\}\{K\}\\,\\mathbf\{1\}\_\{K\}\\mathbf\{1\}\_\{K\}^\{\\top\}\\Bigr\),\\mathbf\{c\}\_\{T\}^\{\*\}\\,\\mathbf\{c\}\_\{T\}^\{\*\\top\}=\\beta\\Bigl\(\\mathbf\{I\}\_\{K\}\-\\tfrac\{1\}\{K\}\\,\\mathbf\{1\}\_\{K\}\\mathbf\{1\}\_\{K\}^\{\\top\}\\Bigr\),whereα\\alphaandβ\\betadenote the respective scaling factors for the source and target Simplex ETFs\.

By Proposition[1](https://arxiv.org/html/2608.19890#ThmmyProp1), if𝒟S≠𝒟T\\mathcal\{D\}\_\{S\}\\neq\\mathcal\{D\}\_\{T\}, then𝐜S∗≠𝐜T∗\\mathbf\{c\}^\{\*\}\_\{S\}\\neq\\mathbf\{c\}^\{\*\}\_\{T\}, i\.e\., the source and target prototypes differ due to the data distribution shift, which leads to classification errors\. Based on this understanding, we aim to guide target representations toward a target\-domain NC\-inspired geometry during adaptation\.

###### Lemma 2

LetF⁡\(𝛉∗,⋅\)=σ⁡\(𝐰∗​f​\(𝛉∗,⋅\)\+𝐛∗\)F\(\\bm\{\\theta\}^\{\*\},\\cdot\)=\\sigma\\bigl\(\\mathbf\{w\}^\{\*\}f\(\\bm\{\\theta\}^\{\*\},\\cdot\)\+\\mathbf\{b\}^\{\*\}\\bigr\)be a classification network that has reached the neural collapse state with the training set𝒮S∈\{\(𝐱i,yi\)\|𝐱i∈𝒟S\}\\mathcal\{S\}\_\{S\}\\in\\\{\(\\mathbf\{x\}\_\{i\},y\_\{i\}\)\|\\mathbf\{x\}\_\{i\}\\in\\mathcal\{D\}\_\{S\}\\\}\. Then, for each training sample𝐱i\\mathbf\{x\}\_\{i\}, its logits vector𝐩=F⁡\(𝛉∗,𝐱i\)\\mathbf\{p\}=F\(\\bm\{\\theta\}^\{\*\},\\mathbf\{x\}\_\{i\}\)is a one\-hot vector, i\.e\.,

𝐩j=\{1,Ψ⁡\(𝐱i\)=j,0,otherwise\.\\mathbf\{\{p\}\}\_\{j\}=\\begin\{cases\}1,&\\Psi\(\\mathbf\{x\}\_\{i\}\)=j,\\\\ 0,&\\text\{otherwise\}\.\\end\{cases\}

As stated in Lemma[2](https://arxiv.org/html/2608.19890#Thmlemma2), the logits of a classification network tend to degenerate into one\-hot vectors under the neural collapse state\. The entropy loss in Eq\. \([4](https://arxiv.org/html/2608.19890#S3.E4)\) encourages confident predictions, which implicitly pushes each sample toward its corresponding class mean and promotes a more compact target\-domain representation\. This connection to neural collapse explains why entropy minimization can improve adaptation effectiveness in TTA\.

However, as indicated by Proposition[1](https://arxiv.org/html/2608.19890#ThmmyProp1), distribution shifts may alter the target\-domain feature geometry, making direct entropy minimization in Eq\. \([4](https://arxiv.org/html/2608.19890#S3.E4)\) blindly push target features toward source\-domain prototypes\. Such indiscriminate updates may distort the embedding space and damage the structured representations required for reliable adaptation\.

We therefore seek to approximate the neural collapse state in the target domain\. Since exact neural collapse is difficult to achieve in the unsupervised setting, we use it as a reliable structural prior for target adaptation\. Specifically, we jointly update the model parameters and prototypes, and further leverage embedding\-structure maintenance and stochastic prototype updates to promote balanced and compact representations during adaptation\.

#### 3\.3\.1Maintain Embedding Structure

According to neural collapse theory, learned class representations tend to form a balanced geometric structure, i\.e\., a Simplex ETF, at convergence\. We regard this property as a structural prior and preserve the balanced latent embedding geometry during target adaptation\. Let𝐰∗\\mathbf\{w\}^\{\*\}denote the classifier weights, and let𝐳Ψ⁡\(𝐳\)=j\\mathbf\{z\}\_\{\\Psi\(\\mathbf\{z\}\)=j\}denote the feature representations assigned to thejj\-th class\. Then we have:

𝐩^∗\\displaystyle\\hat\{\\mathbf\{p\}\}^\{\*\}=1K​∑j=1Kσ⁡\(⟨𝐰∗,𝐳Ψ⁡\(𝐳\)=j⟩\)=1K​∑j=1Kσ⁡\(⟨𝐰∗,𝐜j⟩\)\\displaystyle=\\frac\{1\}\{K\}\\sum\_\{j=1\}^\{K\}\\sigma\(\\langle\\mathbf\{w\}^\{\*\},\\mathbf\{z\}\_\{\\Psi\(\\mathbf\{z\}\)=j\}\\rangle\)=\\frac\{1\}\{K\}\\sum\_\{j=1\}^\{K\}\\sigma\(\\langle\\mathbf\{w\}^\{\*\},\\mathbf\{c\}\_\{j\}\\rangle\)=1K​∑j=1Kσ⁡\(\[−1K−1,−1K−1,…,1,…,−1K−1\]\)\\displaystyle=\\frac\{1\}\{K\}\\sum\_\{j=1\}^\{K\}\\sigma\(\[\-\\frac\{1\}\{K\-1\},\-\\frac\{1\}\{K\-1\},\\dots,1,\\dots,\-\\frac\{1\}\{K\-1\}\]\)=1K​𝟏K,\\displaystyle=\\frac\{1\}\{K\}\\mathbf\{1\}\_\{K\},where𝐩^∗\\hat\{\\mathbf\{p\}\}^\{\*\}denotes the ideal class\-averaged prediction under neural collapse, corresponding to a uniform distribution over classes\.

Guided by this uniform prior, we encourage the average logits of ID samples to approach1K​𝟏K\\frac\{1\}\{K\}\\mathbf\{1\}\_\{K\}, thereby maintaining a balanced embedding structure during adaptation:

ℒd\(𝜽\)=DK​L\(𝐩^t∥1K𝟏K\),\\mathcal\{L\}\_\{d\}\\left\(\\bm\{\\theta\}\\right\)=D\_\{KL\}\\left\(\{\\hat\{\\mathbf\{p\}\}\}^\{t\}\\Big\\\|\\frac\{1\}\{K\}\\mathbf\{1\}\_\{K\}\\right\),\(9\)where𝐩^t=1N\+​∑i=1N\+𝐩it\\hat\{\\mathbf\{p\}\}^\{t\}=\\frac\{1\}\{N\_\{\+\}\}\\sum\_\{i=1\}^\{N^\{\+\}\}\\mathbf\{p\}\_\{i\}^\{t\}is the average of logits oftt\-th batch,DK​LD\_\{KL\}is the KL\-divergence,𝐩t\{\\mathbf\{p\}\}^\{t\}is the output of ID samples\. Eq\. \([9](https://arxiv.org/html/2608.19890#S3.E9)\) regularizes the adaptation by encouraging balanced class\-wise predictions, which facilitates the preservation of the neural collapse\-inspired embedding structure\.

#### 3\.3\.2Stochastic Prototype Update

As stated in Proposition[1](https://arxiv.org/html/2608.19890#ThmmyProp1), source\-domain and target\-domain prototypes may differ under distribution shifts\. Therefore, we further investigate how to update prototypes during adaptation\. In OWTTA, target samples arrive in a single\-pass stream, and each mini\-batch usually covers only a subset of classes\. This naturally introduces a class\-coverage imbalance during prototype updates\. For example, when the number of classes is much larger than the batch size, many classes are absent from the current batch\. Updating prototypes only with the current batch may therefore produce biased estimates of the target distribution, hindering reliable adaptation and degrading OWTTA performance\.

To address this issue, we propose a stochastic prototype update mechanism that selectively updates only the prototypes corresponding to classes present in the current batch, while keeping others fixed\. This strategy ensures that updates are more relevant to the incoming data and improves adaptation efficiency\. To facilitate this, the objective function is extended as follows:

ℒ⁡\(𝜽,𝐂\)=\\displaystyle\\mathcal\{L\}\\left\(\\bm\{\\theta\},\\mathbf\{C\}\\right\)=ℒe\+​\(𝜽,𝐂\)\+λ​ℒd​\(𝜽\)\+ℒs​\(𝜽,𝐂\)\\displaystyle\\mathcal\{L\}\_\{e\}^\{\+\}\\left\(\\bm\{\\theta\},\\mathbf\{C\}\\right\)\+\\lambda\\mathcal\{L\}\_\{d\}\\left\(\\bm\{\\theta\}\\right\)\+\\mathcal\{L\}\_\{s\}\\left\(\\bm\{\\theta\},\\mathbf\{C\}\\right\)\(10\)=\\displaystyle=1N\+∑i=1N\+H\(𝐩it\)\+λDK​L\(𝐩t∥1K𝟏K\)\\displaystyle\\frac\{1\}\{N^\{\+\}\}\\sum\_\{i=1\}^\{N^\{\+\}\}H\\left\(\\mathbf\{p\}\_\{i\}^\{t\}\\right\)\{\+\\lambda D\_\{KL\}\\left\(\{\\mathbf\{p\}\}^\{t\}\\Big\\\|\\frac\{1\}\{K\}\\mathbf\{1\}\_\{K\}\\right\)\}\+1N\+∑i=1N\+∑j=1Kξi​jt‖𝐳it−𝐜jt‖22,\\displaystyle\+\\frac\{1\}\{N^\{\+\}\}\\sum\_\{i=1\}^\{N^\{\+\}\}\\sum\_\{j=1\}^\{K\}\\xi\_\{ij\}^\{t\}\\left\\\|\\mathbf\{z\}\_\{i\}^\{t\}\-\\mathbf\{c\}\_\{j\}^\{t\}\\right\\\|\_\{2\}^\{2\},whereλ\\lambdais the trade\-off parameter andξ∈\{0,1\}\\xi\\in\\left\\\{0,1\\right\\\}is an indicator factor assigning𝐳it\\mathbf\{z\}^\{t\}\_\{i\}into its nearest prototype:

ξi​jt\\displaystyle\\xi\_\{ij\}^\{t\}=\{1,if​j=arg⁡max𝑗​exp⁡\(−‖𝐳it−𝐜jt−1‖22\)∑jKexp⁡\(−‖𝐳it−𝐜jt−1‖22\),0,otherwise\.\\displaystyle=\\begin\{cases\}1,&\\text\{if \}j=\{\\underset\{j\}\{\\arg\\max\}~\\frac\{\\exp\\left\(\{\-\\left\\\|\\mathbf\{z\}\_\{i\}^\{t\}\-\\mathbf\{c\}^\{t\-1\}\_\{j\}\\right\\\|\_\{2\}^\{2\}\}\\right\)\}\{\\sum\_\{j\}^\{K\}\\exp\\left\(\-\\left\\\|\\mathbf\{z\}\_\{i\}^\{t\}\-\\mathbf\{c\}^\{t\-1\}\_\{j\}\\right\\\|\_\{2\}^\{2\}\\right\)\}\},\\\\ 0,&\\text\{otherwise\}\.\\end\{cases\}\(11\)
The first term of Eq\. \([10](https://arxiv.org/html/2608.19890#S3.E10)\) is guided by the compactness prior in Theorem[6](https://arxiv.org/html/2608.19890#S3.E6), encouraging each sample to move closer to its corresponding prototype\. The second term is inspired by the simplex\-ETF geometry in Theorem[1](https://arxiv.org/html/2608.19890#S3.Ex6), encouraging a well\-structured inter\-class embedding space\. The third term alleviates the prototype mismatch described in Proposition[1](https://arxiv.org/html/2608.19890#ThmmyProp1)by progressively adapting the prototypes toward the target\-domain feature distribution\. These three terms jointly incorporate the neural collapse prior into unsupervised target adaptation, enabling the model to form a compact and balanced target\-domain representation without requiring label supervision\.

#### 3\.3\.3Alternating Optimization

Unlike the network parameters𝜽\\bm\{\\theta\}, prototypes𝐂\\mathbf\{C\}can be unstable when directly updated by stochastic gradients\. This instability occurs because the prototypes estimated from different mini\-batches can vary significantly\. To achieve the stochastic prototype update, we propose a decomposition\-coordination optimization approach based on the Alternating Direction Method of Multipliers \(ADMM\) to optimize Eq\. \([10](https://arxiv.org/html/2608.19890#S3.E10)\)\. In particular, we employ an auxiliary variable𝝁\\bm\{\\mu\}to alternately update the model parameters and prototypes:

ℒ⁡\(𝜽,𝝁,𝐂\)=\\displaystyle\\mathcal\{L\}\\left\(\\bm\{\\theta\},\\bm\{\\mu\},\\mathbf\{C\}\\right\)=ℒe\+​\(𝜽,𝝁\)\+λ​ℒd​\(𝜽\)\+ℒs​\(𝜽,𝝁\)\\displaystyle\\mathcal\{L\}\_\{e\}^\{\+\}\\left\(\\bm\{\\theta\},\\bm\{\\mu\}\\right\)\+\\lambda\\mathcal\{L\}\_\{d\}\\left\(\\bm\{\\theta\}\\right\)\+\\mathcal\{L\}\_\{s\}\\left\(\\bm\{\\theta\},\\bm\{\\mu\}\\right\)\+ρ∑j=1K‖𝝁j−𝐜j‖22,\\displaystyle\+\\rho\\sum\_\{j=1\}^\{K\}\\left\\\|\\bm\{\\mu\}\_\{j\}\-\\mathbf\{c\}\_\{j\}\\right\\\|\_\{2\}^\{2\},whereρ\\rhois a trade\-off parameter controlling the prototype updates between batches\. Our decomposition\-coordination optimization technique consists of three iterative steps:

𝜽t=arg⁡min𝜽​ℒ​\(𝜽,𝝁t−1,𝐂t−1\),\\displaystyle\\bm\{\\theta\}^\{t\}=\\underset\{\\bm\{\\theta\}\}\{\\arg\\min\}~\\mathcal\{L\}\\left\(\\bm\{\\theta\},\\bm\{\\mu\}^\{t\-1\},\\mathbf\{C\}^\{t\-1\}\\right\),𝝁t=arg⁡min𝝁​ℒ​\(𝜽t,𝝁,𝐂t−1\),\\displaystyle\\bm\{\\mu\}^\{t\}=\\underset\{\\bm\{\\mu\}\}\{\\arg\\min\}~\\mathcal\{L\}\\left\(\\bm\{\\theta\}^\{t\},\\bm\{\\mu\},\\mathbf\{C\}^\{t\-1\}\\right\),𝐂t=arg⁡min𝐂​ℒ​\(𝜽t,𝝁t,𝐂\)\.\\displaystyle\\mathbf\{C\}^\{t\}=\\underset\{\\mathbf\{C\}\}\{\\arg\\min\}~\\mathcal\{L\}\\left\(\\bm\{\\theta\}^\{t\},\\bm\{\\mu\}^\{t\},\\mathbf\{C\}\\right\)\.
We then develop efficient update solutions for each sub\-problem, allowing for neural collapse approximation\.

For updatingθ\\bm\{\\theta\}:Since no closed\-form solution exists, we optimize𝜽t\\bm\{\\theta\}^\{t\}using gradient descent:

𝜽t=𝜽t−1−ϵ​∂ℒ⁡\(𝜽,𝝁t−1,𝐂t−1\)∂𝜽\|𝜽=𝜽t−1,\\bm\{\\theta\}^\{t\}=\\bm\{\\theta\}^\{t\-1\}\-\\epsilon\\left\.\\frac\{\\partial\\mathcal\{L\}\\left\(\\bm\{\\theta\},\\bm\{\\mu\}^\{t\-1\},\\mathbf\{C\}^\{t\-1\}\\right\)\}\{\\partial\\bm\{\\theta\}\}\\right\|\_\{\\bm\{\\theta\}=\\bm\{\\theta\}^\{t\-1\}\},\(12\)whereϵ\\epsilonis the step size\. Eq\. \([12](https://arxiv.org/html/2608.19890#S3.E12)\) can be executed using advanced gradient descent methods\.

For updatingμ\\bm\{\\mu\}:The sub\-problem involves a two\-objective optimization\. By setting the gradient of the objective function to zero, we can obtain an analytic solution:

∂ℒ⁡\(𝜽t,𝝁,𝐂t−1\)∂𝝁j=0⟹𝝁jt=ρ​𝐜jt−1\+ηN\+​∑i=1N\+ξi​jt​𝐳itρ\+ηN\+​∑i=1N\+ξi​jt,\\frac\{\\partial\\mathcal\{L\}\\left\(\\bm\{\\theta\}^\{t\},\\bm\{\\mu\},\\mathbf\{C\}^\{t\-1\}\\right\)\}\{\\partial\\bm\{\\mu\}\_\{j\}\}=0\\implies\\bm\{\\mu\}\_\{j\}^\{t\}=\\frac\{\\rho\\mathbf\{c\}\_\{j\}^\{t\-1\}\+\\frac\{\\eta\}\{N^\{\+\}\}\\sum\_\{i=1\}^\{N^\{\+\}\}\\xi\_\{ij\}^\{t\}\\mathbf\{z\}\_\{i\}^\{t\}\}\{\\rho\+\\frac\{\\eta\}\{N^\{\+\}\}\\sum\_\{i=1\}^\{N^\{\+\}\}\\xi\_\{ij\}^\{t\}\},\(13\)whereη\\etais a balance factor\. The numerator of Eq\. \([13](https://arxiv.org/html/2608.19890#S3.E13)\) controls the sample weights of each prototype, while the denominator represents the sample counts assigned to the class\. Letκ=ρρ\+ηN\+​∑i=1N\+ξi​jt\\kappa=\\frac\{\\rho\}\{\\rho\+\\frac\{\\eta\}\{N^\{\+\}\}\\sum\_\{i=1\}^\{N^\{\+\}\}\\xi\_\{ij\}^\{t\}\}and𝐜¯jt=∑i=1N\+ξi​jt​𝐳it∑i=1N\+ξi​jt\\bar\{\\mathbf\{c\}\}\_\{j\}^\{t\}=\\frac\{\\sum\_\{i=1\}^\{N^\{\+\}\}\\xi\_\{ij\}^\{t\}\\mathbf\{z\}\_\{i\}^\{t\}\}\{\\sum\_\{i=1\}^\{N^\{\+\}\}\\xi\_\{ij\}^\{t\}\}\. Eq\. \([13](https://arxiv.org/html/2608.19890#S3.E13)\) can further simplified to the following form:

𝝁jt=κ𝐜jt−1\+\(1−κ\)𝐜¯jt,j=1,2,…,K,\\bm\{\\mu\}\_\{j\}^\{t\}=\\kappa\\mathbf\{c\}\_\{j\}^\{t\-1\}\+\(1\-\\kappa\)\\bar\{\\mathbf\{c\}\}\_\{j\}^\{t\},\\quad j=1,2,\\ldots,K,\(14\)whereκ\\kappaacts as a self\-learning parameter that balances the influence between the previous prototype𝐜jt−1\\mathbf\{c\}\_\{j\}^\{t\-1\}and the prototype calculated in the current batch,𝐜¯jt\\bar\{\\mathbf\{c\}\}\_\{j\}^\{t\}\. It is noteworthy that in Eq\. \([14](https://arxiv.org/html/2608.19890#S3.E14)\),𝐜¯jt\\bar\{\\mathbf\{c\}\}\_\{j\}^\{t\}is calculated based not only on the features assigned to the class but also on the number of samples allocated to it\. In fact, Eq\. \([14](https://arxiv.org/html/2608.19890#S3.E14)\) corresponds to the exponential moving average \(EMA\), which has been demonstrated that the use of it ensures both stability and efficiency in scenarios of mini\-batch updates\[[69](https://arxiv.org/html/2608.19890#bib.bib15)\]\.

For updating𝐂\\mathbf\{C\}:By setting the gradient of the objective function to zero, the analytic solution of𝐂\\mathbf\{C\}is:

∂ℒ⁡\(𝜽t,𝝁t,𝐂\)∂𝐜j=0⟹𝐜jt=𝝁jt,j=1,2,…,K\.\\frac\{\\partial\\mathcal\{L\}\(\\bm\{\\theta\}^\{t\},\\bm\{\\mu\}^\{t\},\\mathbf\{C\}\)\}\{\\partial\\mathbf\{c\}\_\{j\}\}=0\\implies\\mathbf\{c\}\_\{j\}^\{t\}=\\bm\{\\mu\}\_\{j\}^\{t\},\\quad j=1,2,\\ldots,K\.\(15\)
To summarize, our ReNC method filters out the OOD samples at first and approximates the neural collapse state in the target domain by updating prototypes stochastically to achieve reliable and efficient OWTTA\. Finally, the predictionsy^it\\hat\{y\}\_\{i\}^\{t\}for each batch can be obtained by:

y^it=\{F⁡\(𝜽t,𝐱it\),sit<τt∗,\|𝒴S\|\+1,otherwise\.\\displaystyle\\hat\{y\}\_\{i\}^\{t\}=\\begin\{cases\}F\(\\bm\{\\theta\}^\{t\},\\mathbf\{x\}\_\{i\}^\{t\}\),&s\_\{i\}^\{t\}<\\tau\_\{t\}^\{\*\},\\\\ \|\\mathcal\{Y\}\_\{S\}\|\+1,&\{\\text\{otherwise\}\}\.\\end\{cases\}\(16\)
A detailed overview of the proposed method is provided in Algorithm[1](https://arxiv.org/html/2608.19890#alg1)\.

Algorithm 1Reliable Neural Collapse approximation \(ReNC\)1:Test samples

𝐱\\mathbf\{x\}from the target domain

𝒮T\\mathcal\{S\}\_\{T\}, pre\-trained model

F⁡\(𝜽,⋅\)F\(\\bm\{\\theta\},\\cdot\);

2:\#Initialize prototypes

3:Initialization:Extract prototypes

𝐂\\mathbf\{C\}from classifier weights

𝐰\\mathbf\{w\}and initialize

𝝁=𝐂\\bm\{\\mu\}=\\mathbf\{C\};

4:for

t←1t\\leftarrow 1to

TTdo

5:\#Partition data into ID \(N\+N^\{\+\}\) and OOD \(N−N^\{\-\}\) samples

6:Calculate

sits\_\{i\}^\{t\}and

τt∗\\tau\_\{t\}^\{\*\}by Eq\. \([2](https://arxiv.org/html/2608.19890#S3.E2)\) and Eq\. \([3](https://arxiv.org/html/2608.19890#S3.E3)\);

7:\#Neural collapse approximation

8:Update

𝜽t\\bm\{\\theta\}^\{t\}by Eq\. \([12](https://arxiv.org/html/2608.19890#S3.E12)\), update

𝝁t\\bm\{\\mu\}^\{t\}by Eq\. \([13](https://arxiv.org/html/2608.19890#S3.E13)\), update

𝐜t\\mathbf\{c\}^\{t\}by Eq\. \([15](https://arxiv.org/html/2608.19890#S3.E15)\);

9:\#Inference

10:Obtain

y^it\\hat\{y\}\_\{i\}^\{t\}by Eq\. \([16](https://arxiv.org/html/2608.19890#S3.E16)\)\.

11:endfor

## 4Experiments

In this section, we empirically validate the proposed ReNC on several open\-world benchmarks\. We begin by describing the datasets, evaluation metrics, baselines\.Next, we conduct extensive experiments on five open\-world benchmarks to demonstrate the effectiveness of our ReNC\. Additionally, we validate Assumption[1](https://arxiv.org/html/2608.19890#Thmassumption1)and Assumption[2](https://arxiv.org/html/2608.19890#Thmassumption2), and further discuss the connection between TTA and neural collapse\. Finally, we conduct comprehensive analyses, including ablation studies, computational cost analysis, parameter sensitivity analysis, different ID/OOD ratio settings, continual OWTTA evaluation, ViT\-backbone evaluation, and significance tests, to further assess the robustness and effectiveness of our method\.

Table 1:In\-distribution Datasets Information### 4\.1Open\-world Benchmarks

The open\-world benchmarks employed in our experiments include both In\-Distribution \(ID\) and Out\-Of\-Distribution \(OOD\) samples\. Specifically, the ID samples are drawn from two types of target domains, i\.e\., corruption and style transfer\. For corruption domain,CIFAR10\-C\[[20](https://arxiv.org/html/2608.19890#bib.bib6)\],CIFAR100\-C\[[20](https://arxiv.org/html/2608.19890#bib.bib6)\],ImageNet\-C\[[20](https://arxiv.org/html/2608.19890#bib.bib6)\]are introduced, while for style transfer domain, we haveImageNet\-R\[[19](https://arxiv.org/html/2608.19890#bib.bib8)\]andVisDA\-C\[[49](https://arxiv.org/html/2608.19890#bib.bib7)\]\. Details of the ID samples are presented in Table[1](https://arxiv.org/html/2608.19890#S4.T1)\. Besides, we select Gaussian noise and five real\-world datasets with distributions different from the ID samples to serve as the OOD datasets:Noise, composed with random Gaussian noise,MNIST\[[9](https://arxiv.org/html/2608.19890#bib.bib9)\],SVHN\[[46](https://arxiv.org/html/2608.19890#bib.bib10)\],Tiny\-ImageNet\[[30](https://arxiv.org/html/2608.19890#bib.bib11)\],CIFAR100\-CandCIFAR10\-C\.

We concatenate ID and OOD samples at an OOD sample ratio of\|𝒮TO\|\|𝒮TI\|=1\\frac\{\|\\mathcal\{S\}\_\{T\_\{O\}\}\|\}\{\|\\mathcal\{S\}\_\{T\_\{I\}\}\|\}=1to form the open\-world benchmarks\. Specifically, for CIFAR10\-C and CIFAR100\-C, the OOD samples include Noise, MNIST, Tiny\-ImageNet, and CIFAR100\-C/CIFAR10\-C\. For ImageNet\-C, ImageNet\-R, and VisDA\-C, the OOD samples are Noise, MNIST, and SVHN\.

### 4\.2Evaluation metrics

To evaluate the OWTTA performance, similar to\[[36](https://arxiv.org/html/2608.19890#bib.bib1)\], we introduce three evaluation metrics:

A​C​CI=\\displaystyle ACC\_\{I\}=∑𝐱i∈𝒟TI𝟏​\(y^i=Ψ⁡\(𝐱i\)\)⋅𝟏​\(Ψ⁡\(𝐱i\)∈𝒴s\)∑𝐱i∈𝒟TI𝟏​\(Ψ⁡\(𝐱i\)∈𝒴s\),\\displaystyle\\frac\{\\sum\_\{\\mathbf\{x\}\_\{i\}\\in\\mathcal\{D\}\_\{T\_\{I\}\}\}\\mathbf\{1\}\\left\(\\hat\{y\}\_\{i\}=\\Psi\\left\(\\mathbf\{x\}\_\{i\}\\right\)\\right\)\\cdot\\mathbf\{1\}\(\\Psi\(\\mathbf\{x\}\_\{i\}\)\\in\\mathcal\{Y\}\_\{s\}\)\}\{\\sum\_\{\\mathbf\{x\}\_\{i\}\\in\\mathcal\{D\}\_\{T\_\{I\}\}\}\\mathbf\{1\}\(\\Psi\(\\mathbf\{x\}\_\{i\}\)\\in\\mathcal\{Y\}\_\{s\}\)\},A​C​CO=\\displaystyle ACC\_\{O\}=∑𝐱i∈𝒟TO𝟏​\(y^i∈𝒴O\)⋅𝟏​\(Ψ⁡\(𝐱i\)∈𝒴O\)∑𝐱i∈𝒟TO𝟏​\(Ψ⁡\(𝐱i\)∈𝒴O\),\\displaystyle\\frac\{\\sum\_\{\\mathbf\{x\}\_\{i\}\\in\\mathcal\{D\}\_\{T\_\{O\}\}\}\\mathbf\{1\}\(\\hat\{y\}\_\{i\}\\in\\mathcal\{Y\}\_\{O\}\)\\cdot\\mathbf\{1\}\(\\Psi\(\\mathbf\{x\}\_\{i\}\)\\in\\mathcal\{Y\}\_\{O\}\)\}\{\\sum\_\{\\mathbf\{x\}\_\{i\}\\in\\mathcal\{D\}\_\{T\_\{O\}\}\}\\mathbf\{1\}\(\\Psi\(\\mathbf\{x\}\_\{i\}\)\\in\\mathcal\{Y\}\_\{O\}\)\},A​C​CH=\\displaystyle ACC\_\{H\}=2⋅A​C​CI⋅A​C​COA​C​CI\+A​C​CO,\\displaystyle 2\\cdot\\frac\{ACC\_\{I\}\\cdot ACC\_\{O\}\}\{ACC\_\{I\}\+ACC\_\{O\}\},whereA​C​CIACC\_\{I\}andA​C​COACC\_\{O\}evaluate the classification accuracy of ID and OOD samples, respectively\.A​C​CHACC\_\{H\}is the harmonic mean ofA​C​CIACC\_\{I\}andA​C​COACC\_\{O\}measuring the overall OWTTA performance\.

### 4\.3Baselines

The baselines in our experiments are summarized as follows\.TEST: The classification results are obtained directly from the pre\-trained model without any further adaptation, serving as a baseline for comparison\.BN\[[25](https://arxiv.org/html/2608.19890#bib.bib12)\]: The batch normalization layers of the pre\-trained network are unfrozen, allowing them to adjust their parameters based on the test samples\.TENT\[[65](https://arxiv.org/html/2608.19890#bib.bib14)\]: It introduces two affine parameters to adjust the batch normalization layers of the model and updates these parameters by minimizing the entropy loss of target samples\.SHOT\[[38](https://arxiv.org/html/2608.19890#bib.bib13)\]: It keeps the classifier parameters fixed while using the pre\-trained feature encoder as the initialization for learning in the target domain\.OSTTA\[[31](https://arxiv.org/html/2608.19890#bib.bib58)\]: This method filters out low\-confidence OOD samples and adapts the model by minimizing the entropy of high\-confidence samples\.EATA\[[47](https://arxiv.org/html/2608.19890#bib.bib29)\]: This method actively selects high\-confidence test samples for adaptation while filtering out low\-confidence ones, and mitigates catastrophic forgetting through Fisher regularization\.RMT\[[10](https://arxiv.org/html/2608.19890#bib.bib64)\]: It uses symmetrical cross\-entropy as a consistency loss and leverages contrastive learning for feature alignment, reducing error accumulation in continual and gradual test\-time adaptation\.CoTTA\[[67](https://arxiv.org/html/2608.19890#bib.bib18)\]: This method mitigates error accumulation by generating weight\-averaged and augmentation\-averaged pseudo\-labels and alleviates catastrophic forgetting via stochastic restoration of source pre\-trained weights during continual test\-time adaptation\.UniEnt\[[15](https://arxiv.org/html/2608.19890#bib.bib25)\]: It uses a two\-component GMMs to partition ID and OOD samples based on similarity scores between features and prototypes\. The entropy of ID samples is minimized, while that of OOD samples is maximized for better adaptation\.OWT3\[[36](https://arxiv.org/html/2608.19890#bib.bib1)\]: This method adapts the model to the target domain by aligning it with statistical information from the source domain and generating new prototypes for OOD samples\. However, in OWTTA, since source statistics are unavailable, we replace the prototypes in OWT3 with normalized classifier weights and remove the alignment component of the loss function\.

For the baselines not tailored for OWTTA, we follow the approach in\[[36](https://arxiv.org/html/2608.19890#bib.bib1)\]for comparison\. Specifically, samples from each batch are first partitioned into the ID and OOD samples usingτt∗\\tau^\{\*\}\_\{t\}calculated by Eq\. \([3](https://arxiv.org/html/2608.19890#S3.E3)\), with the prototypes extracted by pre\-trained classifier weights\. Then, these methods are applied to the ID samples for the adaptation\. Following\[[15](https://arxiv.org/html/2608.19890#bib.bib25)\], we report results for OSTTA and UniEnt combined with TENT\. Besides, our evaluation metric differs from those used in OSTTA and UniEnt333We ensure the performance of OSTTA and UniEnt using the original metrics remains consistent to their respective papers\., since we apply the stricter evaluation metrics, identical to those used in OWT3\[[36](https://arxiv.org/html/2608.19890#bib.bib1)\]\.

### 4\.4Overall Comparisons in the OWTTA Scenario

In this section, we validate the effectiveness of the proposed method in the OWTTA scenario\. The performance is evaluated usingA​C​CIACC\_\{I\},A​C​COACC\_\{O\}andA​C​CHACC\_\{H\}\. We compare the proposed method with ten baselines across all the open\-world benchmarks, including both corrupted and style transfer domains with OOD samples\. Tables[2](https://arxiv.org/html/2608.19890#S4.T2),[3](https://arxiv.org/html/2608.19890#S4.T3)and[4](https://arxiv.org/html/2608.19890#S4.T4)present the results for the corrupted domains\. The results for the style transfer domain are shown in Tables[5](https://arxiv.org/html/2608.19890#S4.T5)and[6](https://arxiv.org/html/2608.19890#S4.T6)\. These experimental results reveal several noteworthy observations\.

1\) Our ReNC consistently achieves superiorA​C​CHACC\_\{H\}across all baselines, validating its capability to effectively adapt to diverse datasets in the open\-world scenarios\. Specifically, on the ImageNet\-C dataset, where existing methods struggle to detect OOD samples using fixed prototypes, ReNC achieves consistently higherA​C​CHACC\_\{H\}, highlighting the effectiveness of our prototype updating mechanism\. Meanwhile, on ImageNet\-R and VisDA\-C datasets, where all methods have relatively highA​C​COACC\_\{O\}, our method still improves ID classification accuracy by approximating the neural collapse state in the target domain\.

2\) UniEnt and OSTTA underperform compared to TENT on nearly all the open\-world benchmarks, suggesting that GMMs and confidence\-based partitioning mechanisms may not align well with their entropy\-based optimization goals\. In contrast, our ReNC performs data partitioning and prototype updating within the same latent space, making it more robust since both processes are tightly coupled\.

3\) The classification accuracy decreases for all methods as the number of classes increases, especially for ImageNet\-C, which contains 1000 classes\. Our results in Table[4](https://arxiv.org/html/2608.19890#S4.T4)indicate an improvement inA​C​CHACC\_\{H\}from 21\.37% to 31\.02%\. This improvement can be attributed to the neural collapse approximation mechanism of ReNC\. For the ImageNet\-C dataset, the number of classes exceeds the batch size, resulting in imbalanced or even missing classes in each batch\. While ReNC updates the prototypes stochastically, it effectively addresses this issue and thus achieves better performance compared to other methods\.

In conclusion, our ReNC stochastically updates the prototypes to fit the target data through neural collapse approximation, operating without any source domain information\. It achieves the best performance across all the open\-world benchmarks\.

Table 2:Open\-world test\-time adaptation results on CIFAR10\-C with OOD samples\. Best marked in bold, second best underlined\.Table 3:Open\-world test\-time adaptation results on CIFAR100\-C with OOD samples\. Best marked in bold, second best underlined\.Table 4:Open\-world test\-time adaptation results on ImageNet\-C with OOD samples\. Best marked in bold, second best underlined\.Table 5:Open\-world test\-time adaptation results on ImageNet\-R with OOD samples\. Best marked in bold, second best underlined\.Table 6:Open\-world test\-time adaptation results on VisDA\-C with OOD samples\. Best marked in bold, second best underlined\.
### 4\.5Connections between TTA and Neural Collapse

In this section, we investigate the connection between TTA and neural collapse to validate that the proposed method aligns with the intrinsic properties of well\-trained neural networks\.

Neural collapse in the source domain:Assumption[1](https://arxiv.org/html/2608.19890#Thmassumption1)states that the pre\-trained model has already collapsed in the source domain\. To validate this, we calculate the𝒩​𝒞1\\mathcal\{NC\}\_\{1\}and𝒩​𝒞3\\mathcal\{NC\}\_\{3\}of the pre\-trained model using its training data\.𝒩​𝒞1\\mathcal\{NC\}\_\{1\}reflects how well the features collapse to their class\-means and𝒩​𝒞3\\mathcal\{NC\}\_\{3\}measures the self\-duality between class\-mean and the classifier weights\. The lower the values of these two metrics, the closer the model is to achieving the neural collapse state\. As shown in Table[7](https://arxiv.org/html/2608.19890#S4.T7), the models trained on different datasets have indeed collapsed on their respective datasets as indicated by low𝒩​𝒞1\\mathcal\{NC\}\_\{1\}and𝒩​𝒞3\\mathcal\{NC\}\_\{3\}values444Due to hardware limitations, we assess the neural collapse state of the ImageNet dataset using its validation set\.\.

Table 7:𝒩​𝒞1\\mathcal\{NC\}\_\{1\}and𝒩​𝒞3\\mathcal\{NC\}\_\{3\}on each training dataset\. Lower values indicate closer to the neural collapse state\.CIFAR10CIFAR100ImageNetVisDA𝒩​𝒞1\\mathcal\{NC\}\_\{1\}𝒩​𝒞3\\mathcal\{NC\}\_\{3\}𝒩​𝒞1\\mathcal\{NC\}\_\{1\}𝒩​𝒞3\\mathcal\{NC\}\_\{3\}𝒩​𝒞1\\mathcal\{NC\}\_\{1\}𝒩​𝒞3\\mathcal\{NC\}\_\{3\}𝒩​𝒞1\\mathcal\{NC\}\_\{1\}𝒩​𝒞3\\mathcal\{NC\}\_\{3\}0\.17120\.24660\.75410\.62352\.32751\.19680\.30310\.5146

Table 8:The ratio𝐛\\mathbf\{b\}to⟨𝐰,𝐜⟩\\langle\\mathbf\{w\},\\mathbf\{c\}\\ranglequantifies their relative influence\. Lower values imply that the bias term is increasingly negligible in the neural collapse state\.Table 9:𝒩​𝒞1\\mathcal\{NC\}\_\{1\}and𝒩​𝒞3\\mathcal\{NC\}\_\{3\}on CIFAR10\-C and CIFAR100\-C with OOD samples\. Best results are marked in bold, second best are underlined\. The gray background indicates the highestA​C​CSACC\_\{S\}\.Table 10:𝒩​𝒞1\\mathcal\{NC\}\_\{1\}and𝒩​𝒞3\\mathcal\{NC\}\_\{3\}on ImageNet\-C with OOD samples\. Best results marked in bold, second best underlined\. The gray background indicates the highestA​C​CSACC\_\{S\}\.Table 11:𝒩​𝒞1\\mathcal\{NC\}\_\{1\}and𝒩​𝒞3\\mathcal\{NC\}\_\{3\}on ImageNet\-R with OOD samples\. Best results marked in bold, second best underlined\. The gray background indicates the highestA​C​CSACC\_\{S\}\.Table 12:𝒩​𝒞1\\mathcal\{NC\}\_\{1\}and𝒩​𝒞3\\mathcal\{NC\}\_\{3\}on VisDA\-C with OOD samples\. Best results marked in bold, second best underlined\. The gray background indicates the highestA​C​CSACC\_\{S\}\.Empirical validation of Assumption[2](https://arxiv.org/html/2608.19890#Thmassumption2):To verify the validity of Assumption[2](https://arxiv.org/html/2608.19890#Thmassumption2), we conduct experiments on a series of classification neural networks\. According to Theorem[6](https://arxiv.org/html/2608.19890#S3.E6), in the context of neural collapse, features𝐳\\mathbf\{z\}have collapsed to their class\-mean, i\.e\., prototype𝐜\\mathbf\{c\}\. Therefore, to empirically validate this assumption, we measure the ratio of the bias term𝐛j\\mathbf\{b\}\_\{j\}to the weight\-prototype interaction⟨𝐰:,j,𝐜j⟩\\langle\\mathbf\{w\}\_\{:,j\},\\mathbf\{c\}\_\{j\}\\rangle, i\.e\.,1K∑jK‖𝐛j‖⟨𝐰:,j,𝐜j⟩\\frac\{1\}\{K\}\\sum\_\{j\}^\{K\}\\frac\{\\\|\\mathbf\{b\}\_\{j\}\\\|\}\{\\langle\\mathbf\{w\}\_\{:,j\},\\mathbf\{c\}\_\{j\}\\rangle\}\. As shown in Table[8](https://arxiv.org/html/2608.19890#S4.T8), the weight\-prototype interaction significantly outweighs the bias term, i\.e\.1K∑jK‖𝐛j‖⟨𝐰:,j,𝐜j⟩≪1\\frac\{1\}\{K\}\\sum\_\{j\}^\{K\}\\frac\{\\\|\\mathbf\{b\}\_\{j\}\\\|\}\{\\langle\\mathbf\{w\}\_\{:,j\},\\mathbf\{c\}\_\{j\}\\rangle\}\\ll 1\. This empirical result validates Assumption 2, which posits that the effect of the bias term is negligible in the neural collapse state\.

Neural collapse in the target domain:TTA algorithms update model parameters to align with the data distribution of the target domain\. Their primary goal is to correct the inaccuracies caused by target samples producing incorrect labels when passed through the pre\-trained model\. Since the pre\-trained model has well\-collapsed in the source domain, following Theorem[5](https://arxiv.org/html/2608.19890#S3.E5)and Theorem[6](https://arxiv.org/html/2608.19890#S3.E6), each feature should collapse to its corresponding classifier weight vector\. The inaccuracies occur because the features generated by the encoder do not align well with the pre\-trained classifier\. From this perspective, effective TTA should guide target representations toward a target\-domain NC\-like geometry\. To support this claim, we measure the𝒩​𝒞1\\mathcal\{NC\}\_\{1\}and𝒩​𝒞3\\mathcal\{NC\}\_\{3\}on all the open\-world benchmarks, and the results are presented in Tables[9](https://arxiv.org/html/2608.19890#S4.T9)\-[12](https://arxiv.org/html/2608.19890#S4.T12)\.

For the corrupted domain, we observe that stronger ID classification performance is often accompanied by better NC\-related properties\. For example, on CIFAR10\-C with Noise and MNIST as OOD samples, ReNC achieves the lowest𝒩​𝒞1\\mathcal\{NC\}\_\{1\}and𝒩​𝒞3\\mathcal\{NC\}\_\{3\}values among all methods, together with the highestA​C​CSACC\_\{S\}\. For CIFAR10\-C with Tiny\-ImageNet and CIFAR100\-C as OOD samples, OSTTA obtains the bestA​C​CSACC\_\{S\}, while ReNC still maintains competitive NC\-related metrics\. These results suggest that although classification accuracy is not solely determined by NC metrics, preserving compact and well\-aligned representations can effectively facilitate the target adaptation process\.

For the style\-transfer domain, as shown in Tables[11](https://arxiv.org/html/2608.19890#S4.T11)and[12](https://arxiv.org/html/2608.19890#S4.T12), ImageNet\-R follows a similar trend to the corrupted domain\. VisDA\-C presents a more challenging case, where SHOT achieves relatively strong collapse metrics but still suffers from poor ID classification performance, even falling below TEST in some settings\. This discrepancy may be due to the distinct training and testing sets in VisDA\-C, which cause the source\-domain pre\-trained classifier to poorly align with the target domain features\. ReNC achieves comparable NC\-related properties and strong adaptation performance, supporting the effectiveness of neural collapse approximation\.

In general, neural collapse provides an informative perspective for understanding classification representations\. The improved NC\-related properties of ReNC offer a plausible explanation for its better performance\.

### 4\.6Ablation Study

In this section, we evaluate the impact of entropy minimization \(ℒe\+\\mathcal\{L\}\_\{e\}^\{\+\}\), the one\-hot distribution prior \(ℒd\\mathcal\{L\}\_\{d\}\), the alignment of samples with their prototypes \(ℒs\\mathcal\{L\}\_\{s\}\), and finally, the effectiveness of Updating Prototypes \(U\.P\.\)\. The TTA performance is reported usingA​C​CHACC\_\{H\}on all the open\-world benchmarks, as shown in Table[13](https://arxiv.org/html/2608.19890#S4.T13)and Table[14](https://arxiv.org/html/2608.19890#S4.T14)\. From these tables, we have the following observations:

1\)ℒs\\mathcal\{L\}\_\{s\}may degrade classification performance if the prototypes are not updated\. For example, on the CIFAR100\-C dataset, applyingℒs\\mathcal\{L\}\_\{s\}leads to a drop inA​C​CHACC\_\{H\}with OOD samples such as MNIST, SVHN, Tiny\-ImageNet and CIFAR10\-C\. This may be because the prototypes, initialized by the weights of the pre\-trained classifier, do not fit well with the target domain\. Pushing samples towards these fixed prototypes can mislead the classification process\. 2\) Updating prototypes generally enhances TTA performance on all the open\-world benchmarks\. This can be attributed to the proposed neural collapse approximation mechanism, which updates prototypes stochastically, enabling the prototypes to well align with the target domain\. 3\) Simply minimizingℒe\+\\mathcal\{L\}\_\{e\}^\{\+\}orℒd\\mathcal\{L\}\_\{d\}can lead to degraded TTA performance\. As shown in Table[14](https://arxiv.org/html/2608.19890#S4.T14), when updating prototypes, optimizing the model withℒe\+\\mathcal\{L\}\_\{e\}^\{\+\}orℒd\\mathcal\{L\}\_\{d\}alone does not provide optimal adaptation results\. Overall, using any of these losses individually may not yield better adaptation results\.

Our ReNC integrates all the losses and updating mechanisms into a unified pipeline\. It encourages variability collapse by pushing samples toward their corresponding prototypes, while preserving balanced embedding structure, which supports more robust and effective adaptation\.

Table 13:Ablation study on the CIFAR10\-C and CIFAR100\-C with OOD samples\. Best results marked in bold, second best underlined\.Table 14:Ablation study on the ImageNet\-C, ImageNet\-R and VisDA\-C with OOD samples\. Best results marked in bold, second best underlined\.
### 4\.7Computational Cost Analysis

In this section, we evaluate the computational cost of each method\. Since OOD detection is performed in a batch\-wise manner, we set the batch size to 64 and measure the per\-sample running time across all benchmarks with Noise OOD samples\. The results are reported in Table[15](https://arxiv.org/html/2608.19890#S4.T15)\. Under the same experimental settings, TEST and BN show the lowest computational overhead\. The proposed ReNC method, while incurring approximately 2–3 times higher cost, achieves significantly better performance\. Compared with other OWTTA\-specific methods, ReNC demonstrates competitive efficiency relative to UniEnt \(0\.003270 vs\. 0\.003955\) while achieving superior results\. Notably, ReNC runs substantially faster than OWT3 on the ImageNet\-C dataset \(0\.003270 vs\. 0\.006559\)\. These results suggest that ReNC achieves a favorable balance between computational cost and performance\.

Table 15:Per\-sample running time \(in seconds\) across all datasets, measured with Noise OOD samples\.
### 4\.8Parameter Analysis

This section explores the model stability with respect to hyper\-parameters\. Given that identifying the optimal balance parameterλ\\lambdais still an unresolved issue in unsupervised learning, we adopt a parameter\-tuning approach\. Figure[6](https://arxiv.org/html/2608.19890#S4.F6)reports experiments with varyingλ∈\{1​e−3,1​e−5,1​e−2,5​e−2,1​e−1,5​e−5\}\\lambda\\in\\left\\\{1e\-3,1e\-5,1e\-2,5e\-2,1e\-1,5e\-5\\right\\\}using theA​C​CHACC\_\{H\}metric\. We observe that the performance remains stable across different parameter values on almost all the open\-world benchmarks, with only minor variations\. For the VisDA\-C dataset, the proposed method also shows improved performance whenλ\\lambdais larger than5​e−35e\-3for different OOD samples\. In brief, the proposed method is stable under different settings ofλ\\lambda, indicating its robustness\.

![Refer to caption](https://arxiv.org/html/2608.19890v1/imgs/param_cifar10.png)\(a\)CIFAR10\-C
![Refer to caption](https://arxiv.org/html/2608.19890v1/imgs/param_cifar100.png)\(b\)CIFAR100\-C
![Refer to caption](https://arxiv.org/html/2608.19890v1/imgs/param_ImageNet-C.png)\(c\)ImageNet\-C
![Refer to caption](https://arxiv.org/html/2608.19890v1/imgs/param_ImageNet-R.png)\(d\)ImageNet\-R
![Refer to caption](https://arxiv.org/html/2608.19890v1/imgs/param_VisDa-C.png)\(e\)VisDA\-C

Figure 6:Parameter analysis of the optimal balance parameterλ\\lambdain Eq\. \([10](https://arxiv.org/html/2608.19890#S3.E10)\)\.
### 4\.9Model Performance across Different OOD Sample Ratios

This section validates the robustness of the proposed method against varying numbers of OOD samples\. Since the ratio between ID and OOD samples can vary in real\-world scenarios, we examine the impact of different OOD sample ratios\. Specifically, we control the OOD sample ratio\|𝒮TO\|\|𝒮TI\|\\frac\{\|\\mathcal\{S\}\_\{T\_\{O\}\}\|\}\{\|\\mathcal\{S\}\_\{T\_\{I\}\}\|\}from 0\.2 to 1\.0 across all the open\-world benchmarks, evaluating theirA​C​CHACC\_\{H\}values\. The results, presented in Figure[7](https://arxiv.org/html/2608.19890#S4.F7), show that the proposed method maintains consistent performance across different OOD sample ratios, demonstrating its applicability to a variety of data ratio scenarios\.

![Refer to caption](https://arxiv.org/html/2608.19890v1/imgs/ratio_cifar10_2.png)\(a\)CIFAR10\-C
![Refer to caption](https://arxiv.org/html/2608.19890v1/imgs/ratio_cifar100_2.png)\(b\)CIFAR100\-C
![Refer to caption](https://arxiv.org/html/2608.19890v1/imgs/ratio_ImageNet-C_2.png)\(c\)ImageNet\-C
![Refer to caption](https://arxiv.org/html/2608.19890v1/imgs/ratio_ImageNet-R_2.png)\(d\)ImageNet\-R
![Refer to caption](https://arxiv.org/html/2608.19890v1/imgs/ratio_VisDa_2.png)\(e\)VisDA\-C

Figure 7:Open\-world test\-time adaptation results of ReNC at different OOD sample ratios\.
### 4\.10Evaluation of Effectiveness on Continual OWTTA

In this section, we evaluate the effectiveness of ReNC under the continual OWTTA setting, where data distribution shifts occur and OOD samples continuously change during the adaptation process\. Specifically, CIFAR10\-C is used as the ID dataset\. For the OOD samples, we introduce the Noise, MNIST, SVHN, Tiny ImageNet, and CIFAR100\-C datasets, all presented sequentially in an online manner\. The comparison results against all baseline methods are presented in Table[16](https://arxiv.org/html/2608.19890#S4.T16), usingA​C​CHACC\_\{H\}as the evaluation metric\. As shown in the table, the proposed ReNC achieves the highest average performance on the continual CIFAR10\-C open\-world benchmark, demonstrating its strong adaptability and effectiveness in handling the continual OWTTA scenario\.

Table 16:Continual OWTTA results on CIFAR10\-C with OOD samples\. Best marked in bold, second best underlined\.
### 4\.11Effectiveness with ViT backbone

In this section, we present additional experiments using a ViT\[[11](https://arxiv.org/html/2608.19890#bib.bib65)\]backbone\. Specifically, we first pretrain a ViT model on the CIFAR10 training set as the source domain model, and then perform OWTTA experiments on the CIFAR10‑C dataset with OOD samples\. Table[17](https://arxiv.org/html/2608.19890#S4.T17)summarizes the results in terms ofA​C​CHACC\_\{H\}\. As shown, ReNC consistently outperforms all baseline methods, demonstrating its robust generalization capability across different backbone architectures\.

Table 17:OWTTA results under ViT backbone, evaluated byA​C​CHACC\_\{H\}\. Best marked in bold, second best underlined\.Table 18:Comparison of vision\-language model extensions on ImageNet\-R with OOD samples, evaluated byA​C​CHACC\_\{H\}\. Best marked in bold, second best underlined\.
### 4\.12Vision Language Models in OWTTA

In this section, we explore the applicability of Vision\-Language Models \(VLMs\)\[[53](https://arxiv.org/html/2608.19890#bib.bib67)\]to OWTTA\. While VLMs are well known for their strong zero\-shot capabilities, they lack native OOD detection mechanisms and thus cannot be directly applied to the OWTTA setting\. To address this limitation, we extend C\-TPT\[[70](https://arxiv.org/html/2608.19890#bib.bib68)\], a CLIP\-based test\-time adaptation method, by incorporating a pre\-trained ResNet\-50 as the OOD detection module, resulting in C\-TPT\+\.

As shown in Table[18](https://arxiv.org/html/2608.19890#S4.T18), C\-TPT\+ ranks second on the ImageNet\-R open\-world benchmark, demonstrating its strong generalization ability\. This result highlights the potential of VLM\-based approaches in OWTTA\. Notably, our ReNC is specifically designed for this task, with tailored components that support more effective learning and adaptation\. As a result, it achieves the best overall performance\. These findings suggest that while VLMs offer impressive zero\-shot and generalization capabilities, they still require task\-specific adaptation to perform reliably in specialized scenarios like OWTTA\.

### 4\.13Friedman Test for Significant Test

In this section, we conduct a significant test to evaluate the performance variations among the eight methods\. Specifically, we utilize the Friedman test\[[8](https://arxiv.org/html/2608.19890#bib.bib59)\]under the assumption of equal performance across all methods as the null hypothesis\. Pairwise comparisons are subsequently carried out using the Nemenyi post\-hoc test\[[45](https://arxiv.org/html/2608.19890#bib.bib60)\]\. The dataset for this evaluation consists of 627 instances, with each method independently assessed across nineteen datasets using three evaluation metrics\. The Friedman test yields a test statistic ofτF=18\.266\\tau\_\{F\}=18\.266, which surpasses the critical value ofF10,560=1\.847F\_\{10,560\}=1\.847at a significance level ofα=0\.05\\alpha=0\.05\. Thus, the null hypothesis is rejected, confirming that there are statistically significant differences among the eight methods at a significance level of 0\.05\. Further examination via the Nemenyi post\-hoc test \(See Figure[8](https://arxiv.org/html/2608.19890#S4.F8)\) shows that our ReNC method demonstrates a clear performance advantage over the seven baseline methods\.

![Refer to caption](https://arxiv.org/html/2608.19890v1/imgs/friedman_3.png)Figure 8:Nemenyi post\-hoc analysis of all the baselines\.

## 5Conclusion

This paper introduces Reliable Neural Collapse approximation \(ReNC\), a method designed to address OWTTA reliably and effectively\. We justify that pre\-trained classifier weights can be viewed as prototypes within the context of neural collapse and develop a reliable update mechanism to filter out Out\-Of\-Distribution \(OOD\) samples during adaptation\. Furthermore, we propose a neural collapse approximation mechanism for updating prototypes, enabling the model to gradually approach the neural collapse state in the target domain while maintaining the balanced structure\. Our empirical results validate the effectiveness of ReNC and suggest that NC\-related properties may provide useful evidence for understanding its improved classification performance\. In future work, we will explore the potential of foundation models for the OWTTA\.

## References

- \[1\]M\. I\. Belghazi, A\. Baratin, S\. Rajeswar, S\. Ozair, Y\. Bengio, R\. D\. Hjelm, and A\. C\. Courville\(2018\)Mutual information neural estimation\.InICML,Vol\.80,pp\. 530–539\.Cited by:[§3\.1](https://arxiv.org/html/2608.19890#S3.SS1.p2.1)\.
- \[2\]S\. Ben\-David, J\. Blitzer, K\. Crammer, A\. Kulesza, F\. Pereira, and J\. W\. Vaughan\(2010\)A theory of learning from different domains\.Mach\. Learn\.79\(1\-2\),pp\. 151–175\.Cited by:[§1](https://arxiv.org/html/2608.19890#S1.p1.1)\.
- \[3\]S\. Ben\-David, J\. Blitzer, K\. Crammer, and F\. Pereira\(2006\)Analysis of representations for domain adaptation\.InNeurIPS,pp\. 137–144\.Cited by:[§1](https://arxiv.org/html/2608.19890#S1.p1.1)\.
- \[4\]M\. Boudiaf, R\. Müller, I\. B\. Ayed, and L\. Bertinetto\(2022\)Parameter\-free online test\-time adaptation\.InCVPR,pp\. 8334–8343\.Cited by:[§1](https://arxiv.org/html/2608.19890#S1.p1.1)\.
- \[5\]W\. Chang, Y\. Shi, H\. Tuan, and J\. Wang\(2022\)Unified optimal transport framework for universal domain adaptation\.InNeurIPS,Cited by:[§2\.3](https://arxiv.org/html/2608.19890#S2.SS3.p2.1)\.
- \[6\]D\. Chen, D\. Wang, T\. Darrell, and S\. Ebrahimi\(2022\)Contrastive test\-time adaptation\.InCVPR,pp\. 295–305\.Cited by:[§2\.1](https://arxiv.org/html/2608.19890#S2.SS1.p5.1)\.
- \[7\]Z\. Chi, Y\. Wang, Y\. Yu, and J\. Tang\(2021\)Test\-time fast adaptation for dynamic scene deblurring via meta\-auxiliary learning\.InCVPR,pp\. 9137–9146\.Cited by:[§1](https://arxiv.org/html/2608.19890#S1.p1.1)\.
- \[8\]J\. Demsar\(2006\)Statistical comparisons of classifiers over multiple data sets\.J\. Mach\. Learn\. Res\.7,pp\. 1–30\.Cited by:[§4\.13](https://arxiv.org/html/2608.19890#S4.SS13.p1.1)\.
- \[9\]L\. Deng\(2012\)The MNIST database of handwritten digit images for machine learning research \[best of the web\]\.IEEE Signal Process\. Mag\.29\(6\),pp\. 141–142\.Cited by:[§4\.1](https://arxiv.org/html/2608.19890#S4.SS1.p1.1)\.
- \[10\]M\. Döbler, R\. A\. Marsden, and B\. Yang\(2023\)Robust mean teacher for continual and gradual test\-time adaptation\.InCVPR,pp\. 7704–7714\.Cited by:[§2\.1](https://arxiv.org/html/2608.19890#S2.SS1.p6.1),[§4\.3](https://arxiv.org/html/2608.19890#S4.SS3.p1.1)\.
- \[11\]A\. Dosovitskiy, L\. Beyer, A\. Kolesnikov, D\. Weissenborn, X\. Zhai, T\. Unterthiner, M\. Dehghani, M\. Minderer, G\. Heigold, S\. Gelly, J\. Uszkoreit, and N\. Houlsby\(2021\)An image is worth 16x16 words: transformers for image recognition at scale\.InICLR,Cited by:[§4\.11](https://arxiv.org/html/2608.19890#S4.SS11.p1.1)\.
- \[12\]X\. Du, Z\. Wang, M\. Cai, and Y\. Li\(2022\)VOS: learning what you don’t know by virtual outlier synthesis\.InICLR,Cited by:[§2\.3](https://arxiv.org/html/2608.19890#S2.SS3.p1.1)\.
- \[13\]Z\. Feng, C\. Xu, and D\. Tao\(2021\)Open\-set hypothesis transfer with semantic consistency\.IEEE Trans\. Image Process\.30,pp\. 6473–6484\.Cited by:[§1](https://arxiv.org/html/2608.19890#S1.p3.1),[§2\.3](https://arxiv.org/html/2608.19890#S2.SS3.p2.1)\.
- \[14\]Y\. Gandelsman, Y\. Sun, X\. Chen, and A\. A\. Efros\(2022\)Test\-time training with masked autoencoders\.InNeurIPS,Cited by:[§2\.1](https://arxiv.org/html/2608.19890#S2.SS1.p3.1)\.
- \[15\]Z\. Gao, X\. Zhang, and C\. Liu\(2024\)Unified entropy optimization for open\-set test\-time adaptation\.InCVPR,pp\. 23975–23984\.Cited by:[§1](https://arxiv.org/html/2608.19890#S1.p3.1),[§2\.2](https://arxiv.org/html/2608.19890#S2.SS2.p4.1),[§3\.1](https://arxiv.org/html/2608.19890#S3.SS1.p6.2),[§4\.3](https://arxiv.org/html/2608.19890#S4.SS3.p1.1),[§4\.3](https://arxiv.org/html/2608.19890#S4.SS3.p2.1)\.
- \[16\]T\. Gong, J\. Jeong, T\. Kim, Y\. Kim, J\. Shin, and S\. Lee\(2022\)NOTE: robust continual test\-time adaptation against temporal correlation\.InNeurIPS,Cited by:[§2\.1](https://arxiv.org/html/2608.19890#S2.SS1.p6.1)\.
- \[17\]S\. Goyal, M\. Sun, A\. Raghunathan, and J\. Z\. Kolter\(2022\)Test time adaptation via conjugate pseudo\-labels\.InNeurIPS,Cited by:[§1](https://arxiv.org/html/2608.19890#S1.p1.1),[§2\.1](https://arxiv.org/html/2608.19890#S2.SS1.p3.1)\.
- \[18\]N\. Hansen, R\. Jangir, Y\. Sun, G\. Alenyà, P\. Abbeel, A\. A\. Efros, L\. Pinto, and X\. Wang\(2021\)Self\-supervised policy adaptation during deployment\.InICLR,Cited by:[§2\.1](https://arxiv.org/html/2608.19890#S2.SS1.p5.1)\.
- \[19\]D\. Hendrycks, S\. Basart, N\. Mu, S\. Kadavath, F\. Wang, E\. Dorundo, R\. Desai, T\. Zhu, S\. Parajuli, M\. Guo, D\. Song, J\. Steinhardt, and J\. Gilmer\(2021\)The many faces of robustness: A critical analysis of out\-of\-distribution generalization\.InICCV,pp\. 8320–8329\.Cited by:[§4\.1](https://arxiv.org/html/2608.19890#S4.SS1.p1.1)\.
- \[20\]D\. Hendrycks and T\. G\. Dietterich\(2019\)Benchmarking neural network robustness to common corruptions and perturbations\.InICLR,Cited by:[§4\.1](https://arxiv.org/html/2608.19890#S4.SS1.p1.1)\.
- \[21\]D\. Hendrycks and K\. Gimpel\(2017\)A baseline for detecting misclassified and out\-of\-distribution examples in neural networks\.InICLR,Cited by:[§2\.3](https://arxiv.org/html/2608.19890#S2.SS3.p1.1)\.
- \[22\]F\. Huang, S\. Song, and L\. Zhang\(2024\)Gradient harmonization in unsupervised domain adaptation\.IEEE Trans\. Pattern Anal\. Mach\. Intell\.,pp\. 1–17\.Cited by:[§2\.1](https://arxiv.org/html/2608.19890#S2.SS1.p2.1)\.
- \[23\]R\. Huang, A\. Geng, and Y\. Li\(2021\)On the importance of gradients for detecting distributional shifts in the wild\.InNeurIPS,pp\. 677–689\.Cited by:[§2\.3](https://arxiv.org/html/2608.19890#S2.SS3.p1.1)\.
- \[24\]C\. Igoe, Y\. Chung, I\. Char, and J\. Schneider\(2022\)How useful are gradients for OOD detection really?\.CoRRabs/2205\.10439\.Cited by:[§2\.3](https://arxiv.org/html/2608.19890#S2.SS3.p1.1)\.
- \[25\]S\. Ioffe and C\. Szegedy\(2015\)Batch normalization: accelerating deep network training by reducing internal covariate shift\.InICML,Vol\.37,pp\. 448–456\.Cited by:[§4\.3](https://arxiv.org/html/2608.19890#S4.SS3.p1.1)\.
- \[26\]A\. Jelea, A\. N\. Belbachir, and M\. Leordeanu\(2025\)Learning from random subspace exploration: generalized test\-time augmentation with self\-supervised distillation\.CoRR\.Cited by:[§2\.3](https://arxiv.org/html/2608.19890#S2.SS3.p3.1)\.
- \[27\]I\. Kim, Y\. Kim, and S\. Kim\(2020\)Learning loss for test\-time augmentation\.InNeurIPS,Cited by:[§2\.3](https://arxiv.org/html/2608.19890#S2.SS3.p3.1)\.
- \[28\]T\. Kojima, Y\. Matsuo, and Y\. Iwasawa\(2022\)Robustifying vision transformer without retraining from scratch by test\-time class\-conditional feature alignment\.InIJCAI,pp\. 1009–1016\.Cited by:[§2\.1](https://arxiv.org/html/2608.19890#S2.SS1.p4.1)\.
- \[29\]J\. N\. Kundu, N\. Venkat, R\. M\. V\., and R\. V\. Babu\(2020\)Universal source\-free domain adaptation\.InCVPR,pp\. 4543–4552\.Cited by:[§1](https://arxiv.org/html/2608.19890#S1.p3.1)\.
- \[30\]Y\. Le and X\. Yang\(2015\)Tiny imagenet visual recognition challenge\.CS 231N7\(7\),pp\. 3\.Cited by:[§4\.1](https://arxiv.org/html/2608.19890#S4.SS1.p1.1)\.
- \[31\]J\. Lee, D\. Das, J\. Choo, and S\. Choi\(2023\)Towards open\-set test\-time adaptation utilizing the wisdom of crowds in entropy minimization\.InICCV,pp\. 16334\.Cited by:[§1](https://arxiv.org/html/2608.19890#S1.p3.1),[§2\.2](https://arxiv.org/html/2608.19890#S2.SS2.p4.1),[§4\.3](https://arxiv.org/html/2608.19890#S4.SS3.p1.1)\.
- \[32\]K\. Lee, H\. Lee, K\. Lee, and J\. Shin\(2018\)Training confidence\-calibrated classifiers for detecting out\-of\-distribution samples\.InICLR,Cited by:[§2\.3](https://arxiv.org/html/2608.19890#S2.SS3.p1.1)\.
- \[33\]G\. Li, G\. Kang, Y\. Zhu, Y\. Wei, and Y\. Yang\(2021\)Domain consensus clustering for universal domain adaptation\.InCVPR,pp\. 9757–9766\.Cited by:[§2\.3](https://arxiv.org/html/2608.19890#S2.SS3.p2.1)\.
- \[34\]R\. Li, Q\. Jiao, W\. Cao, H\. Wong, and S\. Wu\(2020\)Model adaptation: unsupervised domain adaptation without source data\.InCVPR,pp\. 9638–9647\.Cited by:[§1](https://arxiv.org/html/2608.19890#S1.p3.1)\.
- \[35\]Y\. Li and N\. Vasconcelos\(2020\)Background data resampling for outlier\-aware classification\.InCVPR,pp\. 13215–13224\.Cited by:[§2\.3](https://arxiv.org/html/2608.19890#S2.SS3.p1.1)\.
- \[36\]Y\. Li, X\. Xu, Y\. Su, and K\. Jia\(2023\)On the robustness of open\-world test\-time training: self\-training with dynamic prototype expansion\.InICCV,pp\. 11802–11812\.Cited by:[§1](https://arxiv.org/html/2608.19890#S1.p2.1),[§1](https://arxiv.org/html/2608.19890#S1.p3.1),[§2\.2](https://arxiv.org/html/2608.19890#S2.SS2.p4.1),[§4\.2](https://arxiv.org/html/2608.19890#S4.SS2.p1.1),[§4\.3](https://arxiv.org/html/2608.19890#S4.SS3.p1.1),[§4\.3](https://arxiv.org/html/2608.19890#S4.SS3.p2.1)\.
- \[37\]J\. Liang, D\. Hu, J\. Feng, and R\. He\(2021\)UMAD: universal model adaptation under domain and category shift\.CoRRabs/2112\.08553\.Cited by:[§2\.3](https://arxiv.org/html/2608.19890#S2.SS3.p2.1)\.
- \[38\]J\. Liang, D\. Hu, and J\. Feng\(2020\)Do we really need to access the source data? source hypothesis transfer for unsupervised domain adaptation\.InICML,Vol\.119,pp\. 6028–6039\.Cited by:[§1](https://arxiv.org/html/2608.19890#S1.p3.1),[§2\.1](https://arxiv.org/html/2608.19890#S2.SS1.p3.1),[§4\.3](https://arxiv.org/html/2608.19890#S4.SS3.p1.1)\.
- \[39\]S\. Liu, D\. Zhang, and X\. Hao\(2025\)Efficient deformable convolutional prompt for continual test\-time adaptation in medical image segmentation\.InAAAI,pp\. 5550–5557\.Cited by:[§1](https://arxiv.org/html/2608.19890#S1.p3.1)\.
- \[40\]W\. Liu, X\. Wang, J\. D\. Owens, and Y\. Li\(2020\)Energy\-based out\-of\-distribution detection\.InNeurIPS,Cited by:[§2\.3](https://arxiv.org/html/2608.19890#S2.SS3.p1.1)\.
- \[41\]Y\. Liu, P\. Kothari, B\. van Delft, B\. Bellot\-Gurlet, T\. Mordan, and A\. Alahi\(2021\)TTT\+\+: when does self\-supervised test\-time training fail or thrive?\.InNeurIPS,pp\. 21808–21820\.Cited by:[§2\.1](https://arxiv.org/html/2608.19890#S2.SS1.p4.1)\.
- \[42\]Y\. Luo, C\. Ren, X\. Xu, and Q\. Liu\(2024\)Geometric understanding of discriminability and transferability for visual domain adaptation\.IEEE Trans\. Pattern Anal\. Mach\. Intell\.,pp\. 1–16\.Cited by:[§2\.1](https://arxiv.org/html/2608.19890#S2.SS1.p2.1)\.
- \[43\]Y\. Ming, Y\. Fan, and Y\. Li\(2022\)POEM: out\-of\-distribution detection with posterior sampling\.InICML,Vol\.162,pp\. 15650–15665\.Cited by:[§2\.3](https://arxiv.org/html/2608.19890#S2.SS3.p1.1)\.
- \[44\]M\. J\. Mirza, P\. Jané\-Soneira, W\. Lin, M\. Kozinski, H\. Possegger, and H\. Bischof\(2023\)ActMAD: activation matching to align distributions for test\-time\-training\.InCVPR,pp\. 24152–24161\.Cited by:[§2\.1](https://arxiv.org/html/2608.19890#S2.SS1.p4.1)\.
- \[45\]P\. B\. Nemenyi\(1963\)Distribution\-free multiple comparisons\.\.Princeton University\.Cited by:[§4\.13](https://arxiv.org/html/2608.19890#S4.SS13.p1.1)\.
- \[46\]Y\. Netzer, T\. Wang, A\. Coates, A\. Bissacco, B\. Wu, A\. Y\. Ng,et al\.\(2011\)Reading digits in natural images with unsupervised feature learning\.InNIPS workshop on deep learning and unsupervised feature learning,Vol\.2011,pp\. 7\.Cited by:[§4\.1](https://arxiv.org/html/2608.19890#S4.SS1.p1.1)\.
- \[47\]S\. Niu, J\. Wu, Y\. Zhang, Y\. Chen, S\. Zheng, P\. Zhao, and M\. Tan\(2022\)Efficient test\-time model adaptation without forgetting\.InICML,Vol\.162,pp\. 16888–16905\.Cited by:[§1](https://arxiv.org/html/2608.19890#S1.p1.1),[§4\.3](https://arxiv.org/html/2608.19890#S4.SS3.p1.1)\.
- \[48\]S\. Niu, J\. Wu, Y\. Zhang, Z\. Wen, Y\. Chen, P\. Zhao, and M\. Tan\(2023\)Towards stable test\-time adaptation in dynamic wild world\.InICLR,Cited by:[§2\.1](https://arxiv.org/html/2608.19890#S2.SS1.p6.1)\.
- \[49\]X\. Peng, B\. Usman, N\. Kaushik, J\. Hoffman, D\. Wang, and K\. Saenko\(2017\)VisDA: the visual domain adaptation challenge\.CoRR\.Cited by:[§4\.1](https://arxiv.org/html/2608.19890#S4.SS1.p1.1)\.
- \[50\]Y\. Qian, Y\. Bai, Z\. Zhang, P\. Zhao, and Z\. Zhou\(2023\)Handling new class in online label shift\.InICDM,pp\. 1283–1288\.Cited by:[§2\.2](https://arxiv.org/html/2608.19890#S2.SS2.p1.1)\.
- \[51\]S\. Qu, T\. Zou, L\. He, F\. Röhrbein, A\. Knoll, G\. Chen, and C\. Jiang\(2024\)LEAD: learning decomposition for source\-free universal domain adaptation\.InCVPR,pp\. 23334–23343\.Cited by:[§2\.3](https://arxiv.org/html/2608.19890#S2.SS3.p2.1)\.
- \[52\]S\. Qu, T\. Zou, F\. Röhrbein, C\. Lu, G\. Chen, D\. Tao, and C\. Jiang\(2023\)Upcycling models under domain and category shift\.InCVPR,pp\. 20019–20028\.Cited by:[§2\.3](https://arxiv.org/html/2608.19890#S2.SS3.p2.1)\.
- \[53\]A\. Radford, J\. W\. Kim, C\. Hallacy, A\. Ramesh, G\. Goh, S\. Agarwal, G\. Sastry, A\. Askell, P\. Mishkin, J\. Clark, G\. Krueger, and I\. Sutskever\(2021\)Learning transferable visual models from natural language supervision\.InICML,Vol\.139,pp\. 8748–8763\.Cited by:[§2\.1](https://arxiv.org/html/2608.19890#S2.SS1.p6.1),[§4\.12](https://arxiv.org/html/2608.19890#S4.SS12.p1.1)\.
- \[54\]K\. Saito, D\. Kim, S\. Sclaroff, and K\. Saenko\(2020\)Universal domain adaptation through self supervision\.InNeurIPS,Cited by:[§2\.3](https://arxiv.org/html/2608.19890#S2.SS3.p2.1)\.
- \[55\]C\. S\. Sastry and S\. Oore\(2020\)Detecting out\-of\-distribution examples with gram matrices\.InICML,Vol\.119,pp\. 8491–8501\.Cited by:[§2\.3](https://arxiv.org/html/2608.19890#S2.SS3.p1.1)\.
- \[56\]D\. Shanmugam, D\. W\. Blalock, G\. Balakrishnan, and J\. V\. Guttag\(2021\)Better aggregation in test\-time augmentation\.InICCV,pp\. 1194–1203\.Cited by:[§2\.3](https://arxiv.org/html/2608.19890#S2.SS3.p3.1)\.
- \[57\]J\. Snell, K\. Swersky, and R\. S\. Zemel\(2017\)Prototypical networks for few\-shot learning\.InNeurIPS,pp\. 4077–4087\.Cited by:[§3\.1](https://arxiv.org/html/2608.19890#S3.SS1.p4.1)\.
- \[58\]Y\. Su, X\. Xu, and K\. Jia\(2022\)Revisiting realistic test\-time training: sequential inference and adaptation by anchored clustering\.InNeurIPS,Cited by:[§2\.1](https://arxiv.org/html/2608.19890#S2.SS1.p4.1)\.
- \[59\]Y\. Su, X\. Xu, and K\. Jia\(2024\)Towards real\-world test\-time adaptation: tri\-net self\-training with balanced normalization\.InAAAI,pp\. 15126–15135\.Cited by:[§2\.1](https://arxiv.org/html/2608.19890#S2.SS1.p2.1)\.
- \[60\]Y\. Su, X\. Xu, T\. Li, and K\. Jia\(2024\)Revisiting realistic test\-time training: sequential inference and adaptation by anchored clustering regularized self\-training\.IEEE Trans\. Pattern Anal\. Mach\. Intell\.46\(8\),pp\. 5524–5540\.Cited by:[§2\.1](https://arxiv.org/html/2608.19890#S2.SS1.p4.1)\.
- \[61\]Y\. Sun, C\. Guo, and Y\. Li\(2021\)ReAct: out\-of\-distribution detection with rectified activations\.InNeurIPS,pp\. 144–157\.Cited by:[§2\.3](https://arxiv.org/html/2608.19890#S2.SS3.p1.1)\.
- \[62\]Y\. Sun, Y\. Ming, X\. Zhu, and Y\. Li\(2022\)Out\-of\-distribution detection with deep nearest neighbors\.InICML,Vol\.162,pp\. 20827–20840\.Cited by:[§2\.3](https://arxiv.org/html/2608.19890#S2.SS3.p1.1)\.
- \[63\]Y\. Sun, X\. Wang, Z\. Liu, J\. Miller, A\. A\. Efros, and M\. Hardt\(2020\)Test\-time training with self\-supervision for generalization under distribution shifts\.InICML,Vol\.119,pp\. 9229–9248\.Cited by:[§2\.1](https://arxiv.org/html/2608.19890#S2.SS1.p5.1)\.
- \[64\]S\. Vernekar, A\. Gaurav, V\. Abdelzad, T\. Denouden, R\. Salay, and K\. Czarnecki\(2019\)Out\-of\-distribution detection in classifiers via generation\.CoRRabs/1910\.04241\.Cited by:[§2\.3](https://arxiv.org/html/2608.19890#S2.SS3.p1.1)\.
- \[65\]D\. Wang, E\. Shelhamer, S\. Liu, B\. A\. Olshausen, and T\. Darrell\(2021\)Tent: fully test\-time adaptation by entropy minimization\.InICLR,Cited by:[§2\.1](https://arxiv.org/html/2608.19890#S2.SS1.p3.1),[§4\.3](https://arxiv.org/html/2608.19890#S4.SS3.p1.1)\.
- \[66\]H\. Wang, Z\. Li, L\. Feng, and W\. Zhang\(2022\)ViM: out\-of\-distribution with virtual\-logit matching\.InCVPR,pp\. 4911–4920\.Cited by:[§2\.3](https://arxiv.org/html/2608.19890#S2.SS3.p1.1)\.
- \[67\]Q\. Wang, O\. Fink, L\. V\. Gool, and D\. Dai\(2022\)Continual test\-time domain adaptation\.InCVPR,pp\. 7191–7201\.Cited by:[§2\.1](https://arxiv.org/html/2608.19890#S2.SS1.p6.1),[§4\.3](https://arxiv.org/html/2608.19890#S4.SS3.p1.1.8)\.
- \[68\]Y\. Wu, Z\. Chi, Y\. Wang, K\. N\. Plataniotis, and S\. Feng\(2024\)Test\-time domain adaptation by learning domain\-aware batch normalization\.InAAAI,pp\. 15961–15969\.Cited by:[§2\.1](https://arxiv.org/html/2608.19890#S2.SS1.p2.1)\.
- \[69\]S\. Xie, Z\. Zheng, L\. Chen, and C\. Chen\(2018\)Learning semantic representations for unsupervised domain adaptation\.InICML,Vol\.80,pp\. 5419–5428\.Cited by:[§3\.3\.3](https://arxiv.org/html/2608.19890#S3.SS3.SSS3.p4.3)\.
- \[70\]H\. S\. Yoon, E\. Yoon, J\. T\. J\. Tee, M\. A\. Hasegawa\-Johnson, Y\. Li, and C\. D\. Yoo\(2024\)C\-TPT: calibrated test\-time prompt tuning for vision\-language models via text feature dispersion\.InICLR,Cited by:[§2\.1](https://arxiv.org/html/2608.19890#S2.SS1.p6.1),[§4\.12](https://arxiv.org/html/2608.19890#S4.SS12.p1.1)\.
- \[71\]K\. You, M\. Long, Z\. Cao, J\. Wang, and M\. I\. Jordan\(2019\)Universal domain adaptation\.InCVPR,pp\. 2720–2729\.Cited by:[§1](https://arxiv.org/html/2608.19890#S1.p1.1),[§2\.3](https://arxiv.org/html/2608.19890#S2.SS3.p2.1)\.
- \[72\]M\. Yuan, Y\. Xia, H\. Dong, Z\. Chen, J\. Yao, M\. Qiu, K\. Yan, X\. Yin, Y\. Shi, X\. Chen, Z\. Liu, B\. Dong, J\. Zhou, L\. Lu, L\. Zhang, and L\. Zhang\(2023\)Devil is in the queries: advancing mask transformers for real\-world medical image segmentation and out\-of\-distribution localization\.InCVPR,pp\. 23879–23889\.Cited by:[§1](https://arxiv.org/html/2608.19890#S1.p2.1)\.
- \[73\]J\. Zhou, C\. You, X\. Li, K\. Liu, S\. Liu, Q\. Qu, and Z\. Zhu\(2022\)Are all losses created equal: A neural collapse perspective\.InNeurIPS,Cited by:[§1](https://arxiv.org/html/2608.19890#S1.p4.1)\.
- \[74\]Z\. Zhou, L\. Guo, L\. Jia, D\. Zhang, and Y\. Li\(2023\)ODS: test\-time adaptation in the presence of open\-world data shift\.InICML,Vol\.202,pp\. 42574–42588\.Cited by:[§2\.1](https://arxiv.org/html/2608.19890#S2.SS1.p6.1)\.
- \[75\]Z\. Zhou, K\. Yu, L\. Guo, and Y\. Li\(2025\)Fully test\-time adaptation for tabular data\.InAAAI,pp\. 23027–23035\.Cited by:[§2\.1](https://arxiv.org/html/2608.19890#S2.SS1.p6.1)\.
- \[76\]Z\. Zhu, T\. Ding, J\. Zhou, X\. Li, C\. You, J\. Sulam, and Q\. Qu\(2021\)A geometric analysis of neural collapse with unconstrained features\.InNeurIPS,pp\. 29820–29834\.Cited by:[§3\.2](https://arxiv.org/html/2608.19890#S3.SS2.p2.1),[Theorem 1](https://arxiv.org/html/2608.19890#ThmmyTheo1.2),[Theorem 2](https://arxiv.org/html/2608.19890#ThmmyTheo2.2),[Theorem 3](https://arxiv.org/html/2608.19890#ThmmyTheo3.2)\.