Pith. sign in

REVIEW 3 major objections 3 minor 67 references

Neutralizing Token Aggregation via Information Augmentation for Efficient Test-Time Adaptation

T0 review · 3 major / 3 minor · reviewed 2026-08-06 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Token aggregation erases information during test-time adaptation, and augmenting the [CLS] token can restore it.

desk verdict A practical and well-motivated combination of token merging and test-time adaptation, but the central proof of information recovery cannot be checked from the corrupted full text and, as stated, the entropy-minimization guarantee looks incomplete without extra assumptions. read the letter →

arxiv 2508.03388 v2 pith:A3W3MPZV submitted 2025-08-05 cs.CV

Yizhe Xiong , Zihan Zhou , Yiwen Liang , Hui Chen , Zijia Lin , Tianxiang Hao , Fan Zhang , Jungong Han
show 1 more author
Guiguang Ding
This is my paper
classification cs.CV MSC 68T0768T45
keywords test-timeadaptationVisionTransformertokenaggregationentropyminimizationmutualinformationaugmentationdistributionshiftinferenceefficiency
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Test-time adaptation lets a Vision Transformer adjust to a shifted data distribution without extra training data, but token aggregation methods that merge redundant tokens to cut inference cost damage the adaptation. The paper's central claim is that this damage is not merely empirical: from a mutual-information perspective, aggregation removes information carried by the [CLS] token, and conventional methods that only tune normalization layers cannot restore that information. The proposed method, NAVIA, augments the [CLS] token embedding and adds adaptive biases to it in shallow network layers, then optimizes these changes with entropy minimization; the paper argues this recovers the information lost to aggregation. If correct, efficient token aggregation and accurate test-time adaptation stop being a trade-off, with over 2.5% better accuracy than state-of-the-art baselines and more than 20% lower inference latency on out-of-distribution benchmarks.

What carries the argument

The load-bearing object is the augmented [CLS] token, the classification token whose embedding is read out for prediction. Token aggregation discards patch tokens and thereby lowers the mutual information between the [CLS] token and the task target; NAVIA counters this by adding augmentations and adaptive bias terms to the [CLS] embedding in shallow layers. The load-bearing link is the paper's claim that entropy minimization on that augmented representation recovers the lost mutual information—so the learned biases are not just corrections to normalization drift but parameters that carry information back into the classification token.

What would settle it

On an out-of-distribution benchmark, compare NAVIA against a control that adds random perturbations that also lower prediction entropy; if the control matches NAVIA's accuracy, the specific claim that the method recovers information lost to token aggregation is not supported. Alternatively, estimate the mutual information between the adapted [CLS] representation and the true label before and after adaptation and check whether it rises when accuracy rises.

Watch

Extended reading notes

Core claim

The paper formalizes a problem it calls Efficient Test-Time Adaptation: keep a ViT's adaptation ability while reducing its inference latency through token aggregation. It then gives a theoretical analysis showing that token aggregation inherently reduces the mutual information between the token representation and the target label, and that norm-tuning-based TTA methods cannot fully repair this because adjusting parameters does not put information back. The proposed NAVIA method works on the [CLS] token—the special output token used for classification—by augmenting its embedding and injecting adaptive biases in shallow transformer layers; the theoretical result is that when these augmentations are optimized by entropy minimization they recover the information that aggregation removed. The paper's own summary of the outcome is a substantial gain in out-of-distribution accuracy together with a large reduction in inference latency.

Load-bearing premise

The load-bearing premise is that minimizing prediction entropy on the augmented [CLS] token reliably restores task-relevant information, rather than merely making the model confidently wrong; if entropy minimization can lower entropy by discarding useful information, the recovery guarantee fails.

Editorial extensions

If this is right

  • Efficient token aggregation and test-time adaptation can be combined in one pipeline, so merging tokens no longer has to sacrifice adaptation accuracy.
  • Methods that only tune normalization layers after token aggregation will hit a ceiling, since they cannot restore discarded information.
  • If the reported numbers hold, NAVIA offers an inference-latency cut of over 20% with an accuracy gain of over 2.5% on out-of-distribution benchmarks.
  • Because the intervention is confined to shallow layers and the [CLS] token, the approach can be layered onto existing ViT token-aggregation methods without retraining the backbone.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Beyond the paper, the same information-augmentation principle should transfer to any ViT architecture that compresses many patch tokens into one summary vector, such as attention-pooling classifiers, not just [CLS]-token models.
  • Beyond the paper, a direct stress test is to run NAVIA under a distribution shift where entropy minimization is known to reward confident wrong predictions; if accuracy falls while entropy still drops, the surrogate link between entropy and information recovery is the fragile point.
  • Beyond the paper, the shallow-layer bias terms could be shared across images, so an extension could measure how few entropy-minimization steps are needed to reach the recovered-information regime and whether the latency savings survive with small test batches.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 3 minor

Summary. The manuscript formalizes Efficient Test-Time Adaptation (ETTA), combining plug-and-play token aggregation with test-time adaptation for Vision Transformers. It claims a theoretical mutual-information analysis showing that token aggregation loses information that conventional norm-tuning-based TTA cannot recover, and proposes NAVIA, which augments the [CLS] token embedding and adds adaptive biases in shallow layers, optimized by entropy minimization. The abstract states that these augmentations theoretically recover the information lost by token aggregation and reports accuracy gains over 2.5% and inference latency reduction over 20% on out-of-distribution benchmarks. The full text supplied to the referee is corrupted (mojibake), so only the abstract and a few fragments are reviewable; the derivation, theorem statements, tables, and implementation details cannot be verified.

Significance. If the theoretical claim holds, the paper would make a useful contribution: it addresses a practically relevant problem, proposes a lightweight repair that is compatible with token aggregation, and offers a mutual-information perspective that is a natural lens for understanding why token merging hurts TTA. The reported latency reduction is especially valuable for resource-constrained deployment. However, the load-bearing assertion that entropy minimization recovers task-relevant information is not established in the visible text. Because prediction entropy and task-relevant mutual information have no general monotone relationship, the claim needs explicit assumptions or constraints. The quantitative results are reported without variance or ablations in the abstract and cannot currently be checked. The paper's value therefore depends on a revised, readable version that supplies the missing proof conditions and experimental details.

major comments (3)
  1. [Abstract, last paragraph] The central theoretical claim is unsupported as stated. The sentence "We theoretically demonstrate that these augmentations, when optimized via entropy minimization, recover the information lost due to token aggregation" requires that minimizing prediction entropy increases I(Z;Y), but no such monotone relationship holds in general. A constant-class predictor achieves zero entropy while carrying no information about inputs or labels, and under distribution shift entropy minimization can yield confidently wrong predictions that reduce mutual information. The proof must state explicit conditions under which entropy minimization is a valid surrogate for information recovery, such as a restricted augmentation family, a diversity or norm constraint, a calibration assumption, or a label-marginal constraint. The supplied full text is corrupted, so I cannot verify whether such conditions appear; please supply a readable version and state the theorem together with all assumptions.
  2. [Abstract and experimental tables] The claims of "over 2.5%" accuracy improvement and "more than 20%" inference latency reduction are made without error bars, number of seeds, or ablations. The tables in the corrupted full text are unreadable, so the comparison protocol, baselines, and variance cannot be assessed. To support the central empirical claim, report mean and standard deviation over multiple runs, ablate the augmentation and bias-insertion components, and specify the token-merging ratios and benchmark settings.
  3. [Full text (theoretical derivation)] The theorem or proposition that underlies the information-recovery claim is not decipherable in the provided full text. Only fragments of equations and table headers are visible, and no complete proof chain can be checked. If the proof relies on auxiliary assumptions (e.g., Lipschitz continuity of the classifier, bounded augmentation magnitude, or a particular entropy estimator), these must be explicitly stated and justified in the main text. As it stands, the paper's foundational result is neither verifiable nor reproducible from the submitted materials.
minor comments (3)
  1. [Header / metadata] The full text includes the line "arXiv:2508.03379v3 [cs.AI] 5 Nov 2025", which conflicts with the paper's arXiv identifier 2508.03388; please correct this metadata.
  2. [Method description] The operation of augmenting the [CLS] token and inserting adaptive biases is described only verbally in the abstract; the main text should define the augmentation and bias-insertion formulas precisely, including which layers and what parameterization are used.
  3. [Tables and figures] The table fragments visible in the corrupted text cannot be interpreted; ensure all tables and figures are legible, numbered, and referenced in the text.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity found: the mutual-information recovery claim is an independent theoretical assertion, and the entropy-minimization surrogate is a correctness risk rather than a definitional reduction.

full rationale

The paper's load-bearing claim is that CLS-token augmentations, optimized via entropy minimization, recover information lost to token aggregation. This would be circular only if 'information recovery' were defined as entropy reduction, making the conclusion identical to the optimization objective. The abstract, however, frames the analysis in terms of an independent information-theoretic quantity ('we first provide a theoretical analysis from a novel mutual information perspective'), and the reported gains are evaluated on external out-of-distribution benchmarks rather than read off fitted parameters. The supplied full text is corrupted, so no equation-level identity could be extracted: in particular, there is no visible Eq. X = Eq. Y by construction, no fitted parameter renamed as a prediction, and the reference list is illegible, so no self-citation chain can be substantiated. The gap identified by a skeptical reading -- that unsupervised entropy minimization need not monotonically increase task-relevant mutual information -- is a correctness risk about an unproven surrogate assumption, not a circularity. Therefore no significant circularity is found.

Assumptions & free parameters 0 free parameters · 3 assumptions · 0 invented entities

No free parameters or invented entities are identifiable from the abstract. The method's core premises are listed as axioms. The full text would be needed to audit hyperparameters, augmentation scales, and theoretical assumptions.

assumptions (3)
  • domain assumption Token aggregation induces an information loss that can be quantified by mutual information and is not fully mitigated by norm-tuning-based TTA.
    The entire motivation and theory rely on this premise; it is stated in the abstract without derivation.
  • domain assumption Entropy minimization can optimize the [CLS] augmentation to recover the lost information.
    The claimed recovery result depends on this optimization target; the abstract asserts it but does not show why entropy is sufficient.
  • domain assumption Augmenting the [CLS] token and adding adaptive biases in shallow layers is sufficient to carry the information discarded by token aggregation.
    The mechanism presumes that shallow-layer [CLS] modifications can compensate for information removed by deeper token merging.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Neutralizing Token Aggregation via Information Augmentation for Efficient Test-Time Adaptation." pith.science (2026). https://pith.science/paper/A3W3MPZV

@misc{pith2026250803388,
  author       = {Pith},
  title        = {Pith review of: Neutralizing Token Aggregation via Information Augmentation for Efficient Test-Time Adaptation},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/A3W3MPZV}},
  note         = {Machine review of arXiv:2508.03388}
}
read the original abstract

Test-Time Adaptation (TTA) has emerged as an effective solution for adapting Vision Transformers (ViT) to distribution shifts without additional training data. However, existing TTA methods often incur substantial computational overhead, limiting their applicability in resource-constrained real-world scenarios. To reduce inference cost, plug-and-play token aggregation methods merge redundant tokens in ViTs to reduce total processed tokens. Albeit efficient, it suffers from significant performance degradation when directly integrated with existing TTA methods. We formalize this problem as Efficient Test-Time Adaptation (ETTA), seeking to preserve the adaptation capability of TTA while reducing inference latency. In this paper, we first provide a theoretical analysis from a novel mutual information perspective, showing that token aggregation inherently leads to information loss, which cannot be fully mitigated by conventional norm-tuning-based TTA methods. Guided by this insight, we propose to \textbf{N}eutralize Token \textbf{A}ggregation \textbf{v}ia \textbf{I}nformation \textbf{A}ugmentation (\textbf{NAVIA}). Specifically, we directly augment the [CLS] token embedding and incorporate adaptive biases into the [CLS] token in shallow layers of ViTs. We theoretically demonstrate that these augmentations, when optimized via entropy minimization, recover the information lost due to token aggregation. Extensive experiments across various out-of-distribution benchmarks demonstrate that NAVIA significantly outperforms state-of-the-art methods by over 2.5\%, while achieving an inference latency reduction of more than 20\%, effectively addressing the ETTA challenge.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

67 extracted references · 55 canonical work pages

  1. [1]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 global.max substring 't := if while FUNCTION format.date year duplicate empty "emp...

  2. [2]

    Variational information distillation for knowledge transfer

    Sungsoo Ahn, Shell Xu Hu, Andreas Damianou, Neil D Lawrence, and Zhenwen Dai. Variational information distillation for knowledge transfer. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 9163--9171, 2019

    work page 2019

  3. [3]

    An intuitive proof of the data processing inequality

    Normand J Beaudry and Renato Renner. An intuitive proof of the data processing inequality. Quantum Information & Computation, 12 0 (5-6): 0 432--441, 2012

    work page 2012

  4. [4]

    Token merging: Your vit but faster

    Daniel Bolya, Cheng-Yang Fu, Xiaoliang Dai, Peizhao Zhang, Christoph Feichtenhofer, and Judy Hoffman. Token merging: Your vit but faster. In ICLR, 2023

    work page 2023

  5. [5]

    Parameter-free online test-time adaptation

    Malik Boudiaf, Romain Mueller, Ismail Ben Ayed, and Luca Bertinetto. Parameter-free online test-time adaptation. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 8344--8353, 2022

    work page 2022

  6. [6]

    Zeroq: A novel zero shot quantization framework

    Yaohui Cai, Zhewei Yao, Zhen Dong, Amir Gholami, Michael W Mahoney, and Kurt Keutzer. Zeroq: A novel zero shot quantization framework. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 13169--13178, 2020

    work page 2020

  7. [7]

    End-to-end object detection with transformers

    Nicolas Carion, Francisco Massa, Gabriel Synnaeve, Nicolas Usunier, Alexander Kirillov, and Sergey Zagoruyko. End-to-end object detection with transformers. In Computer Vision -- ECCV 2020, pages 213--229, Cham, 2020. Springer International Publishing

    work page 2020

  8. [8]

    Diffrate : Differentiable compression rate for efficient vision transformers

    Mengzhao Chen, Wenqi Shao, Peng Xu, Mingbao Lin, Kaipeng Zhang, Fei Chao, Rongrong Ji, Yu Qiao, and Ping Luo. Diffrate : Differentiable compression rate for efficient vision transformers. In Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV), pages 17164--17174, 2023

    work page 2023

Show all 67 references
  1. [9]

    Chasing sparsity in vision transformers: An end-to-end exploration

    Tianlong Chen, Yu Cheng, Zhe Gan, Lu Yuan, Lei Zhang, and Zhangyang Wang. Chasing sparsity in vision transformers: An end-to-end exploration. Advances in Neural Information Processing Systems, 34: 0 19974--19988, 2021

    2021

  2. [10]

    Binaryconnect: Training deep neural networks with binary weights during propagations

    Matthieu Courbariaux, Yoshua Bengio, and Jean-Pierre David. Binaryconnect: Training deep neural networks with binary weights during propagations. Advances in neural information processing systems, 28, 2015

    2015

  3. [11]

    Learning to generate gradients for test-time adaptation via test-time training layers

    Qi Deng, Shuaicheng Niu, Ronghao Zhang, Yaofo Chen, Runhao Zeng, Jian Chen, and Xiping Hu. Learning to generate gradients for test-time adaptation via test-time training layers. In Proceedings of the AAAI Conference on Artificial Intelligence, 2025

    2025

  4. [12]

    From colors to classes: Emergence of concepts in vision transformers

    Teresa Dorszewski, Lenka T e tkov \'a , Robert Jenssen, Lars Kai Hansen, and Kristoffer Knutsen Wickstr m. From colors to classes: Emergence of concepts in vision transformers. arXiv preprint arXiv:2503.24071, 2025

    2025 arXiv

  5. [13]

    An image is worth 16x16 words: Transformers for image recognition at scale

    Alexey Dosovitskiy, Lucas Beyer, Alexander Kolesnikov, Dirk Weissenborn, Xiaohua Zhai, Thomas Unterthiner, Mostafa Dehghani, Matthias Minderer, Georg Heigold, Sylvain Gelly, Jakob Uszkoreit, and Neil Houlsby. An image is worth 16x16 words: Transformers for image recognition at...

    2021

  6. [14]

    Frustratingly easy test-time adaptation of vision-language models

    Matteo Farina, Gianni Franchi, Giovanni Iacca, Massimiliano Mancini, and Elisa Ricci. Frustratingly easy test-time adaptation of vision-language models. In The Thirty-eighth Annual Conference on Neural Information Processing Systems, 2024

    2024

  7. [15]

    Knowledge distillation in vision transformers: A critical review, 2024

    Gousia Habib, Tausifa Jan Saleem, and Brejesh Lall. Knowledge distillation in vision transformers: A critical review, 2024

    2024

  8. [16]

    Consolidator: Mergable adapter with group connections for visual adaptation

    Tianxiang Hao, Hui Chen, Yuchen Guo, and Guiguang Ding. Consolidator: Mergable adapter with group connections for visual adaptation. In The Eleventh International Conference on Learning Representations, 2023

    2023

  9. [17]

    Benchmarking neural network robustness to common corruptions and perturbations

    Dan Hendrycks and Thomas Dietterich. Benchmarking neural network robustness to common corruptions and perturbations. Proceedings of the International Conference on Learning Representations, 2019

    2019

  10. [18]

    The many faces of robustness: A critical analysis of out-of-distribution generalization

    Dan Hendrycks, Steven Basart, Norman Mu, Saurav Kadavath, Frank Wang, Evan Dorundo, Rahul Desai, Tyler Zhu, Samyak Parajuli, Mike Guo, Dawn Song, Jacob Steinhardt, and Justin Gilmer. The many faces of robustness: A critical analysis of out-of-distribution generalization. In 20...

    2021

  11. [19]

    Distilling the knowledge in a neural network

    Geoffrey Hinton, Oriol Vinyals, and Jeff Dean. Distilling the knowledge in a neural network. arXiv preprint arXiv:1503.02531, 2015

    2015 arXiv

  12. [20]

    Visual prompt tuning

    Menglin Jia, Luming Tang, Bor-Chun Chen, Claire Cardie, Serge Belongie, Bharath Hariharan, and Ser-Nam Lim. Visual prompt tuning. In European conference on computer vision, pages 709--727. Springer, 2022

    2022

  13. [21]

    Efficient test-time adaptation of vision-language models

    Adilbek Karmanov, Dayan Guan, Shijian Lu, Abdulmotaleb El Saddik, and Eric Xing. Efficient test-time adaptation of vision-language models. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 14162--14171, 2024

    2024

  14. [22]

    Token fusion: Bridging the gap between token pruning and token merging

    Minchul Kim, Shangqian Gao, Yen-Chang Hsu, Yilin Shen, and Hongxia Jin. Token fusion: Bridging the gap between token pruning and token merging. In Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision, pages 1383--1392, 2024

    2024

  15. [23]

    Berg, Wan-Yen Lo, Piotr Doll \'a r, and Ross Girshick

    Alexander Kirillov, Eric Mintun, Nikhila Ravi, Hanzi Mao, Chloe Rolland, Laura Gustafson, Tete Xiao, Spencer Whitehead, Alexander C. Berg, Wan-Yen Lo, Piotr Doll \'a r, and Ross Girshick. Segment anything. arXiv:2304.02643, 2023

    2023 arXiv

  16. [24]

    Entropy is not enough for test-time adaptation: From the perspective of disentangled factors

    Jonghyun Lee, Dahuin Jung, Saehyung Lee, Junsung Park, Juhyeon Shin, Uiwon Hwang, and Sungroh Yoon. Entropy is not enough for test-time adaptation: From the perspective of disentangled factors. In The Twelfth International Conference on Learning Representations, 2024

    2024

  17. [25]

    A comprehensive survey on test-time adaptation under distribution shifts

    Jian Liang, Ran He, and Tieniu Tan. A comprehensive survey on test-time adaptation under distribution shifts. International Journal of Computer Vision, 133 0 (1): 0 31--64, 2025 a

    2025

  18. [26]

    Not all patches are what you need: Expediting vision transformers via token reorganizations

    Youwei Liang, Chongjian Ge, Zhan Tong, Yibing Song, Jue Wang, and Pengtao Xie. Not all patches are what you need: Expediting vision transformers via token reorganizations. In International Conference on Learning Representations, 2022

    2022

  19. [27]

    Advancing reliable test-time adaptation of vision-language models under visual variations, 2025 b

    Yiwen Liang, Hui Chen, Yizhe Xiong, Zihan Zhou, Mengyao Lyu, Zijia Lin, Shuaicheng Niu, Sicheng Zhao, Jungong Han, and Guiguang Ding. Advancing reliable test-time adaptation of vision-language models under visual variations, 2025 b

    2025

  20. [28]

    Towards accurate binary convolutional neural network

    Xiaofan Lin, Cong Zhao, and Wei Pan. Towards accurate binary convolutional neural network. Advances in neural information processing systems, 30, 2017

    2017

  21. [29]

    Neural networks with few multiplications

    Zhouhan Lin, Matthieu Courbariaux, Roland Memisevic, and Yoshua Bengio. Neural networks with few multiplications. arXiv preprint arXiv:1510.03009, 2015

    2015 arXiv

  22. [30]

    Gpt understands, too

    Xiao Liu, Yanan Zheng, Zhengxiao Du, Ming Ding, Yujie Qian, Zhilin Yang, and Jie Tang. Gpt understands, too. AI Open, 5: 0 208--215, 2024

    2024

  23. [31]

    Post-training quantization for vision transformer

    Zhenhua Liu, Yunhe Wang, Kai Han, Wei Zhang, Siwei Ma, and Wen Gao. Post-training quantization for vision transformer. In Advances in Neural Information Processing Systems, pages 28092--28103. Curran Associates, Inc., 2021

    2021

  24. [32]

    Learning transferable features with deep adaptation networks

    Mingsheng Long, Yue Cao, Jianmin Wang, and Michael Jordan. Learning transferable features with deep adaptation networks. In Proceedings of the 32nd International Conference on Machine Learning, pages 97--105, Lille, France, 2015. PMLR

    2015

  25. [33]

    Dsmoe: Matrix-partitioned experts with dynamic routing for computation-efficient dense llms

    Minxuan Lv, Zhenpeng Su, Leiyu Pan, Yizhe Xiong, Zijia Lin, Hui Chen, Wei Zhou, Jungong Han, Guiguang Ding, Cheng Luo, et al. Dsmoe: Matrix-partitioned experts with dynamic routing for computation-efficient dense llms. arXiv preprint arXiv:2502.12455, 2025

    2025

  26. [34]

    Learn from the learnt: Source-free active domain adaptation via contrastive sampling and visual persistence

    Mengyao Lyu, Tianxiang Hao, Xinhao Xu, Hui Chen, Zijia Lin, Jungong Han, and Guiguang Ding. Learn from the learnt: Source-free active domain adaptation via contrastive sampling and visual persistence. In European Conference on Computer Vision, pages 228--246. Springer, 2024

    2024

  27. [35]

    Llm-pruner: On the structural pruning of large language models

    Xinyin Ma, Gongfan Fang, and Xinchao Wang. Llm-pruner: On the structural pruning of large language models. In Advances in Neural Information Processing Systems, 2023

    2023

  28. [36]

    Efficient test-time model adaptation without forgetting

    Shuaicheng Niu, Jiaxiang Wu, Yifan Zhang, Yaofo Chen, Shijian Zheng, Peilin Zhao, and Mingkui Tan. Efficient test-time model adaptation without forgetting. In International conference on machine learning, pages 16888--16905. PMLR, 2022

    2022

  29. [37]

    Towards stable test-time adaptation in dynamic wild world

    Shuaicheng Niu, Jiaxiang Wu, Yifan Zhang, Zhiquan Wen, Yaofo Chen, Peilin Zhao, and Mingkui Tan. Towards stable test-time adaptation in dynamic wild world. In The Eleventh International Conference on Learning Representations, 2023

    2023

  30. [38]

    Test-time model adaptation with only forward passes

    Shuaicheng Niu, Chunyan Miao, Guohao Chen, Pengcheng Wu, and Peilin Zhao. Test-time model adaptation with only forward passes. In Proceedings of the 41st International Conference on Machine Learning, pages 38298--38315, 2024

    2024

  31. [39]

    Benjamin Recht, Rebecca Roelofs, Ludwig Schmidt, and Vaishaal Shankar. Do imagenet classifiers generalize to imagenet? In Proceedings of the 36th International Conference on Machine Learning, ICML 2019, 9-15 June 2019, Long Beach, California, USA , pages 5389--5400. PMLR , 2019

    2019

  32. [40]

    Align your prompts: Test-time prompting with distribution alignment for zero-shot generalization

    Jameel Hassan Abdul Samadh, Hanan Gani, Noor Hazim Hussein, Muhammad Uzair Khattak, Muzammal Naseer, Fahad Khan, and Salman Khan. Align your prompts: Test-time prompting with distribution alignment for zero-shot generalization. In Thirty-seventh Conference on Neural Informatio...

    2023

  33. [41]

    A mathematical theory of communication

    Claude E Shannon. A mathematical theory of communication. The Bell system technical journal, 27 0 (3): 0 379--423, 1948

    1948

  34. [42]

    Test-time prompt tuning for zero-shot generalization in vision-language models

    Manli Shu, Weili Nie, De-An Huang, Zhiding Yu, Tom Goldstein, Anima Anandkumar, and Chaowei Xiao. Test-time prompt tuning for zero-shot generalization in vision-language models. Advances in Neural Information Processing Systems, 35: 0 14274--14289, 2022

    2022

  35. [43]

    Unsupervised domain adaptation through self-supervision

    Yu Sun, Eric Tzeng, Trevor Darrell, and Alexei A Efros. Unsupervised domain adaptation through self-supervision. arXiv preprint arXiv:1909.11825, 2019

    1909 arXiv

  36. [44]

    Learning visual conditioning tokens to correct domain shift for fully test-time adaptation

    Yushun Tang, Shuoshuo Chen, Zhehan Kan, Yi Zhang, Qinghai Guo, and Zhihai He. Learning visual conditioning tokens to correct domain shift for fully test-time adaptation. IEEE Transactions on Multimedia, 2024

    2024

  37. [45]

    Unbiased look at dataset bias

    Antonio Torralba and Alexei A Efros. Unbiased look at dataset bias. In CVPR 2011, pages 1521--1528. IEEE, 2011

    2011

  38. [46]

    Training data-efficient image transformers & distillation through attention, 2021

    Hugo Touvron, Matthieu Cord, Matthijs Douze, Francisco Massa, Alexandre Sablayrolles, and Hervé Jégou. Training data-efficient image transformers & distillation through attention, 2021

    2021

  39. [47]

    Visual query tuning: Towards effective usage of intermediate representations for parameter and memory efficient transfer learning

    Cheng-Hao Tu, Zheda Mai, and Wei-Lun Chao. Visual query tuning: Towards effective usage of intermediate representations for parameter and memory efficient transfer learning. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 7725--7735, 2023

    2023

  40. [48]

    Similarity-preserving knowledge distillation

    Frederick Tung and Greg Mori. Similarity-preserving knowledge distillation. In Proceedings of the IEEE/CVF international conference on computer vision, pages 1365--1374, 2019

    2019

  41. [49]

    Visualizing data using t-sne

    Laurens van der Maaten and Geoffrey Hinton. Visualizing data using t-sne. Journal of Machine Learning Research, 9 0 (86): 0 2579--2605, 2008

    2008

  42. [50]

    Tent: Fully test-time adaptation by entropy minimization

    Dequan Wang, Evan Shelhamer, Shaoteng Liu, Bruno Olshausen, and Trevor Darrell. Tent: Fully test-time adaptation by entropy minimization. In International Conference on Learning Representations, 2021

    2021

  43. [51]

    Lipton, and Eric P

    Haohan Wang, Songwei Ge, Zachary C. Lipton, and Eric P. Xing. Learning robust global representations by penalizing local predictive power. In Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, De...

    2019

  44. [52]

    Continual test-time domain adaptation

    Qin Wang, Olga Fink, Luc Van Gool, and Dengxin Dai. Continual test-time domain adaptation. In Proceedings of Conference on Computer Vision and Pattern Recognition, 2022 a

    2022

  45. [53]

    Vtc-lfc: Vision transformer compression with low-frequency components

    Zhenyu Wang, Hao Luo, Pichao WANG, Feng Ding, Fan Wang, and Hao Li. Vtc-lfc: Vision transformer compression with low-frequency components. In Advances in Neural Information Processing Systems, pages 13974--13988. Curran Associates, Inc., 2022 b

    2022

  46. [54]

    In search of lost online test-time adaptation: A survey

    Zixin Wang, Yadan Luo, Liang Zheng, Zhuoxiao Chen, Sen Wang, and Zi Huang. In search of lost online test-time adaptation: A survey. International Journal of Computer Vision, pages 1--34, 2024

    2024

  47. [55]

    A survey of unsupervised deep domain adaptation

    Garrett Wilson and Diane J Cook. A survey of unsupervised deep domain adaptation. ACM Transactions on Intelligent Systems and Technology (TIST), 11 0 (5): 0 1--46, 2020

    2020

  48. [56]

    S mooth Q uant: Accurate and efficient post-training quantization for large language models

    Guangxuan Xiao, Ji Lin, Mickael Seznec, Hao Wu, Julien Demouth, and Song Han. S mooth Q uant: Accurate and efficient post-training quantization for large language models. In Proceedings of the 40th International Conference on Machine Learning, 2023

    2023

  49. [57]

    Confidence-based visual dispersal for few-shot unsupervised domain adaptation

    Yizhe Xiong, Hui Chen, Zijia Lin, Sicheng Zhao, and Guiguang Ding. Confidence-based visual dispersal for few-shot unsupervised domain adaptation. In Proceedings of the IEEE/CVF International Conference on Computer Vision, pages 11621--11631, 2023

    2023

  50. [58]

    Pyra: Parallel yielding re-activation for training-inference efficient task adaptation

    Yizhe Xiong, Hui Chen, Tianxiang Hao, Zijia Lin, Jungong Han, Yuesong Zhang, Guoxin Wang, Yongjun Bao, and Guiguang Ding. Pyra: Parallel yielding re-activation for training-inference efficient task adaptation. In European Conference on Computer Vision, pages 455--473. Springer, 2024

    2024

  51. [59]

    Uniattn: Reducing inference costs via softmax unification for post-training llms

    Yizhe Xiong, Wei Huang, Xin Ye, Hui Chen, Zijia Lin, Haoran Lian, Zhenpeng Su, Jungong Han, and Guiguang Ding. Uniattn: Reducing inference costs via softmax unification for post-training llms. arXiv preprint arXiv:2502.00439, 2025

    2025

  52. [60]

    Tad: A plug-and-play task-aware decoding method to better adapt llms on downstream tasks

    Xinhao Xu, Hui Chen, Zijia Lin, Jungong Han, Lixing Gong, Guoxin Wang, Yongjun Bao, and Guiguang Ding. Tad: A plug-and-play task-aware decoding method to better adapt llms on downstream tasks. In Proceedings of the Thirty-Third International Joint Conference on Artificial Inte...

    2024

  53. [61]

    Mitigating hallucinations in multi-modal large language models via image token attention-guided decoding

    Xinhao Xu, Hui Chen, Mengyao Lyu, Sicheng Zhao, Yizhe Xiong, Zijia Lin, Jungong Han, and Guiguang Ding. Mitigating hallucinations in multi-modal large language models via image token attention-guided decoding. In Proceedings of the 2025 Conference of the Nations of the America...

    2025

  54. [62]

    Geometry-guided domain generalization for monocular 3d object detection

    Fan Yang, Hui Chen, Yuwei He, Sicheng Zhao, Chenghao Zhang, Kai Ni, and Guiguang Ding. Geometry-guided domain generalization for monocular 3d object detection. In Proceedings of the AAAI Conference on Artificial Intelligence, pages 6467--6476, 2024 a

    2024

  55. [63]

    Promptable anomaly segmentation with sam through self-perception tuning, 2024 b

    Hui-Yue Yang, Hui Chen, Ao Wang, Kai Chen, Zijia Lin, Yongliang Tang, Pengcheng Gao, Yuming Quan, Jungong Han, and Guiguang Ding. Promptable anomaly segmentation with sam through self-perception tuning, 2024 b

    2024

  56. [64]

    Unified visual transformer compression

    Shixing Yu, Tianlong Chen, Jiayi Shen, Huan Yuan, Jianchao Tan, Sen Yang, Ji Liu, and Zhangyang Wang. Unified visual transformer compression. In International Conference on Learning Representations, 2022

    2022

  57. [65]

    Prototypical cross-domain self-supervised learning for few-shot unsupervised domain adaptation

    Xiangyu Yue, Zangwei Zheng, Shanghang Zhang, Yang Gao, Trevor Darrell, Kurt Keutzer, and Alberto Sangiovanni-Vincentelli. Prototypical cross-domain self-supervised learning for few-shot unsupervised domain adaptation. In Proceedings of the IEEE Conference on Computer Vision an...

    2021

  58. [66]

    Bayesian test-time adaptation for vision-language models

    Lihua Zhou, Mao Ye, Shuaifeng Li, Nianxin Li, Xiatian Zhu, Lei Deng, Hongbin Liu, and Zhen Lei. Bayesian test-time adaptation for vision-language models. In Proceedings of the Computer Vision and Pattern Recognition Conference, pages 29999--30009, 2025

    2025

  59. [67]

    A closer look at the CLS token for cross-domain few-shot learning

    Yixiong Zou, Shuai Yi, Yuhua Li, and Ruixuan Li. A closer look at the CLS token for cross-domain few-shot learning. In The Thirty-eighth Annual Conference on Neural Information Processing Systems, 2024

    2024

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.