DA: towards distribution adaptive test-time adaptation in dynamic wild world
Bibliographic record
Abstract
Abstract Test-time adaptation (TTA) has demonstrated effectiveness in addressing distribution shifts between training and testing data by adjusting a given model on test samples. However, when faced with testing data that exhibit dynamic patterns, wherein a single test sample batch is drawn from various distribution, the traditional TTA methods, which typically follow a fixed pattern of estimating batch normalization (BN) statistics and then performing back-propagation, tend to experience performance degradation. The key reasons we observed are as follows: (i) different scenarios require different normalization approaches (such as instance normalization (IN) is optimal in mixture domains, but not for static domains) and (ii) back-propagation could potentially degrade the model and waste time. Based on these observations, in this paper, we introduce a novel one-size-fits-all approach, named distribution adaptive test-time adaptation (DA). DA is designed to adaptively select the appropriate batch normalization method and back-propagation approach. It utilizes an IN–based projection method to differentiate between various scenarios. Our method allows the model to achieve a more robust representation, enabling it to adapt effectively to both static and dynamic data patterns. Furthermore, our method avoids unnecessary or potentially harmful backward passes, paving the way for further enhancements. The results show that our method demonstrates robustness while maintaining good performance of the model. It can effectively respond to data stream patterns, and the selective back-propagation approach is more lightweight.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.008 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.003 | 0.002 |
| Research integrity | 0.001 | 0.003 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".