Original: DELTA : DEGRADATION - FREE FULLY TEST - TIME ADAPTATION
Revised: DELTA : DEGRADATION - FREE FULLY TEST - TIME ADAPTATION

Original: Anonymous authors
Revised: Anonymous authors

Original: Paper under double-blind review
Revised: Paper under double-blind review

Original: A BSTRACT
Revised: A BSTRACT

Original: Fully test-time adaptation aims at adapting a pre-trained model to the test stream during real-time inference, which is urgently required when the test distribution differs from the training distribution.
Revised: Fully test-time adaptation aims at adapting a pre-trained model to the test stream during real-time inference, which is urgently required when the test distribution differs from the training distribution.

Original: Several efforts have been devoted to improving adaptation performance.
Revised: Several efforts have been devoted to improving adaptation performance.

Original: However, we find that two unfavorable defects are concealed in the prevalent adaptation methodologies like test-time batch normalization (BN) and self-learning.
Revised: However, we find that two unfavorable defects are concealed in the prevalent adaptation methodologies like test-time batch normalization (BN) and self-learning.

Original: First, we reveal that the normalization statistics in test-time BN are completely affected by the currently received test samples, resulting in inaccurate estimates.
Revised: First, we reveal that the normalization statistics in test-time BN are completely affected by the currently received test samples, resulting in inaccurate estimates.

Original: Second, we show that during test-time adaptation, the parameter update is biased towards some dominant classes.
Revised: Second, we show that during test-time adaptation, the parameter update is biased towards some dominant classes.

Original: In addition to the extensively studied test stream with independent and class-balanced samples, we further observe that the defects can be exacerbated in more complicated test environments, such as (time) dependent or class-imbalanced data.
Revised: In addition to the extensively studied test stream with independent and class-balanced samples, we further observe that the defects can be exacerbated in more complicated test environments, such as (time) dependent or class-imbalanced data.

Original: We observe that previous approaches work well in certain scenarios while show performance degradation in others due to their faults.
Revised: We observe that previous approaches work well in certain scenarios while show performance degradation in others due to their faults.

Original: In this paper, we provide a plug-in solution called DELTA for Degradation-freE fuLly Test-time Adaptation, which consists of two components: (i) Test-time Batch Renormalization (TBR), introduced to improve the estimated normalization statistics.
Revised: In this paper, we provide a plug-in solution called DELTA for Degradation-freE fuLly Test-time Adaptation, which consists of two components: (i) Test-time Batch Renormalization (TBR), introduced to improve the estimated normalization statistics.

Original: (ii) Dynamic Online re-weighTing (DOT), designed to address the class bias within optimization.
Revised: (ii) Dynamic Online re-weighTing (DOT), designed to address the class bias within optimization.

Original: We investigate various test-time adaptation methods on three commonly used datasets with four scenarios, and a newly introduced real-world dataset.
Revised: We investigate various test-time adaptation methods on three commonly used datasets with four scenarios, and a newly introduced real-world dataset.

Original: DELTA can help them deal with all scenarios simultaneously, leading to new state-of-the-art testtime adaptation performance.
Revised: DELTA can help them deal with all scenarios simultaneously, leading to new state-of-the-art testtime adaptation performance.

Original:  INTRODUCTION
Revised:  INTRODUCTION

Original: Models suffer from performance decrease when test and training distributions are mismatched (Quinonero-Candela et al., 2008).
Revised: Models suffer from performance decrease when test and training distributions are mismatched (Quinonero-Candela et al., 2008).

Original: Numerous studies have been conducted to narrow the performance gap based on a variety of hypotheses/settings.
Revised: Numerous studies have been conducted to narrow the performance gap based on a variety of hypotheses/settings.

Original: Unsupervised domain adaptation methods (Ganin et al., 2016) necessitate simultaneous access to labeled training data and unlabeled target data, limiting their applications.
Revised: Unsupervised domain adaptation methods (Ganin et al., 2016) necessitate simultaneous access to labeled training data and unlabeled target data, limiting their applications.

Original: Source-free domain adaptation approaches (Liang et al., 2020) only need a trained model and do not require original training data when performing adaptation.
Revised: Source-free domain adaptation approaches (Liang et al., 2020) only need a trained model and do not require original training data when performing adaptation.

Original: Nonetheless, in a more difficult and realistic setting, known as fully test-time adaptation (Wang et al., 2021), the model must perform online adaptation to the test stream in real-time inference.
Revised: Nonetheless, in a more difficult and realistic setting, known as fully test-time adaptation (Wang et al., 2021), the model must perform online adaptation to the test stream in real-time inference.

Original: The model is adapted in a single pass on the test stream using a pre-trained model and continuously arriving test data (rather than a prepared target set).
Revised: The model is adapted in a single pass on the test stream using a pre-trained model and continuously arriving test data (rather than a prepared target set).

Original: Offline iterative training or extra heavy computational burdens beyond normal inference do not meet the requirements.
Revised: Offline iterative training or extra heavy computational burdens beyond normal inference do not meet the requirements.

Original: There have been several studies aimed at fully test-time adaptation.
Revised: There have been several studies aimed at fully test-time adaptation.

Original: Test-time BN (Nado et al., 2020) / BN adapt (Schneider et al., 2020) directly uses the normalization statistics derived from test samples instead of those inherited from the training data, which is found to be beneficial in reducing the performance gap.
Revised: Test-time BN (Nado et al., 2020) / BN adapt (Schneider et al., 2020) directly uses the normalization statistics derived from test samples instead of those inherited from the training data, which is found to be beneficial in reducing the performance gap.

Original: Entropy-minimization-based methods, such as TENT (Wang et al., 2021), further optimize model parameters during inference.
Revised: Entropy-minimization-based methods, such as TENT (Wang et al., 2021), further optimize model parameters during inference.

Original: Contrastive learning (Chen et al., 2022), data augmentation (Wang et al., 2022a) and uncertainty-aware optimization (Niu et al., 2022) have been introduced to enhance adaptation performance.
Revised: Contrastive learning (Chen et al., 2022), data augmentation (Wang et al., 2022a) and uncertainty-aware optimization (Niu et al., 2022) have been introduced to enhance adaptation performance.

Original: Efforts have also been made to address test-time adaptation in more complex test environments, like LAME (Boudiaf et al., 2022).
Revised: Efforts have also been made to address test-time adaptation in more complex test environments, like LAME (Boudiaf et al., 2022).

Original: [Figure]
Revised: [Figure]

Original: [Table]
Revised: [Table]

Original: Despite the achieved progress, we find that there are non-negligible defects hidden in the popular methods.
Revised: Despite the achieved progress, we find that there are non-negligible defects hidden in the popular methods.

Original: First, we take a closer look at the normalization statistics within inference (Section 3.2).
Revised: First, we take a closer look at the normalization statistics within inference (Section 3.2).

Original: We observe that the statistics used in BN adapt is inaccurate in per batch compared to the actual population statistics.
Revised: We observe that the statistics used in BN adapt is inaccurate in per batch compared to the actual population statistics.

Original: Second, we reveal that the prevalent test-time model updating is biased towards some dominant categories (Section 3.3).
Revised: Second, we reveal that the prevalent test-time model updating is biased towards some dominant categories (Section 3.3).

Original: We notice that the model predictions are extremely imbalanced on out-of-distribution data, which can be exacerbated by the self-learning-based adaptation methods.
Revised: We notice that the model predictions are extremely imbalanced on out-of-distribution data, which can be exacerbated by the self-learning-based adaptation methods.

Original: Besides the most common independent and class-balanced test samples considered in existing studies, following Boudiaf et al.
Revised: Besides the most common independent and class-balanced test samples considered in existing studies, following Boudiaf et al.

Original: (2022), we investigate other three test scenarios as illustrated in Figure 1 (please see details in Section 3.1) and find when facing the more intricate test streams, like dependent samples or class-imbalanced data, the prevalent methods would suffer from severe performance degradation, which limits the usefulness of these test-time adaptation strategies.
Revised: (2022), we investigate other three test scenarios as illustrated in Figure 1 (please see details in Section 3.1) and find when facing the more intricate test streams, like dependent samples or class-imbalanced data, the prevalent methods would suffer from severe performance degradation, which limits the usefulness of these test-time adaptation strategies.

Original: To address the aforementioned issues, we propose two powerful tools.
Revised: To address the aforementioned issues, we propose two powerful tools.

Original: Specifically, to handle the inaccurate normalization statistics, we introduce test-time batch renormalization (TBR) (Section 3.2), which uses the test-time moving averaged statistics to rectify the normalized features and considers normalization during gradient optimization.
Revised: Specifically, to handle the inaccurate normalization statistics, we introduce test-time batch renormalization (TBR) (Section 3.2), which uses the test-time moving averaged statistics to rectify the normalized features and considers normalization during gradient optimization.

Original: By taking advantage of the observed test samples, the calibrated normalization is more accurate.
Revised: By taking advantage of the observed test samples, the calibrated normalization is more accurate.

Original: We further propose dynamic online re-weighting (DOT)
Revised: We further propose dynamic online re-weighting (DOT)

Original: (Section 3.3) to tackle the biased optimization, which is derived from cost-sensitive learning.
Revised: (Section 3.3) to tackle the biased optimization, which is derived from cost-sensitive learning.

Original: To balance adaptation, DOT assigns low/high weights to the frequent/infrequent categories.
Revised: To balance adaptation, DOT assigns low/high weights to the frequent/infrequent categories.

Original: The weight mapping function is based on a momentum-updated class-frequency vector that takes into account multiple sources of category bias, including the pre-trained model, the test stream, and the adaptation methods (the methods usually do not have an intrinsic bias towards certain classes, but can accentuate existing bias).
Revised: The weight mapping function is based on a momentum-updated class-frequency vector that takes into account multiple sources of category bias, including the pre-trained model, the test stream, and the adaptation methods (the methods usually do not have an intrinsic bias towards certain classes, but can accentuate existing bias).

Original: TBR can be applied directly to the common BN-based pre-trained models and does not interfere with the training process (corresponding to the fully test-time adaptation setting), and DOT can be easily combined with other adaptation approaches as well.
Revised: TBR can be applied directly to the common BN-based pre-trained models and does not interfere with the training process (corresponding to the fully test-time adaptation setting), and DOT can be easily combined with other adaptation approaches as well.

Original: Table 1 compares our method to others on CIFAR100-C (Hendrycks & Dietterich, 2019) across various scenarios.
Revised: Table 1 compares our method to others on CIFAR100-C (Hendrycks & Dietterich, 2019) across various scenarios.

Original: The existing test-time adaptation methods behave differently across the four scenarios and show performance degradation in some scenarios.
Revised: The existing test-time adaptation methods behave differently across the four scenarios and show performance degradation in some scenarios.

Original: While our tools perform well in all four scenarios simultaneously without any prior knowledge of the test data, which is important for real-world applications.
Revised: While our tools perform well in all four scenarios simultaneously without any prior knowledge of the test data, which is important for real-world applications.

Original: Thus, the whole method is named DELTA (Degradation-freE fuLly
Revised: Thus, the whole method is named DELTA (Degradation-freE fuLly

Original: Test-time Adaptation).
Revised: Test-time Adaptation).

Original: The major contributions of our work are as follows.
Revised: The major contributions of our work are as follows.

Original: (i)
Revised: (i)

Original: We expose the defects in commonly used test-time adaptation methods, which ultimately harm adaptation performance.
Revised: We expose the defects in commonly used test-time adaptation methods, which ultimately harm adaptation performance.

Original: (ii) We demonstrate that the defects will be even more severe in complex test environments, causing performance degradation.
Revised: (ii) We demonstrate that the defects will be even more severe in complex test environments, causing performance degradation.

Original: (iii) To achieve degradation-free fully test-time adaptation, we propose DELTA which comprises two components: TBR and DOT, to improve the normalization statistics estimates and mitigate the bias within optimization.
Revised: (iii) To achieve degradation-free fully test-time adaptation, we propose DELTA which comprises two components: TBR and DOT, to improve the normalization statistics estimates and mitigate the bias within optimization.

Original: (iv) We evaluate DELTA on three common datasets with four scenarios and a newly introduced real-world dataset, and find that it can consistently improve the popular test-time adaptation methods on all scenarios, yielding new state-of-the-art results.
Revised: (iv) We evaluate DELTA on three common datasets with four scenarios and a newly introduced real-world dataset, and find that it can consistently improve the popular test-time adaptation methods on all scenarios, yielding new state-of-the-art results.

Original:  RELATED WORK
Revised:  RELATED WORK

Original: Unsupervised domain adaptation (UDA).
Revised: Unsupervised domain adaptation (UDA).

Original: In reality, test distribution is frequently inconsistent with the training distribution, resulting in poor performance.
Revised: In reality, test distribution is frequently inconsistent with the training distribution, resulting in poor performance.

Original: UDA aims to alleviate the phenomenon with the collected unlabeled samples from the target distribution.
Revised: UDA aims to alleviate the phenomenon with the collected unlabeled samples from the target distribution.

Original: One popular approach is to align the statistical moments across different distributions (Gretton et al., 2006; Zellinger et al., 2017; Long et al.,
Revised: One popular approach is to align the statistical moments across different distributions (Gretton et al., 2006; Zellinger et al., 2017; Long et al.,

Original: Another line of studies adopts adversarial training to achieve adaptation (Ganin et al., 2016;
Revised: Another line of studies adopts adversarial training to achieve adaptation (Ganin et al., 2016;

Original: Long et al., 2018).
Revised: Long et al., 2018).

Original: UDA has been developed for many tasks including object classification (Saito et al.
Revised: UDA has been developed for many tasks including object classification (Saito et al.

Original: , 2017)/detection (Li et al., 2021) and semantic segmentation (Hoffman et al., 2018).
Revised: , 2017)/detection (Li et al., 2021) and semantic segmentation (Hoffman et al., 2018).

Original: Source-free domain adaptation (SFDA).
Revised: Source-free domain adaptation (SFDA).

Original: SFDA deals with domain gap with only the trained model and the prepared unlabeled target data.
Revised: SFDA deals with domain gap with only the trained model and the prepared unlabeled target data.

Original: To be more widely used, SFDA methods should be built on a common source model trained by a standard pipeline.
Revised: To be more widely used, SFDA methods should be built on a common source model trained by a standard pipeline.

Original: SHOT (Liang et al., 2020) freezes the source model’s classifier and optimizes the feature extractor via entropy minimization, diversity regularization, and pseudo-labeling.
Revised: SHOT (Liang et al., 2020) freezes the source model’s classifier and optimizes the feature extractor via entropy minimization, diversity regularization, and pseudo-labeling.

Original: SHOT incorporates weight normalization, 1D BN, and labelsmoothing into backbones and training, which do not exist in most off-the-shelf trained models, but its other ideas can be used.
Revised: SHOT incorporates weight normalization, 1D BN, and labelsmoothing into backbones and training, which do not exist in most off-the-shelf trained models, but its other ideas can be used.

Original: USFDA (Kundu et al., 2020) utilizes synthesized samples to achieve compact decision boundaries.
Revised: USFDA (Kundu et al., 2020) utilizes synthesized samples to achieve compact decision boundaries.

Original: NRC (Yang et al., 2021b) encourages label consistency among local target features with the same network architecture as SHOT.
Revised: NRC (Yang et al., 2021b) encourages label consistency among local target features with the same network architecture as SHOT.

Original: GSFDA
Revised: GSFDA

Original: (Yang et al., 2021a) further expects the adapted model performs well not only on target data but also on source data.
Revised: (Yang et al., 2021a) further expects the adapted model performs well not only on target data but also on source data.

Original: Fully test-time adaptation (FTTA).
Revised: Fully test-time adaptation (FTTA).

Original: FTTA is a more difficult and realistic setting.
Revised: FTTA is a more difficult and realistic setting.

Original: In the same way that SFDA does not provide the source training data, only the trained model is provided.
Revised: In the same way that SFDA does not provide the source training data, only the trained model is provided.

Original: Unlike
Revised: Unlike

Original: SFDA, FTTA cannot access the entire target dataset; however, the methods should be capable of doing online adaptation on the test stream and providing instant predictions for the arrived test samples.
Revised: SFDA, FTTA cannot access the entire target dataset; however, the methods should be capable of doing online adaptation on the test stream and providing instant predictions for the arrived test samples.

Original: BN adapt (Nado et al., 2020; Schneider et al., 2020) replaces the normalization statistics estimated during training with those derived from the test mini-batch.
Revised: BN adapt (Nado et al., 2020; Schneider et al., 2020) replaces the normalization statistics estimated during training with those derived from the test mini-batch.

Original: On top of it, TENT (Wang et al., 2021) optimizes the affine parameters in BN through entropy minimization during test.
Revised: On top of it, TENT (Wang et al., 2021) optimizes the affine parameters in BN through entropy minimization during test.

Original: EATA (Niu et al., 2022) and CoTTA (Wang et al., 2022a) study long-term test-time adaptation in continually changing environments.
Revised: EATA (Niu et al., 2022) and CoTTA (Wang et al., 2022a) study long-term test-time adaptation in continually changing environments.

Original: ETA (Niu et al., 2022) excludes unreliable and redundant samples from the optimization.
Revised: ETA (Niu et al., 2022) excludes unreliable and redundant samples from the optimization.

Original: AdaContrast (Chen et al., 2022) resorts to contrastive learning to promote feature learning along with a pseudo label refinement mechanism.
Revised: AdaContrast (Chen et al., 2022) resorts to contrastive learning to promote feature learning along with a pseudo label refinement mechanism.

Original: Both AdaContrast and CoTTA utilize heavy data augmentation during test, which will increase inference latency.
Revised: Both AdaContrast and CoTTA utilize heavy data augmentation during test, which will increase inference latency.

Original: Besides, AdaContrast modifies the model architecture as in SHOT.
Revised: Besides, AdaContrast modifies the model architecture as in SHOT.

Original: Different from them, LAME (Boudiaf et al., 2022) does not rectify the model’s parameters but only the model’s output probabilities via the introduced unsupervised objective laplacian adjusted maximum-likelihood estimation.
Revised: Different from them, LAME (Boudiaf et al., 2022) does not rectify the model’s parameters but only the model’s output probabilities via the introduced unsupervised objective laplacian adjusted maximum-likelihood estimation.

Original: Class-imbalanced learning.
Revised: Class-imbalanced learning.

Original: Training with class-imbalanced data has attracted widespread attention (Liu et al., 2019).
Revised: Training with class-imbalanced data has attracted widespread attention (Liu et al., 2019).

Original: Cost-sensitive learning (Elkan, 2001) and resampling (Wang et al., 2020) are the classical strategies to handle this problem.
Revised: Cost-sensitive learning (Elkan, 2001) and resampling (Wang et al., 2020) are the classical strategies to handle this problem.

Original: Ren et al.
Revised: Ren et al.

Original: (2018) designs a meta-learning paradigm to assign weights to samples.
Revised: (2018) designs a meta-learning paradigm to assign weights to samples.

Original: Class-balanced loss (Cui et al., 2019) uses the effective number of samples when performing re-weighting.
Revised: Class-balanced loss (Cui et al., 2019) uses the effective number of samples when performing re-weighting.

Original: Decoupled training (Kang et al., 2020b) learns the feature extractor and the classifier separately.
Revised: Decoupled training (Kang et al., 2020b) learns the feature extractor and the classifier separately.

Original: Menon et al.
Revised: Menon et al.

Original: (2021) propose logit adjustment from a statistical perspective.
Revised: (2021) propose logit adjustment from a statistical perspective.

Original: Other techniques such as weight balancing (Alshammari et al., 2022; Zhao et al., 2020), contrastive learning (Kang et al., 2020a), knowledge distillation (He et al., 2021), etc. have also been applied to solve this problem.
Revised: Other techniques such as weight balancing (Alshammari et al., 2022; Zhao et al., 2020), contrastive learning (Kang et al., 2020a), knowledge distillation (He et al., 2021), etc. have also been applied to solve this problem.

Original:  DELTA : DEGRADATION - FREE FULLY TEST - TIME ADAPTATION 3. PROBLEM DEFINITION
Revised:  DELTA : DEGRADATION - FREE FULLY TEST - TIME ADAPTATION 3. PROBLEM DEFINITION

Original: Assume that we have the training data D train = { ( x i , y i ) } N train i =1 ∼ P train ( x, y ) , where x ∈ X is the input and
Revised: Assume that we have the training data D train = { ( x i , y i ) } N train i =1 ∼ P train ( x, y ) , where x ∈ X is the input and

Original: y ∈ Y = { 1 , 2 , · · · , K } is the target label; f { θ 0 ,a 0 } denotes the model with parameters θ 0 and normalization statistics a 0 learned or estimated on D train .
Revised: y ∈ Y = { 1 , 2 , · · · , K } is the target label; f { θ 0 ,a 0 } denotes the model with parameters θ 0 and normalization statistics a 0 learned or estimated on D train .

Original: Without loss of generality, we denote the test stream as D test = { ( x j , y j ) } N test j =1 ∼ P test ( x, y ) , where { y j } are not available actually, the subscript j also indicates the sample position within the test stream.
Revised: Without loss of generality, we denote the test stream as D test = { ( x j , y j ) } N test j =1 ∼ P test ( x, y ) , where { y j } are not available actually, the subscript j also indicates the sample position within the test stream.

Original: When P test ( x, y ) ̸
Revised: When P test ( x, y ) ̸

Original: = P train ( x, y ) (the input/output space X / Y is consistent between training and test data), f { θ 0 ,a 0 } may perform poorly on D test .
Revised: = P train ( x, y ) (the input/output space X / Y is consistent between training and test data), f { θ 0 ,a 0 } may perform poorly on D test .

Original: Under fully test-time adaptation scheme (Wang et al., 2021), during inference step t ≥ 1 , the model f { θ t − 1 ,a t − 1 } receives a mini-batch of test data { x m t + b } B b =1 with B batch size ( m t is the number of test samples observed before inference step t ), and then elevates itself to f { θ t ,a t } based on current test mini-batch and outputs the real-time predictions { p m t
Revised: Under fully test-time adaptation scheme (Wang et al., 2021), during inference step t ≥ 1 , the model f { θ t − 1 ,a t − 1 } receives a mini-batch of test data { x m t + b } B b =1 with B batch size ( m t is the number of test samples observed before inference step t ), and then elevates itself to f { θ t ,a t } based on current test mini-batch and outputs the real-time predictions { p m t

Original: + b } Bb =1 ( p ∈ R K ).
Revised: + b } Bb =1 ( p ∈ R K ).

Original: Finally, the evaluation metric is calculated based on the online predictions from each inference step.
Revised: Finally, the evaluation metric is calculated based on the online predictions from each inference step.

Original: Fully test-time adaptation emphasizes performing adaptation during real-time inference entirely, i.e. , the training process cannot be interrupted, the training data is no longer available during test, and the adaptation should be accomplished in a single pass over the test stream.
Revised: Fully test-time adaptation emphasizes performing adaptation during real-time inference entirely, i.e. , the training process cannot be interrupted, the training data is no longer available during test, and the adaptation should be accomplished in a single pass over the test stream.

Original: The most common hypothesis is that D test is independently sampled from P test ( x, y ) .
Revised: The most common hypothesis is that D test is independently sampled from P test ( x, y ) .

Original: However, in real environment, the assumption does not always hold, e.g. , samples of some classes may appear more frequently in a certain period of time, leading to another hypothesis: the test samples are dependently sampled.
Revised: However, in real environment, the assumption does not always hold, e.g. , samples of some classes may appear more frequently in a certain period of time, leading to another hypothesis: the test samples are dependently sampled.

Original: Most studies only considered the scenario with class-balanced test samples, while in real-world, the test stream can be class-imbalanced 1 .
Revised: Most studies only considered the scenario with class-balanced test samples, while in real-world, the test stream can be class-imbalanced 1 .

Original: We investigate fully test-time adaptation under the four scenarios below, considering the latent sampling strategies and the test class distribution.
Revised: We investigate fully test-time adaptation under the four scenarios below, considering the latent sampling strategies and the test class distribution.

Original: For convenience, we denote the scenario where test samples are independently/dependently sampled from a class-balanced test distribution as IS+CB / DS+CB; denote the scenario where test samples are independently/dependently sampled from a class-imbalanced test distribution as IS+CI/
Revised: For convenience, we denote the scenario where test samples are independently/dependently sampled from a class-balanced test distribution as IS+CB / DS+CB; denote the scenario where test samples are independently/dependently sampled from a class-imbalanced test distribution as IS+CI/

Original: DS+CI, as shown in Figure 1.
Revised: DS+CI, as shown in Figure 1.

Original: Among them, IS+CB is the most common scenario within FTTA studies, and the other three scenarios also frequently appear in real-world applications.
Revised: Among them, IS+CB is the most common scenario within FTTA studies, and the other three scenarios also frequently appear in real-world applications.

Original: 3. A CLOSER LOOK AT NORMALIZATION STATISTICS
Revised: 3. A CLOSER LOOK AT NORMALIZATION STATISTICS

Original: We revisit BN (Ioffe & Szegedy, 2015) briefly.
Revised: We revisit BN (Ioffe & Szegedy, 2015) briefly.

Original: Let v ∈ R B × C × S × S
Revised: Let v ∈ R B × C × S × S

Original: be a mini-batch of features with C channels, height S and width S ′ .
Revised: be a mini-batch of features with C channels, height S and width S ′ .

Original: BN normalizes v with the normalization statistics µ, σ ∈ R C : v ∗ = v − µσ , v ⋆ = γ · v ∗ + β , where γ, β ∈ R C are the learnable affine parameters, { γ, β } ⊂ θ .
Revised: BN normalizes v with the normalization statistics µ, σ ∈ R C : v ∗ = v − µσ , v ⋆ = γ · v ∗ + β , where γ, β ∈ R C are the learnable affine parameters, { γ, β } ⊂ θ .

Original: We mainly focus on the first part v → v ∗ (all the discussed normalization methods adopt the affine parameters).
Revised: We mainly focus on the first part v → v ∗ (all the discussed normalization methods adopt the affine parameters).

Original: In BN, during training, µ, σ are set to the empirical mean µ batch and standard deviation σ batch calculated for each channel c : µ batch [ c ] =
Revised: In BN, during training, µ, σ are set to the empirical mean µ batch and standard deviation σ batch calculated for each channel c : µ batch [ c ] =

Original: [Equation]
Revised: [Equation]

Original: σ
Revised: σ

Original: [Equation]

Original: [Equation]
Revised: [Equation]

Original: ) 2 + ϵ , where ϵ is a small value to avoid division by zero.
Revised: 2 + ϵ , where ϵ is a small value to avoid division by zero.

Original: During inference, µ, σ are set to µ ema , σ ema which are the exponential-moving-average (EMA) estimates over training process ( a 0 is formed by the EMA statistics of all BN modules).
Revised: During inference, µ, σ are set to µ ema , σ ema which are the exponential-moving-average (EMA) estimates over training process ( a 0 is formed by the EMA statistics of all BN modules).

Original: However, when P test ( x, y ) ̸
Revised: However, when P test ( x, y ) ̸

Original: = P train ( x, y ) , studies found that replacing µ ema , σ ema with the statistics of the test mini-batch: ˆ µ batch , ˆ σ batch can improve model accuracy (Nado et al., 2020) (for clarify, statistics estimated on test samples are denoted with ‘ ˆ ’).
Revised: = P train ( x, y ) , studies found that replacing µ ema , σ ema with the statistics of the test mini-batch: ˆ µ batch , ˆ σ batch can improve model accuracy (Nado et al., 2020) (for clarify, statistics estimated on test samples are denoted with ‘ ˆ ’).

Original: The method is also marked as “BN adapt” (Schneider et al., 2020).
Revised: The method is also marked as “BN adapt” (Schneider et al., 2020).

Original: [Figure]
Revised: [Figure]

Original:  in different scenarios on CIFAR100-C.
Revised: statistics in different scenarios on CIFAR100-C.

Original: Diagnosis I: Normalization statistics are inaccurate within each test mini-batch.
Revised: Diagnosis I: Normalization statistics are inaccurate within each test mini-batch.

Original: We conduct experiments on CIFAR100-C. From Figure 2 we can see that the statistics ˆ µ batch , ˆ σ batch used in BN adapt fluctuate dramatically during adaptation, and are inaccurate in most test mini-batches.
Revised: We conduct experiments on CIFAR100-C. From Figure 2 we can see that the statistics ˆ µ batch , ˆ σ batch used in BN adapt fluctuate dramatically during adaptation, and are inaccurate in most test mini-batches.

Original: It should be noted that for BN adapt, predictions are made online based on real-time statistics, so poor estimates can have a negative impact on performance.
Revised: It should be noted that for BN adapt, predictions are made online based on real-time statistics, so poor estimates can have a negative impact on performance.

Original: More seriously, the estimates in the DS+CB scenario are worse.
Revised: More seriously, the estimates in the DS+CB scenario are worse.

Original: In Table 2, though BN adapt and TENT can improve accuracy compared to Source (test with the fixed pre-trained model f { θ 0 ,a 0 } ) in IS+CB scenario, they suffer from degradation in the DS+CB cases.
Revised: In Table 2, though BN adapt and TENT can improve accuracy compared to Source (test with the fixed pre-trained model f { θ 0 ,a 0 } ) in IS+CB scenario, they suffer from degradation in the DS+CB cases.

Original: Overall, we can see that the poor statistics severely impede test-time adaptation because they are derived solely from the current small mini-batch.
Revised: Overall, we can see that the poor statistics severely impede test-time adaptation because they are derived solely from the current small mini-batch.

Revised: [Table]

Original: Treatment I: Test-time batch renormalization (TBR) is a simple and powerful tool to improve the normalization.
Revised: Treatment I: Test-time batch renormalization (TBR) is a simple and powerful tool to improve the normalization.

Original: It is natural to simply employ the test-time moving averages ˆ µ ema , ˆ σ ema to perform normalization during adaptation, referring to as TEMA, where ˆ µ ema t= α · ˆ µ
Revised: It is natural to simply employ the test-time moving averages ˆ µ ema , ˆ σ ema to perform normalization during adaptation, referring to as TEMA, where ˆ µ ema t

Original: [Equation]
Revised: [Equation]

Original: + (1 − [Equation] ) · sg (ˆ µ batch t ) , ˆ σ ema t = α · ˆ σ ema t − 1 +(1 − α ) · sg (ˆ σ batch t ) , sg ( · ) stands for the operation of stopping gradient, e.g. , the Tensor.detach() function in PyTorch, α is a smoothing coefficient.
Revised: sg ( · ) stands for the operation of stopping gradient, e.g. , the Tensor.detach() function in PyTorch, α is a smoothing coef- ficient.

Original: TEMA can consistently improve BN adapt: the normalization statistics in Figure 2 become more stable and accurate, and the test accuracy in Table 2 is improved as well.
Revised: TEMA can consistently improve BN adapt: the normalization statistics in Figure 2 become more stable and accurate, and the test accuracy in Table 2 is improved as well.

Original: However, for TENT which involves parameters update, TEMA can destroy the trained model as shown in Table 2.
Revised: However, for TENT which involves parameters update, TEMA can destroy the trained model as shown in Table 2.

Original: As discussed in Ioffe & Szegedy (2015), simply employing the moving averagesy ) is skewed, some techniques are commonly used to bring the model closer to the one trained on balanced data, such as on YTBB-sub (Section 4), where the trained model is learned with logit adjustment on class-imbalanced training data. [Table] [Table] would neutralize the effects of gradient optimization and normalization, as the gradient descent optimization does not consider the normalization, leading to unlimited growth of model parameters.
Revised: As discussed in Ioffe & Szegedy (2015), simply employing the moving averages would neutralize the effects of gradient optimization and normalization, as the gradient descent optimization does not consider the normalization, leading to unlimited growth of model parameters.

Original: Thus, we introduce batch renormalization (Ioffe, 2017) into test-time adaptation, leading to TBR, which is formulated by
Revised: Thus, we introduce batch renormalization (Ioffe, 2017) into test-time adaptation, leading to TBR, which is formulated by

Original: [Equation]
Revised: [Equation]

Original: We present a detailed algorithm description in Appendix A.2.
Revised: We present a detailed algorithm description in Appendix A.2.

Original: Different from BN adapt, we use the test-time moving averages to rectify the normalization (through r and d ).
Revised: Different from BN adapt, we use the test-time moving averages to rectify the normalization (through r and d ).

Original: Different from the TEMA,
Revised: Different from the TEMA,

Original: TBR is well compatible with gradient-based adaptation methods ( e.g. , TENT) and can improve them as summarised in Table 2.
Revised: TBR is well compatible with gradient-based adaptation methods ( e.g. , TENT) and can improve them as summarised in Table 2.

Original: For BN adapt, TEMA is equal to TBR.
Revised: For BN adapt, TEMA is equal to TBR.

Original: Different from the original batch renormalization used in the training phase, TBR is employed in the inference phase which uses the statistics and moving averages derived from test batches.
Revised: Different from the original batch renormalization used in the training phase, TBR is employed in the inference phase which uses the statistics and moving averages derived from test batches.

Original: Besides, as the adaptation starts with a trained model f { θ 0 ,a 0 } , TBR discards the warm-up and truncation operation to r and d , thus does not introduce additional hyper-parameters.
Revised: Besides, as the adaptation starts with a trained model f { θ 0 ,a 0 } , TBR discards the warm-up and truncation operation to r and d , thus does not introduce additional hyper-parameters.

Original: TBR can be applied directly to a common pre-trained model with BN without requiring the model to be trained with such calibrated normalization.
Revised: TBR can be applied directly to a common pre-trained model with BN without requiring the model to be trained with such calibrated normalization.

Original: 3. A CLOSER LOOK AT TEST - TIME PARAMETER OPTIMIZATION
Revised: 3. A CLOSER LOOK AT TEST - TIME PARAMETER OPTIMIZATION

Revised: [Figure]

Original: Building on BN adapt, TENT (Wang et al., 2021) further optimizes the affine parameters γ, β through entropy minimization and demonstrates that test-time parameter optimization can yield better results compared to employing BN adapt alone.
Revised: [Figure] [Table] [Figure] [Table]

Revised: [Figure]

Revised: [Table]

Revised: [Figure]

Revised: [Table]

Revised: [Figure]

Revised: [Table]

Revised: [Figure]

Revised: [Table]

Revised: [Figure]

Revised: [Table]

Revised: [Figure]

Revised: [Table]

Revised: [Figure]

Revised: [Table]

Revised: [Figure]

Revised: [Table]

Revised: [Figure]

Revised: [Table]

Revised: [Figure]

Revised: [Table]

Revised: [Figure]

Revised: [Table]

Revised: [Figure]

Revised: [Table]

Revised: [Figure]

Revised: [Table]

Revised: [Figure]

Revised: [Table]

Revised: [Figure]

Revised: [Table]

Revised: [Figure]

Revised: [Table]

Revised: [Figure]

Revised: [Table]

Revised: [Figure]

Revised: [Table]

Revised: [Figure]

Revised: [Table]

Revised: [Figure]

Revised: [Table]

Revised: [Figure]

Revised: [Table]

Revised: [Figure]

Revised: Building on BN adapt, TENT (Wang et al., 2021) further optimizes the affine parameters γ, β through entropy minimization and shows that test-time parameter optimization can yield better results compared to employing BN adapt alone.

Original: We further take a closer look at this procedure.
Revised: We further take a closer look at this procedure

Revised: [Figure]

Original: Diagnosis II: the test-time optimization is biased towards dominant classes.
Revised: Diagnosis II: the test-time optimization is biased towards dominant classes.

Original: We evaluate the model on IS+CB and DS+CB gaussian-noise-corrupted test data (Gauss) of CIFAR100-C. We also[Figure] test the model on the original clean test set of CIFAR100 for comparison.
Revised: We evaluate the model on IS+CB and DS+CB gaussian-noise-corrupted test data (Gauss) of CIFAR100-C. We also test the model on the original clean test set of CIFAR100 for comparison.

Original: Figure 3 depicts the per-class number of predictions, while Table 3 shows the corresponding standard deviation, range (maximum subtract minimum), and accuracy.
Revised: Figure 3 depicts the per-class number of predictions, while Table 3 shows the corresponding standard deviation, range (maximum subtract minimum), and accuracy.

Original: We draw the following five conclusions.
Revised: We draw the following five conclusions

Original: • Predictions are imbalanced, even for a model trained on class-balanced training data and tested on a class-balanced test set with P test ( x, y )
Revised: • Predictions are imbalanced, even for a model trained on class-balanced training data and tested on a class-balanced test set with P test ( x, y )

Original: =
Revised: =

Original: P train ( x, y ) : the “clean” curve in Figure 3 (left) with standard deviation 8.3 and range 46.
Revised: P train ( x, y ) : the “clean” curve in Figure 3 (left) with standard deviation 8.3 and range 46.

Original: This phenomenon is also studied in Wang et al.
Revised: This phenomenon is also studied in Wang et al.

Original: (2022b).
Revised: (2022b).

Original: • Predictions becomes more imbalanced when P test ( x, y ) ̸
Revised: • Predictions becomes more imbalanced when P test ( x, y ) ̸

Original: = P train ( x, y ) as shown in Figure 3 (left): the ranges are 46 and 956 on the clean and corrupted test set respectively.
Revised: = P train ( x, y ) as shown in Figure 3 (left): the ranges are 46 and 956 on the clean and corrupted test set respectively.

Original: • BN adapt+TEMA improves accuracy (from 27.0% to 58.0%) and alleviates the prediction imbalance at the same time (the range dropped from 956 to 118).
Revised: • BN adapt+TEMA improves accuracy (from 27.0% to 58.0%) and alleviates the prediction imbalance at the same time (the range dropped from 956 to 121.6).

Original: • Though accuracy is further improved with TENT+TBR (from 58.0% to 62.1%), the predictions become more imbalanced inversely (the range changed from 118 to 266).
Revised: • Though accuracy is further improved with TENT+TBR (from 58.0% to 62.2%), the predictions become more imbalanced inversely (the range changed from 121.6 to 269.8).

Original: The entropy minimization loss focuses on data with low entropy, while samples of some classes may have relatively lower entropy owing to the trained model, thus TENT would aggravate the prediction imbalance.
Revised: The entropy minimization loss focuses on data with low entropy, while samples of some classes may have relatively lower entropy owing to the trained model, thus TENT would aggravate the prediction imbalance.

Original: • On dependent test streams, not only the model accuracy drops, but also the predictions become more imbalanced (range 266 / range 520 on independent/dependent samples for TENT+TBR), as the model may be absolutely dominated by some classes over a period of time in DS+CB scenario.
Revised: • On dependent test streams, not only the model accuracy drops, but also the predictions become more imbalanced (range 269.8 / range 469.2 on independent/dependent samples for TENT+TBR), as the model may be absolutely dominated by some classes over a period of time in DS+CB scenario.

Original: [Table]
Revised: [Table]

Original: The imbalanced data is harmful during the normal training phase, resulting in biased models and poor overall accuracy (Liu et al., 2019; Menon et al., 2021).
Revised: The imbalanced data is harmful during the normal training phase, resulting in biased models and poor overall accuracy (Liu et al., 2019; Menon et al., 2021).

Original: Our main motivation is that the test-time adaptation methods also involve gradient-based optimization which is built on the model predictions; however, the predictions are actually imbalanced, particularly for dependent or class-imbalanced streams and the low-entropy-emphasized adaptation methods.
Revised: Our main motivation is that the test-time adaptation methods also involve gradient-based optimization which is built on the model predictions; however, the predictions are actually imbalanced, particularly for dependent or class-imbalanced streams and the low-entropy-emphasized adaptation methods.

Original: Therefore, we argue that the test-time optimization is biased towards some dominant classes actually, resulting in inferior performance.
Revised: Therefore, we argue that the test-time optimization is biased towards some dominant classes actually, resulting in inferior performance.

Original: A vicious circle is formed by skewed optimization and imbalanced predictions.
Revised: A vicious circle is formed by skewed optimization and imbalanced predictions.

Original: Treatment II: Dynamic online re-weighting (DOT) can alleviate the biased optimization.
Revised: Treatment II: Dynamic online re-weighting (DOT) can alleviate the biased optimization.

Original: Many methods have been developed to deal with class imbalance during the training phase, but they face several challenges when it comes to fully test-time adaptation: (i) Network architectures are immutable.
Revised: Many methods have been developed to deal with class imbalance during the training phase, but they face several challenges when it comes to fully test-time adaptation: (i) Network architectures are immutable.

Original: (ii) Because test sample class frequencies are dynamic and agnostic, the common constraint of making the output distribution uniform Liang et al. (2020) is no longer reasonable.
Revised: (ii) Because test sample class frequencies are dynamic and agnostic, the common constraint of making the output distribution uniform (Liang et al., 2020) is no longer reasonable.

Original: (iii) Inference and adaptation must occur in real-time when test mini-batch arrived (only a single pass through test data, no iterative learning).
Revised: (iii) Inference and adaptation must occur in real-time when test mini-batch arrived (only a single pass through test data, no iterative learning).

Original: Given these constraints, we propose DOT as presented in Algorithm 1.
Revised: Given these constraints, we propose DOT as presented in Algorithm 1.

Original: DOT is mainly derived from class-wise re-weighting (Cui et al., 2019).
Revised: DOT is mainly derived from class-wise re-weighting (Cui et al., 2019).

Original: To tackle the dynamically changing and unknown class frequencies, we use a momentum-updated class-frequency vector z ∈ R K instead (Lineof Algorithm 1), which is initiated with z [ k ] = 1 K , k = 1 , 2 , · · · , K .
Revised: To tackle the dynamically changing and unknown class frequencies, we use a momentum-updated class-frequency vector z ∈ R K instead (Lineof Algorithm 1), which is initiated with z [ k ] = 1 K , k = 1 , 2 , · · · , K .

Original: For each inference step, we assign weights to each test sample based on its pseudo label and the current z (Line 5,6 of
Revised: For each inference step, we assign weights to each test sample based on its pseudo label and the current z (Line 5,6 of

Original: Algorithm 1).
Revised: Algorithm 1).

Original: Specifically, when z [ k ] is relatively large, during the subsequent adaptation, DOT will reduce the contributions of the k th class samples (pseudo label) and emphasize others.
Revised: Specifically, when z [ k ] is relatively large, during the subsequent adaptation, DOT will reduce the contributions of the k th class samples (pseudo label) and emphasize others.

Original: It is worth noting that DOT can alleviate the biased optimization caused by the pre-trained model ( e.g. , inter-class similarity), test stream ( e.g. , class-imbalanced scenario) simultaneously.
Revised: It is worth noting that DOT can alleviate the biased optimization caused by the pre-trained model ( e.g. , inter-class similarity), test stream ( e.g. , class-imbalanced scenario) simultaneously.

Original: DOT is a general idea to tackle the biased optimization, some parts in Algorithm 1 have multiple options, so it can be combined with different existing test-time adaptation techniques.
Revised: DOT is a general idea to tackle the biased optimization, some parts in Algorithm 1 have multiple options, so it can be combined with different existing test-time adaptation techniques.

Original: For the “Forward ( · )” function (Line 3 of Algorithm 1), the discussed BN adapt and TBR can be incorporated.
Revised: For the “Forward ( · )” function (Line 3 of Algorithm 1), the discussed BN adapt and TBR can be incorporated.

Original: For the loss function L ( · ) (Line 8 of Algorithm 1), studies usually employ the entropy minimization loss: L ( p b )
Revised: For the loss function L ( · ) (Line 8 of Algorithm 1), studies usually employ the entropy minimization loss: L ( p b )

Original: = − (cid:80)
Revised: = − (cid:80)

Original: Kk =1 p b [ k ] log p b [ k ] or the cross-entropy loss with pseudo labels:
Revised: Kk =1 p b [ k ] log p b [ k ] or the cross-entropy loss with pseudo labels:

Original: L ( p b ) = − I p
Revised: L ( p b ) = − I p

Original: b
Revised: b

Original: [ k ∗ b ] ≥ τ · log p b [ k ∗ b ] (commonly, only samples with high prediction confidence are utilized, τ is a pre-defined threshold).
Revised: [ k ∗ b ] ≥ τ · log p b [ k ∗ b ] (commonly, only samples with high prediction confidence are utilized, τ is a pre-defined threshold).

Original: Similarly, for entropy minimization, EntW (Niu et al., 2022) also discard the high-entropy samples and emphasizes the low-entropy ones:
Revised: Similarly, for entropy minimization, EntW (Niu et al., 2022) also discard the high-entropy samples and emphasizes the low-entropy ones:

Original: L ( p b ) = − I
Revised: L ( p b ) = − I

Original: H b <τ · e τ − H b · (cid:80) Kk =1 p b
Revised: H b <τ · e τ − H b · (cid:80) Kk =1 p b

Original: [ k ] log p b [ k ] , where H b is the entropy of sample x b .
Revised: [ k ] log p b [ k ] , where H b is the entropy of sample x b .

Original:  EXPERIMENTS
Revised:  EXPERIMENTS

Original: Datasets and models.
Revised: Datasets and models.

Original: We conduct experiments on common datasets CIFAR100-C, ImageNetC (Hendrycks & Dietterich, 2019),
Revised: We conduct experiments on common datasets CIFAR100-C, ImageNetC (Hendrycks & Dietterich, 2019),

Original: ImageNet-R (Hendrycks et al., 2021), and a newly introduced video (segments) dataset: the subset of YouTube-BoundingBoxes (YTBB-sub) (Real et al., 2017).
Revised: ImageNet-R (Hendrycks et al., 2021), and a newly introduced video (segments) dataset: the subset of YouTube-BoundingBoxes (YTBB-sub) (Real et al., 2017).

Original: CIFAR100-C / ImageNet-C contains 15 corruption types, each with 5 severity levels; we use the highest level unless otherwise specified.
Revised: CIFAR100-C / ImageNet-C contains 15 corruption types, each with 5 severity levels; we use the highest level unless otherwise specified.

Original: ImageNet-R contains various styles ( e.g. , paintings) of ImageNet categories.
Revised: ImageNet-R contains various styles ( e.g. , paintings) of ImageNet categories.

Original: Following Wang et al.
Revised: Following Wang et al.

Original: (2022a);
Revised: (2022a);

Original: Niu et al.
Revised: Niu et al.

Original: (2022), for evaluations on CIFAR100-C, we adopt the trained ResNeXt-29 (Xie et al., 2017) model from Hendrycks et al.
Revised: (2022), for evaluations on CIFAR100-C, we adopt the trained ResNeXt-29 (Xie et al., 2017) model from Hendrycks et al.

Original: (2020) as f { θ 0 ,a 0 } ; for ImageNet-C / -R, we use the trained ResNet-50 model from Torchvision.
Revised: (2020) as f { θ 0 ,a 0 } ; for ImageNet-C / -R, we use the trained ResNet-50 model from Torchvision.

Original: The models are trained on the corresponding original training data.
Revised: The models are trained on the corresponding original training data.

Original: For YTBB-sub, we use the ResNet-18 trained on the related images of COCO.
Revised: For YTBB-sub, we use a ResNet-18 trained on the related images of COCO.

Original: Details of the tasks, datasets and examples are provided in Appendix A.
Revised: Details of the tasks, datasets and examples are provided in Appendix A.

Original: Metrics.
Revised: Metrics.

Original: Unless otherwise specified, we report the mean accuracy over classes (Acc, %) (Liu et al., 2019); results are averaged over 15 different corruption types for CIFAR100-C and ImageNet-C in the main text, please see detailed performance on each corruption type in Appendix A.5, A.6.
Revised: Unless otherwise specified, we report the mean accuracy over classes (Acc, %) (Liu et al., 2019); results are averaged over 15 different corruption types for CIFAR100-C and ImageNet-C in the main text, please see detailed performance on each corruption type in Appendix A.5, A.6.

Original: Implementation.
Revised: Implementation.

Original: The configurations are mainly followed previous work Wang et al.
Revised: The configurations are mainly followed previous work Wang et al.

Original: (2021; 2022a);
Revised: (2021; 2022a);

Original: Niu et al.
Revised: Niu et al.

Original: (2022) for comparison, details are listed in Appendix A.3.
Revised: (2022) for comparison, details are listed in Appendix A.3.

Original: Code will be available online.
Revised: Code will be available online.

Original: [Table]
Revised: [Table]

Original: Baselines.
Revised: Baselines.

Original: We adopt the following SOTA methods as baselines: pseudo label (PL) (Lee et al., 2013), test-time augmentation (TTA) (Ashukha et al., 2020), BN adaptation (BN adapt) (Schneider et al., 2020; Nado et al., 2020), test-time entropy minimization (TENT) (Wang et al., 2021), marginal entropy minimization with one test point (MEMO)
Revised: We adopt the following SOTA methods as baselines: pseudo label (PL) (Lee et al., 2013), test-time augmentation (TTA) (Ashukha et al., 2020), BN adaptation (BN adapt) (Schneider et al., 2020; Nado et al., 2020), test-time entropy minimization (TENT) (Wang et al., 2021), marginal entropy minimization with one test point (MEMO)

Original: (Zhang et al., 2021), efficient test-time adaptation (ETA) (Niu et al., 2022), entropy-based weighting (Ent-W) (Niu et al., 2022), laplacian adjusted maximum-likelihood estimation (LAME) (Boudiaf et al., 2022), continual test-time adaptation (CoTTA/CoTTA*: w/wo resetting) (Wang et al., 2022a).
Revised: (Zhang et al., 2021), efficient test-time adaptation (ETA) (Niu et al., 2022), entropy-based weighting (Ent-W) (Niu et al., 2022), laplacian adjusted maximum-likelihood estimation (LAME) (Boudiaf et al., 2022), continual test-time adaptation (CoTTA/CoTTA*: w/wo resetting) (Wang et al., 2022a).

Original: We combine DELTA with
Revised: We combine DELTA with

Original: PL, TENT, and Ent-W in this work.
Revised: PL, TENT, and Ent-W in this work.

Original: Evaluation in IS+CB scenario.
Revised: Evaluation in IS+CB scenario.

Original: The results on CIFAR100-C are reported in Table 4.
Revised: The results on CIFAR100-C are reported in Table 4.

Original: As can be seen, the proposed DELTA consistently improves the previous adaptation approaches PL (gain 0.7%), TENT (gain 0.8%), and Ent-W (gain 0.8%), achieving new state-of-the-art performance.
Revised: As can be seen, the proposed DELTA consistently improves the previous adaptation approaches PL (gain 0.7%), TENT (gain 0.8%), and Ent-W (gain 0.8%), achieving new state-of-the-art performance.

Original: The results also indicate that current test-time adaptation methods indeed suffer from the discussed drawbacks, and the proposed methods can help them obtain superior performance.
Revised: The results also indicate that current test-time adaptation methods indeed suffer from the discussed drawbacks, and the proposed methods can help them obtain superior performance.

Original: Then we evaluate the methods on the more challenging dataset ImageNet-C. Consistent with the results on CIFAR100C, DELTA remarkably improves the existing methods.
Revised: Then we evaluate the methods on the more challenging dataset ImageNet-C. Consistent with the results on CIFAR100C, DELTA remarkably improves the existing methods.

Original: As the adaptation batch size (64) is too small compared to the class number (1,000) on ImageNet-C, the previous methods undergo more severe damage than on CIFAR100-C. Consequently, DELTA achieves greater gains on ImageNet-C: 1.6% gain over PL, 2.4% gain over TENT, and 5.6% gain over Ent-W.
Revised: As the adaptation batch size (64) is too small compared to the class number (1,000) on ImageNet-C, the previous methods undergo more severe damage than on CIFAR100-C. Consequently, DELTA achieves greater gains on ImageNet-C: 1.6% gain over PL, 2.4% gain over TENT, and 5.6% gain over Ent-W.

Original: [Table]
Revised: [Table]

Original: Evaluation in DS+CB scenario.
Revised: Evaluation in DS+CB scenario.

Original: To simulate dependent streams, following Yurochkin et al.
Revised: To simulate dependent streams, following Yurochkin et al.

Original: (2019), we arrange the samples via the Dirichlet distribution with a concentration factor ρ > 0 (the smaller ρ is, the more concentrated the same-class samples will be, which is detailed in Appendix A.1).
Revised: (2019), we arrange the samples via the Dirichlet distribution with a concentration factor ρ > 0 (the smaller ρ is, the more concentrated the same-class samples will be, which is detailed in Appendix A.1).

Original: We test models with ρ ∈ { 1 . 0 , 0 . 5 , 0 . 1 } .
Revised: We test models with ρ ∈ { 1 . 0 , 0 . 5 , 0 . 1 } .

Original: The experimental results are provided in Table 5 (we provide the results of more extreme cases with ρ = 0 .
Revised: The experimental results are provided in Table 5 (we provide the results of more extreme cases with ρ = 0 .

Original: 01 in Appendix A.4).
Revised: 01 in Appendix A.4).

Original: The representative test-time adaptation methods suffer from performance degradation in the dependent scenario, especially on data sampled with small ρ .
Revised: The representative test-time adaptation methods suffer from performance degradation in the dependent scenario, especially on data sampled with small ρ .

Original: DELTA successfully helps models adapt to environments across different concentration factors.
Revised: DELTA successfully helps models adapt to environments across different concentration factors.

Original: It is worth noting that DELTA’s
Revised: It is worth noting that DELTA’s

Original: DS+CB results are close to the IS+CB results, e.g. , TENT+DELTA achieves 69.5% and 68.5% accuracy on IS+CB and DS+CB ( ρ = 0.5) test streams from CIFAR100-C.
Revised: DS+CB results are close to the IS+CB results, e.g. , TENT+DELTA achieves 69.5% and 68.5% accuracy on IS+CB and DS+CB ( ρ = 0.5) test streams from CIFAR100-C.

Original: Evaluation in IS+CI and DS+CI scenarios.
Revised: Evaluation in IS+CI and DS+CI scenarios.

Original: Following Cui et al.
Revised: Following Cui et al.

Original: (2019), we resample the test samples with an imbalance factor π (the smaller π is, the more imbalanced the test data will be,
Revised: (2019), we resample the test samples with an imbalance factor π (the smaller π is, the more imbalanced the test data will be,

Original: [Table] [Table]
Revised: [Table] [Table]

Original: [Figure]
Revised: [Figure]

Original: which is detailed in Appendix A.1)
Revised: which is detailed in Appendix A.1)

Original: We test models with π ∈ { 0 . 1 , 0 . 05 } (similarly, we show the extreme experiments with π = 0 .
Revised: We test models with π ∈ { 0 . 1 , 0 . 05 } (similarly, we show the extreme experiments with π = 0 .

Original: 001 in Appendix A.4).
Revised: 001 in Appendix A.4).

Original: Table 6 summarizes the results in IS+CI and DS+CI scenarios, with the following observations: (i) Under class-imbalanced scenario, the performance degradation is not as severe as under dependent data.
Revised: Table 6 summarizes the results in IS+CI and DS+CI scenarios, with the following observations: (i) Under class-imbalanced scenario, the performance degradation is not as severe as under dependent data.

Original: This is primarily because the imbalanced test data has relatively little effect on the normalization statistics.
Revised: This is primarily because the imbalanced test data has relatively little effect on the normalization statistics.

Original: DELTA works well on the imbalanced test stream.
Revised: DELTA works well on the imbalanced test stream.

Original: (ii)
Revised: (ii)

Original: The hybrid DS+CI scenario can be more difficult than the individual scenarios.
Revised: The hybrid DS+CI scenario can be more difficult than the individual scenarios.

Original: DELTA can also boost baselines in the hybrid scenario.
Revised: DELTA can also boost baselines in the hybrid scenario.

Original: (iii)
Revised: (iii)

Original: Though the low-entropyemphasized method Ent-W improves TENT in IS+CB scenario (Table 4), it can be inferior to TENT in dependent or class-imbalanced scenarios (the results on ImageNet-C in Table 5,6).
Revised: Though the low-entropyemphasized method Ent-W improves TENT in IS+CB scenario (Table 4), it can be inferior to TENT in dependent or class-imbalanced scenarios (the results on ImageNet-C in Table 5,6).

Original: The reason is that Ent-W leads to a side effect — amplifying the class bias, which would neutralize or even overwhelm its benefits.
Revised: The reason is that Ent-W leads to a side effect — amplifying the class bias, which would neutralize or even overwhelm its benefits.

Original: DELTA eliminates Ent-W’s side effects while retaining its benefits, so EntW+DELTA always significantly outperforms TENT+DELTA.
Revised: DELTA eliminates Ent-W’s side effects while retaining its benefits, so EntW+DELTA always significantly outperforms TENT+DELTA.

Original: [Table]
Revised: [Table]

Original: Evaluation on realistic out-of-distribution datasets ImageNet-R and YTBB-sub.
Revised: Evaluation on realistic out-of-distribution datasets ImageNet-R and YTBB-sub.

Original: ImageNet-R is inherently class-imbalanced and consists of mixed variants such as cartoon, art, painting, sketch, toy, etc.
Revised: ImageNet-R is inherently class-imbalanced and consists of mixed variants such as cartoon, art, painting, sketch, toy, etc.

Original: As shown in Table 8, DELTA also leads to consistent improvement on it.
Revised: As shown in Table 8, DELTA also leads to consistent improvement on it.

Original: While compared to ImageNet-C, ImageNet-R is collected individually, which consists of more hard cases that are still difficult to recognize for DELTA, the gain is not as great as on
Revised: While compared to ImageNet-C, ImageNet-R is collected individually, which consists of more hard cases that are still difficult to recognize for DELTA, the gain is not as great as on

Original: ImageNet-C. For YTBB-sub, dependent and class-imbalanced samples are encountered naturally.
Revised: ImageNet-C. For YTBB-sub, dependent and class-imbalanced samples are encountered naturally.

Original: We see that classical methods suffer from severe degradation, whereas DELTA assists them in achieving good performance.
Revised: We see that classical methods suffer from severe degradation, whereas DELTA assists them in achieving good performance.

Original: Evaluation on in-distribution test data.
Revised: Evaluation on in-distribution test data.

Original: A qualified FTTA method should be “safe” on indistribution datasets, i.e. , P test ( x, y )
Revised: A qualified FTTA method should be “safe” on indistribution datasets, i.e. , P test ( x, y )

Original: =
Revised: =

Original: P train ( x, y ) .
Revised: P train ( x, y ) .

Original: According to Table 7, (i) DELTA continues to improve performance, albeit slightly; (ii) most adaptation methods can produce comparable results to Source, and the combination with DELTA even outperforms Source on in-distribution data.
Revised: According to Table 7, (i) DELTA continues to improve performance, albeit slightly; (ii) most adaptation methods can produce comparable results to Source, and the combination with DELTA even outperforms Source on in-distribution data.

Original: Evaluation with different architectures.
Revised: Evaluation with different architectures.

Original: Figure 4 indicates that DELTA can help improve previous test-time adaptation methods with different model architectures.
Revised: Figure 4 indicates that DELTA can help improve previous test-time adaptation methods with different model architectures.

Original: More analyses ( e.g. , evaluations with small batch size, different severity levels) are provided in Appendix A.4.
Revised: More analyses ( e.g. , evaluations with small batch size, different severity levels) are provided in Appendix A.4.

Original: Contribution of each component of DELTA.
Revised: Contribution of each component of DELTA.

Original: DELTA consists of two tools: TBR and DOT.
Revised: DELTA consists of two tools: TBR and DOT.

Original: In
Revised: In

Original: Table 9, we analyze their contributions on the basis of TENT with four scenarios and two datasets.
Revised: Table 9, we analyze their contributions on the basis of TENT with four scenarios and two datasets.

Original: Row #1 indicates the results of TENT.
Revised: Row #1 indicates the results of TENT.

Original: Applying either TBR or DOT alone on TENT brings gain in most scenarios and datasets.
Revised: Applying either TBR or DOT alone on TENT brings gain in most scenarios and datasets.

Original: While, we find that TBR achieves less improvement when the test stream is IS+CB and the batch size is large ( e.g. , performing adaptation with TBR alone on the
Revised: While, we find that TBR achieves less improvement when the test stream is IS+CB and the batch size is large ( e.g. , performing adaptation with TBR alone on the

Original: IS+CB data of CIFAR100-C with batch size of 200 does not improve TENT).
Revised: IS+CB data of CIFAR100-C with batch size of 200 does not improve TENT).

Original: However, when the batch size is relatively small ( e.g. , ImageNet-C, batch size of 64), the benefits of TBR will become apparent.
Revised: However, when the batch size is relatively small ( e.g. , ImageNet-C, batch size of 64), the benefits of TBR will become apparent.

Original: More importantly, TBR is extremely effective and necessary for dependent samples.
Revised: More importantly, TBR is extremely effective and necessary for dependent samples.

Original: [Table]
Revised: [Table]

Original:  DOT can consistently promote TENT or TENT+TBR in all scenarios, especially when the class number is large.
Revised: [Table] [Table] [Table] DOT can consistently promote TENT or TENT+TBR in all scenarios, especially when the class number is large.

Original: These results demonstrate thatwhile both the inaccurate normalization statistics and the biased optimization are detrimental, TBR and DOT can effectively alleviate them.
Revised: These results demonstrate that both the inaccurate normalization statistics and the biased optimization are detrimental, TBR and DOT can effectively alleviate them.

Original: [Table]
Revised: [Table]

Original: Comparing DOT with other techniques for class imbalance.
Revised: Comparing DOT with other techniques for class imbalance.

Original: On the basis of Ent-W+TBR, Tablecompares DOT against the following strategies for solving class imbalance.
Revised: On the basis of Ent-W+TBR, Tablecompares DOT against the following strategies for solving class imbalance.

Original: Diversity-based weight (DivW) (Niu et al., 2022) computes the cosine similarity between the arrived test samples’ prediction and a moving average one like z , then only employs the samples with low similarity to update model.
Revised: Diversity-based weight (DivW) (Niu et al., 2022) computes the cosine similarity between the arrived test samples’ prediction and a moving average one like z , then only employs the samples with low similarity to update model.

Original: Although the method is proposed to reduce redundancy, we find it can resist class imbalance too.
Revised: Although the method is proposed to reduce redundancy, we find it can resist class imbalance too.

Original: The method relies on a predefined similarity threshold to determine whether to use a sample.
Revised: The method relies on a predefined similarity threshold to determine whether to use a sample.

Original: We report the results of Div-W with varying thresholds (shown in parentheses).
Revised: We report the results of Div-W with varying thresholds (shown in parentheses).

Original: We observe that the threshold is very sensitive and the optimal value varies greatly across datasets.
Revised: We observe that the threshold is very sensitive and the optimal value varies greatly across datasets.

Original: Logit adjustment (LA) (Menon et al., 2021) shows strong performance when training on imbalanced data.
Revised: Logit adjustment (LA) (Menon et al., 2021) shows strong performance when training on imbalanced data.

Original: Following Wang et al.
Revised: Following Wang et al.

Original: (2022b)
Revised: (2022b)

Original: , we can perform LA with the estimated class-frequency vector z in test-time adaptation tasks.
Revised: , we can perform LA with the estimated class-frequency vector z in test-time adaptation tasks.

Original: While we find that LA does not show satisfactory results here.
Revised: While we find that LA does not show satisfactory results here.

Original: We speculate that this is because the estimated class distribution is not accurate under the one-pass adaptation and small batch size, while LA requires a high-quality class distribution estimate.
Revised: We speculate that this is because the estimated class distribution is not accurate under the one-pass adaptation and small batch size, while LA requires a high-quality class distribution estimate.

Original: KL divergence regularizer (KL-div) (Mummadi et al., 2021) augments loss function to encourage the predictions of test samples to be uniform.
Revised: KL divergence regularizer (KL-div) (Mummadi et al., 2021) augments loss function to encourage the predictions of test samples to be uniform.

Original: While, this is not always reasonable for TTA, e.g., for the class-imbalanced test data, forcing the outputs to be uniform will hurt the performance conversely.
Revised: While, this is not always reasonable for TTA, e.g., for the class-imbalanced test data, forcing the outputs to be uniform will hurt the performance conversely.

Original: We examine multiple regularization strength options (shown in parentheses) and report the best two.
Revised: We examine multiple regularization strength options (shown in parentheses) and report the best two.

Original: The results show that KL-div is clearly inferior in dependent or class-imbalanced scenarios.
Revised: The results show that KL-div is clearly inferior in dependent or class-imbalanced scenarios.

Original: We further propose another strategy called Sample-drop .
Revised: We further propose another strategy called Sample-drop .

Original: It records the (pseudo) categories of the test samples that have been employed, then Sample-drop will directly discard a newly arrived test sample ( i.e. , not use the sample to update the model) if its pseudo category belongs to the majority classes among the counts.
Revised: It records the (pseudo) categories of the test samples that have been employed, then Sample-drop will directly discard a newly arrived test sample ( i.e. , not use the sample to update the model) if its pseudo category belongs to the majority classes among the counts.

Original: This simple strategy is valid but inferior to DOT, as it completely drops too many useful samples.
Revised: This simple strategy is valid but inferior to DOT, as it completely drops too many useful samples.

Original: [Figure]
Revised: [Figure]

Original: Impacts of α in TBR and λ in DOT.
Revised: Impacts of α in TBR and λ in DOT.

Original: Similar to most exponential-moving-average-based methods, when the smoothing coefficient α (or λ ) is too small, the adaptation may be unstable; when α (or λ ) is too large, the adaptation would be slow.
Revised: Similar to most exponential-moving-average-based methods, when the smoothing coefficient α (or λ ) is too small, the adaptation may be unstable; when α (or λ ) is too large, the adaptation would be slow.

Original: Figure 5 provides the ablation studies of α (left) and λ (right) on the DS+CB ( ρ = 0.5) test stream of CIFAR100-C.
Revised: Figure 5 provides the ablation studies of α (left) and λ (right) on the DS+CB ( ρ = 0.5) samples of CIFAR100-C (from the validation set).

Original: We find that TBR and DOT perform reasonably well under a wide range of α and λ .
Revised: We find that TBR and DOT perform reasonably well under a wide range of α and λ .

Original:  CONCLUSION
Revised:  CONCLUSION

Original: In this paper, we expose the defects in test-time adaptation methods which cause suboptimal or even degraded performance, and propose DELTA to mitigate them.
Revised: In this paper, we expose the defects in test-time adaptation methods which cause suboptimal or even degraded performance, and propose DELTA to mitigate them.

Original: First, the normalization statistics used in BN adapt are heavily influenced by the current test mini-batch, which can be one-sided and highly fluctuant.
Revised: First, the normalization statistics used in BN adapt are heavily influenced by the current test mini-batch, which can be one-sided and highly fluctuant.

Original: We introduce TBR to improve it using the (approximate) global statistics.
Revised: We introduce TBR to improve it using the (approximate) global statistics.

Original: Second, the optimization is highly skewed towards dominant classes, making the model more biased.
Revised: Second, the optimization is highly skewed towards dominant classes, making the model more biased.

Original: DOT alleviates this problem by re-balancing the contributions of each class in an online manner.
Revised: DOT alleviates this problem by re-balancing the contributions of each class in an online manner.

Original: The combination of these two powerful tools results in our plug-in method DELTA, which achieves improvement in different scenarios (IS+CB, DS+CB, IS+CI, and DS+CI) at the same time.
Revised: The combination of these two powerful tools results in our plug-in method DELTA, which achieves improvement in different scenarios (IS+CB, DS+CB, IS+CI, and DS+CI) at the same time.

Original: A APPENDIX A. DATASETS
Revised: A APPENDIX A. DATASETS

Original: Examples of ImageNet-R and ImageNet-C are shown in Figure 6 and Figure 7 respectively.
Revised: Examples of ImageNet-R and ImageNet-C are shown in Figure 6 and Figure 7 respectively.

Original: ImageNet-R Hendrycks et al.
Revised: ImageNet-R Hendrycks et al.

Original: (2021) holds a variety of renditions ( sketches, graphics, paintings, plastic objects, cartoons, graffiti, origami, patterns, deviantart, plush objects, sculptures, art, tattoos, toys, embroidery, video game ) of 200 ImageNet classes, resulting in 30,000 images.
Revised: (2021) holds a variety of renditions ( sketches, graphics, paintings, plastic objects, cartoons, graffiti, origami, patterns, deviantart, plush objects, sculptures, art, tattoos, toys, embroidery, video game ) of 200 ImageNet classes, resulting in 30,000 images.

Original: CIFAR100-C and ImageNet-C are established in Hendrycks & Dietterich (2019).
Revised: CIFAR100-C and ImageNet-C are established in Hendrycks & Dietterich (2019).

Original: CIFAR100-C contains 10,000 images with 15 corruption types: Gaussian Noise (abbr.
Revised: CIFAR100-C contains 10,000 images with 15 corruption types: Gaussian Noise (abbr.

Original: Gauss), Shot Noise (Shot),
Revised: Gauss), Shot Noise (Shot),

Original: Impulse Noise (Impul), Defocus Blur (Defoc), Frosted Glass Blur (Glass), Motion Blur (Motion),
Revised: Impulse Noise (Impul), Defocus Blur (Defoc), Frosted Glass Blur (Glass), Motion Blur (Motion),

Original: Zoom Blur (Zoom), Snow, Frost, Fog, Brightness (Brit), Contrast (Contr), Elastic, Pixelate (Pixel),
Revised: Zoom Blur (Zoom), Snow, Frost, Fog, Brightness (Brit), Contrast (Contr), Elastic, Pixelate (Pixel),

Original: JPEG .
Revised: JPEG .

Original: There are 50,000 images for each corruption type in ImageNet-C, others are the same as
Revised: There are 50,000 images for each corruption type in ImageNet-C, others are the same as

Original: CIFAR100-C.
Revised: CIFAR100-C.

Original: For the real-word applications with dependent and class-imbalanced test samples, we consider an automatic video content moderation task (e.g., for the short-video platform), which needs to recognize the categories of interest from the extracted frames.
Revised: For the real-word applications with dependent and class-imbalanced test samples, we consider an automatic video content moderation task (e.g., for the short-video platform), which needs to recognize the categories of interest from the extracted frames.

Original: It is exactly a natural DS+CI scenario.
Revised: It is exactly a natural DS+CI scenario.

Original: We collect 1686 test videos from YouTube, which are annotated in YouTube-BoundingBoxes dataset.
Revised: We collect 1686 test videos from YouTube, which are annotated in YouTube-BoundingBoxes dataset.

Original: 49006 video segments are extracted from these videos and form the test stream in this experiment, named YTBB-sub here.
Revised: 49006 video segments are extracted from these videos and form the test stream in this experiment, named YTBB-sub here.

Original: We consider 21 categories.
Revised: We consider 21 categories.

Original: For the trained model, we adopt a model (ResNet18) trained on the related images from COCO dataset.
Revised: For the trained model, we adopt a model (ResNet18) trained on the related images from COCO dataset.

Original: Thus, there is a natural difference between the training domain and test domain.
Revised: Thus, there is a natural difference between the training domain and test domain.

Original: The consecutive video segments form the natural dependent samples (an object usually persists over several frames) as shown in Figure 8.
Revised: The consecutive video segments form the natural dependent samples (an object usually persists over several frames) as shown in Figure 8.

Original: Moreover, the test class distribution is also skewed naturally as shown in Figure 8.
Revised: Moreover, the test class distribution is also skewed naturally as shown in Figure 8.

Original: To simulate dependent test samples, for each class, we sample q k ∼ Dir J ( ρ ) , q k ∈ R J and allocate a q k,j proportion of the k th class samples to piece j , then the J pieces are concatenated to form a test stream in our experiments ( J is set to 10 for all experiments); ρ > 0 is a concentration factor, when ρ is small, samples belong to the same category will concentrate in test stream.
Revised: To simulate dependent test samples, for each class, we sample q k ∼ Dir J ( ρ ) , q k ∈ R J and allocate a q k,j proportion of the k th class samples to piece j , then the J pieces are concatenated to form a test stream in our experiments ( J is set to 10 for all experiments); ρ > 0 is a concentration factor, when ρ is small, samples belong to the same category will concentrate in test stream.

Original: To simulate class-imbalanced test samples, we re-sample data points with an exponential decay in frequencies across different classes.
Revised: To simulate class-imbalanced test samples, we re-sample data points with an exponential decay in frequencies across different classes.

Original: We control the degree of imbalance through an imbalance factor π , which is defined as the ratio between sample sizes of the least frequent class and the most frequent class.
Revised: We control the degree of imbalance through an imbalance factor π , which is defined as the ratio between sample sizes of the least frequent class and the most frequent class.

Original: For DS+CI scenario, we mimic a class-imbalanced test set first, then the final test samples are dependently sampled from it.
Revised: For DS+CI scenario, we mimic a class-imbalanced test set first, then the final test samples are dependently sampled from it.

Original: [Figure] [Figure]
Revised: [Figure] [Figure]

Original: com
Revised: com

Original: [Figure]
Revised: [Figure]

Original: ?v={
Revised: ?v={

Original: [Figure]
Revised: [Figure]

Original: above
Revised: above

Original: [Figure]
Revised: [Figure]

Original: ID
Revised: ID

Original: [Figure] [Figure]
Revised: [Figure] [Figure]

Original: [Figure] [Figure]
Revised: [Figure] [Figure]

Original: [Figure] [Figure]
Revised: [Figure] [Figure]

Original: [Figure]
Revised: [Figure]

Original: A. THE ALGORITHM DESCRIPTION OF TBR
Revised: A. THE ALGORITHM DESCRIPTION OF TBR

Original: We present the detailed algorithm description of TBR in Algorithm 2.
Revised: We present the detailed algorithm description of TBR in Algorithm 2.

Original: A. IMPLEMENTATIONS
Revised: A. IMPLEMENTATIONS

Original: We use Adam optimizer with learning rate of 1e-3, batch size of 200 for CIFAR100-C; SGD optimizer with learning rate of 2.5e-4, batch size of 64 for ImageNet-C/-R; SGD optimizer with learning rate of 2.5e-4, batch size of 200 for YTBB-sub.
Revised: We use Adam optimizer with learning rate of 1e-3, batch size of 200 for CIFAR100-C; SGD optimizer with learning rate of 2.5e-4, batch size of 64 for ImageNet-C/-R; SGD optimizer with learning rate of 2.5e-4, batch size of 200 for YTBB-sub.

Original: For DELTA, the hyper-parameters α and λare
Revised: For DELTA, the hyper-parameters α and λ

Original: Then, we summarize the implementation details of the compared methods here, including BN adapt,
Revised: Then, we summarize the implementation details of the compared methods here, including BN adapt,

Original: PL, TENT, LAME, ETA, Ent-W, and CoTTA (CoTTA*).
Revised: PL, TENT, LAME, ETA, Ent-W, and CoTTA (CoTTA*).

Original: Unless otherwise specified, the optimizer, learning rate, and batch size are the same as those described in the main paper.
Revised: Unless otherwise specified, the optimizer, learning rate, and batch size are the same as those described in the main paper.

Original: For BN adapt, we follow the operation in Nado et al.
Revised: For BN adapt, we follow the operation in Nado et al.

Original: and the official code of TENT ( https://github.com/
Revised: and the official code of TENT ( https://github.com/

Original: DequanWang/tent ), i.e. , using the test-time normalization statistics completely.
Revised: DequanWang/tent ), i.e. , using the test-time normalization statistics completely.

Original: Though one can introduce a hyper-parameter to adjust the trade-off between current statistics and those inherited from the trained model ( a 0 ) (Schneider et al., 2020), we find this strategy does not lead to significant improvement and its effect varies from dataset to dataset.
Revised: Though one can introduce a hyper-parameter to adjust the trade-off between current statistics and those inherited from the trained model ( a 0 ) (Schneider et al., 2020), we find this strategy does not lead to significant improvement and its effect varies from dataset to dataset.

Original: For PL and TENT, besides the normalization statistics, we update the affine parameters in BN modules.
Revised: For PL and TENT, besides the normalization statistics, we update the affine parameters in BN modules.

Original: The confidence threshold in PL is set to 0.4, which can produce acceptable results in most cases.
Revised: The confidence threshold in PL is set to 0.4, which can produce acceptable results in most cases.

Original: We adopt/modify the official implementation https://github.com/DequanWang/tent to produce the results of TENT/PL.
Revised: We adopt/modify the official implementation https://github.com/DequanWang/tent to produce the results of TENT/PL.

Original: For
Revised: For

Original: LAME, we use the k-NN affinity matrix with 5 nearest neighbors following Boudiaf et al.
Revised: LAME, we use the k-NN affinity matrix with 5 nearest neighbors following Boudiaf et al.

Original: and the official implementation https://github.com/fiveai/LAME .
Revised: and the official implementation https://github.com/fiveai/LAME .

Original: For ETA, the entropy constant threshold is set to 0.4 × ln K ( K is the number of task classes), and the similarity threshold is set to 0.4/0.05 for CIFAR/ImageNet experiments following the authors’ suggestion and official implementation https://github.com/mr-eggplant/EATA .
Revised: For ETA, the entropy constant threshold is set to 0.4 × ln K ( K is the number of task classes), and the similarity threshold is set to 0.4/0.05 for CIFAR/ImageNet experiments following the authors’ suggestion and official implementation https://github.com/mr-eggplant/EATA .

Original: For Ent-W, the entropy constant threshold is set to 0.4 or 0.5 times ln K .
Revised: For Ent-W, the entropy constant threshold is set to 0.4 or 0.5 times ln K .

Original: For CoTTA, the used random augmentations include color jitter, random affine, gaussian blur, random horizontal flip, and gaussian noise.
Revised: For CoTTA, the used random augmentations include color jitter, random affine, gaussian blur, random horizontal flip, and gaussian noise.

Original: 32 augmentations are employed in this method.
Revised: 32 augmentations are employed in this method.

Original: The learning rate is set to 0.01 for ImageNet experiments following official implementation https://github.com/qinenergy/cotta .
Revised: The learning rate is set to 0.01 for ImageNet experiments following official implementation https://github.com/qinenergy/cotta .

Original: The restoration probability is set to 0.01 for CIFAR experiments and 0.001 for ImageNet experiments.
Revised: The restoration probability is set to 0.01 for CIFAR experiments and 0.001 for ImageNet experiments.

Original: The augmentation threshold is set to 0.72 for CIFAR experiments and 0.1 for ImageNet experiments.
Revised: The augmentation threshold is set to 0.72 for CIFAR experiments and 0.1 for ImageNet experiments.

Original: The exponential-moving-average factor is set to 0.999 for all experiments.
Revised: The exponential-moving-average factor is set to 0.999 for all experiments.

Original: CoTTA optimizes all learnable parameters during adaptation.
Revised: CoTTA optimizes all learnable parameters during adaptation.

Original: A. ADDITIONAL ANALYSIS
Revised: A. ADDITIONAL ANALYSIS

Original: Fully test-time adaptation with small (test) batch size.
Revised: Fully test-time adaptation with small (test) batch size.

Original: In the main paper, we report results with the default batch size following previous studies.
Revised: In the main paper, we report results with the default batch size following previous studies.

Original: Here, we study test-time adaptation with a much smaller batch size.
Revised: Here, we study test-time adaptation with a much smaller batch size.

Original: The small batch size brings two serious challenges: the normalization statistics can be inaccurate and fluctuate dramatically; the gradient-based optimization can be noisy.
Revised: The small batch size brings two serious challenges: the normalization statistics can be inaccurate and fluctuate dramatically; the gradient-based optimization can be noisy.

Original: Previous study (Niu et al., 2022) employs a sliding window with L samples in total (including L − B previous samples, assuming L > B , L % B = 0 here) to perform adaptation.
Revised: Previ- ous study (Niu et al., 2022) employs a sliding window with L samples in total (including L − B previous samples, assuming L > B , L % B = 0 here) to perform adaptation.

Original: However, this strategy significantly increases the computational cost: LB × forward and backward, e.g., 64 × when
Revised: However, this strategy significantly increases the computational cost: LB × forward and backward, e.g., 64 × when

Original: B = 1 , L = 64 .
Revised: B = 1 , L = 64 .

Original: We employ another strategy, called “fast-inference and slow-update”.
Revised: We employ another strategy, called “fast-inference and slow-update”.

Original: When the samples arrive, infer them instantly with the current model but do not perform adaptation; the model is updated with the recent L samples every LB mini-batches.
Revised: When the samples arrive, infer them instantly with the current model but do not perform adaptation; the model is updated with the recent L samples every LB mini-batches.

Original: Thus, this strategy only needs 2 × forward and 1 × backward.
Revised: Thus, this strategy only needs 2 × forward and 1 × backward.

Original: Note that the two strategies both need to cache some recent test samples, which may be a bit against the “online adaptation”.
Revised: Note that the two strategies both need to cache some recent test samples, which may be a bit against the “online adaptation”.

Original: We evaluate TENT and DELTA on the IS+CB test stream of CIFAR100-C with batch sizes 128, 16, 8, and 1.
Revised: We evaluate TENT and DELTA on the IS+CB test stream of CIFAR100-C with batch sizes 128, 16, 8, and 1.

Original: The results are listed in Table 11.
Revised: The results are listed in Table 11.

Original: We find that TENT suffers from severe performance degeneration when the batch size is small, which is due to TENT always using the normalization statistics derived from the test mini-batches, thus it is still affected by the small batch size during “fast-inference”.
Revised: We find that TENT suffers from severe performance degeneration when the batch size is small, which is due to TENT always using the normalization statistics derived from the test mini-batches, thus it is still affected by the small batch size during “fast-inference”.

Original: With the assistance of DELTA, the performance degradation can be significantly alleviated: it only drops by 0.7% (from 69.8% to 69.1%) when B = 1 .
Revised: With the assistance of DELTA, the performance degradation can be significantly alleviated: it only drops by 0.7% (from 69.8% to 69.1%) when B = 1 .

Original: [Table]
Revised: [Table]

Original: The initialization of TBR’s normalization statistics.
Revised: The initialization of TBR’s normalization statistics.

Original: As described in Section 3.2, TBR keeps the moving normalization statistics ˆ µ ema , ˆ σ ema , we usually have two ways to initialize them: using the statistics ˆ µ batch, ˆ σ batchderived from the first test mini-batch (First); using the statistics µ ema , σ ema inherited from the trained model (Inherit).
Revised: As described in Section 3.2, TBR keeps the moving normalization statistics ˆ µ ema , ˆ σ ema , we usually have two ways to initialize them: using the statistics ˆ µ batch, ˆ σ batchderived from the first test mini-batch (First); using the statistics µ ema , σ ema inherited from the trained model (Inherit).

Original: In the main paper, we use the “First” initialization strategy.
Revised: In the main paper, we use the “First” initialization strategy.

Original: However, it is worth noting that “First” is not reasonable for too small batch size.
Revised: However, it is worth noting that “First” is not reasonable for too small batch size.

Original: We perform TENT+DELTA with the above two initialization strategies and different batch sizes on the
Revised: We perform TENT+DELTA with the above two initialization strategies and different batch sizes on the

Original: IS+CB test stream of CIFAR100-C. Figure 9 summaries the results, we can see that when the batch size is too small, using the inherited normalization statistics as initialization is better; when the batch size is acceptable (just > 8 for CIFAR100-C), using the “First” initialization strategy is superior.
Revised: IS+CB test stream of CIFAR100-C. Figure 9 summaries the results, we can see that when the batch size is too small, using the inherited normalization statistics as initialization is better; when the batch size is acceptable (just > 8 for CIFAR100-C), using the “First” initialization strategy is superior.

Original: [Figure]
Revised: [Figure]

Original: Performance under different severity levels on CIFAR100-C and ImageNet-C. In the main paper, for CIFAR100-C and ImageNet-C, we report the results with the highest severity level 5 following previous studies.
Revised: Performance under different severity levels on CIFAR100-C and ImageNet-C. In the main paper, for CIFAR100-C and ImageNet-C, we report the results with the highest severity level 5 following previous studies.

Original: Here, we investigate DELTA on top of TENT with different severity levels on
Revised: Here, we investigate DELTA on top of TENT with different severity levels on

Original: CIFAR100-C (IS+CB scenario).
Revised: CIFAR100-C (IS+CB scenario).

Original: Figure 10 presents the results.
Revised: Figure 10 presents the results.

Original: We observe that (i) as the corruption level increases, the model accuracy decreases; (ii) DELTA works well under all severity levels.
Revised: We observe that (i) as the corruption level increases, the model accuracy decreases; (ii) DELTA works well under all severity levels.

Original: Performance in extreme cases.
Revised: Performance in extreme cases.

Original: We examine the performance of DELTA with more extreme conditions: DS+CB with ρ = 0 .
Revised: We examine the performance of DELTA with more extreme conditions: DS+CB with ρ = 0 .

Original: 01 , IS+CI with π = 0 .
Revised: 01 , IS+CI with π = 0 .

Original: Table 12 shows DELTA can manage the intractable cases.
Revised: Table 12 shows DELTA can manage the intractable cases.

Original: Influence of random seeds.
Revised: Influence of random seeds.

Original: As fully test-time adaptation is established based on a pre-trained model, i.e. , does not need random initialization; methods like PL, TENT, Ent-W, and our DELTA also do not bring random initialization.
Revised: As fully test-time adaptation is established based on a pre-trained model, i.e. , does not need random initialization; methods like PL, TENT, Ent-W, and our DELTA [Figure]

Original: As a result, the adaptation results are always the same on
Revised: [Table]

Original: [Figure]
Revised: [Figure]

Original: [Table]
Revised: [Table]

Original: [Figure]
Revised: also do not bring random initialization. As a result

Original: [Table]
Revised: [Table]

Original:  one fixed test stream.
Revised: the adaptation results are always the same on one fixed test stream.

Original: However, the random seeds can affect sample order in our experiments.
Revised: However, the random seeds can affect sample order in our experiments.

Original: We study the influence of random seeds on Gauss and Shot data (IS+CB scenario) of ImageNet-C with seeds { 2020, 2021, 2022, 2023 } .
Revised: We study the influence of random seeds on Gauss and Shot data (IS+CB scenario) of ImageNet-C with seeds { 2020, 2021, 2022, 2023 } .

Original: The results of TENT and DELTA are summarized in Table 13, from which one can see the methods are not greatly affected by the sample order within the same scenario .
Revised: The results of TENT and DELTA are summarized in Table [Table] from which one can see the methods are not greatly affected by the sample order within the same scenario .

Original: For fair comparison, all methods are investigated under the same sample order for each specific scenario in our experiments.
Revised: For fair comparison, all methods are investigated under the same sample order for each specific scenario in our experiments.

Original: [Table]
Revised: [Table]

Original: Ablation on DOT.
Revised: Ablation on DOT.

Original: We examine the performance of DOT with another way to get the sample weights (Line 5,6 in Algorithm 1).
Revised: We examine the performance of DOT with another way to get the sample weights (Line 5,6 in Algorithm 1).

Original: One can discard line 5 and modify line 6 to adopt the original soft probabilities: ω m t + b = (cid:80) K k
Revised: One can discard line 5 and modify line 6 to adopt the original soft probabilities: ω m t + b = (cid:80) K k

Original: =1 1 / ( z t − 1 [ k ] + ϵ ) · p m t + b [ k ] .
Revised: =1 1 / ( z t − 1 [ k ] + ϵ ) · p m t + b [ k ] .

Original: We compare the hard label strategy (Algorithm 1) with the soft one in Table 14 (on the basis of Enw-W+TBR, on ImageNet-C).
Revised: We compare the hard label strategy (Algorithm 1) with the soft one in Table 14 (on the basis of Enw-W+TBR, on ImageNet-C).

Original: We find that both strategies work well in all scenarios, demonstrating the effectiveness of the idea of DOT.
Revised: We find that both strategies work well in all scenarios, demonstrating the effectiveness of the idea of DOT.

Original: The performance of the soft strategy is slightly worse than the hard strategy in some scenarios.
Revised: The performance of the soft strategy is slightly worse than the hard strategy in some scenarios.

Original: However, we think it is difficult to say “hard labels are necessarily better than soft labels” or “soft labels are necessarily better than hard labels”, for example, the two strategies both exist in recent semi-supervised methods: hard label in FixMatch, soft label in UDA.
Revised: However, we think it is difficult to say “hard labels are necessarily better than soft labels” or “soft labels are necessarily better than hard labels”, for example, the two strategies both exist in recent semi-supervised methods: hard label in FixMatch, soft label in UDA.

Original: [Table]
Revised: [Table]

Original: A. RESULTS OF EACH CORRUPTION TYPE ON CIFAR100-C.
Revised: A. RESULTS OF EACH CORRUPTION TYPE ON CIFAR100-C.

Original: Table 2 has compared the usages of different normalization statistics, we further provide the detailed results of all corruption types in Table 15.
Revised: Table 2 has compared the usages of different normalization statistics, we further provide the detailed results of all corruption types in Table 15.

Original: Table 16 presents the results of all corruption types under different batch sizes and the two initialization strategies for normalization statistics in TBR, the averaged results have been illustrated in
Revised: Table 16 presents the results of all corruption types under different batch sizes and the two initialization strategies for normalization statistics in TBR, the averaged results have been illustrated in

Original: Table 11 and Figure 9 respectively.
Revised: Table 11 and Figure 9 respectively.

Original: Table 17 summarises the detailed performance on IS+CB test stream with different severity levels.
Revised: Table 17 summarises the detailed performance on IS+CB test stream with different severity levels.

Original: Table 18 compares the test-time adaptation methods in IS+CB scenario; Table 19 for DS+CB test stream ( ρ = 1.0), Table 20 for DS+CB test stream ( ρ = 0.5), Table 21 for DS+CB test stream ( ρ = 0.1);
Revised: Table 18 compares the test-time adaptation methods in IS+CB scenario; Table 19 for DS+CB test stream ( ρ = 1.0), Table 20 for DS+CB test stream ( ρ = 0.5), Table 21 for DS+CB test stream ( ρ = 0.1);

Original: Table 22, 23 for IS+CI data with π = 0.1, π = 0.05; Table 24 / Table 25 for DS+CI test data with ρ = 0.5 and π = 0.1 / π = 0.05.
Revised: Table 22, 23 for IS+CI data with π = 0.1, π = 0.05; Table 24 / Table 25 for DS+CI test data with ρ = 0.5 and π = 0.1 / π = 0.05.

Original: A. RESULTS OF EACH CORRUPTION TYPE ON I MAGE N ET -C.
Revised: A. RESULTS OF EACH CORRUPTION TYPE ON I MAGE N ET -C.

Original: Table 26 compares the test-time adaptation methods in IS+CB scenario and Table 27 further compares them with different model architectures; Table 28, Table 29, and Table 30 for DS+CB test streams with ρ = 1.0, ρ = 0.5 and ρ = 0.1, respectively; Table 31, 32 for IS+CI data with π = 0.1, π = 0.05; Table 33 / Table 34 for DS+CI test data with ρ = 0.5 and π = 0.1 / π = 0.05.
Revised: Table 26 compares the test-time adaptation methods in IS+CB scenario and Table 27 further compares them with different model architectures; Table 28, Table 29, and Table 30 for DS+CB test streams with ρ = 1.0, ρ = 0.5 and ρ = 0.1, respectively; Table 31, 32 for IS+CI data with π = 0.1, π = 0.05; Table 33 / Table 34 for DS+CI test data with ρ = 0.5 and π = 0.1 / π = 0.05.

Original: The results in
Revised: The results in

Original: Table 15-Table 34 are obtained with seed 2020.
Revised: Table 15-Table 34 are obtained with seed 2020.

Original: [Table] [Table]
Revised: [Table] [Table]

Original: [Table] [Table]
Revised: [Table] [Table]

Original: [Table] [Table]
Revised: [Table] [Table]

Original: [Table] [Table]
Revised: [Table] [Table]

Original: [Table] [Table]
Revised: [Table] [Table]

Original: [Table] [Table]
Revised: [Table] [Table]

Original: [Table] [Table]
Revised: [Table] [Table]

Original: [Table] [Table]
Revised: [Table] [Table]

Original: [Table] [Table]
Revised: [Table] [Table]

Original: [Table] [Table]
Revised: [Table] [Table]