Proceedings

Learning Well-Structured Logits: Leveraging Vision–Language Complementarity for Open-World Test-Time Adaptation

Download BibTeX Cite

Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence. Main Track. Pages 1415-1423.

https://doi.org/10.24963/ijcai.2026/158

Abstract

Open-world test-time adaptation (OWTTA) is increasingly studied for its ability to adapt models at inference time in the presence of both domain discrepancy and semantic variance. Existing methods typically rely on either discriminative models or vision-language models (VLMs) alone, leaving their complementarity in OWTTA underexplored. In this paper, we propose a general framework that explicitly leverages the complementary strengths of discriminative models and VLMs to enable robust open-world test-time adaptation. We first define well-structured logits for OWTTA and provide a theoretical analysis that reveals the complementary properties of logits from discriminative models and VLMs. Building on a unified formulation, we then decompose OWTTA into two coupled modules: confidence-calibrated filtering (CCF), which provides an estimate of in-distribution membership, and semantic complementarity adaptation (SCA), which gives the refined predictions through complementary logit fusion. Extensive experiments across multiple benchmarks empirically confirm the logit complementarity between discriminative models and VLMs, and show that our method effectively leverages it to consistently improve performance.

  1. [Bar et al., 2024] Yarin Bar, Shalev Shaer, and Yaniv Ro- mano. Protected test-time adaptation via online entropy matching: A betting approach. In NeurIPS, 2024.
  2. [Busto and Gall, 2017] Pau Panareda Busto and Juergen Gall. Open set domain adaptation. In ICCV, pages 754- 763. IEEE Computer Society, 2017.
  3. [Chen et al., 2020] Ting Chen, Simon Kornblith, Moham- mad Norouzi, and Geoffrey E. Hinton. A simple frame- work for contrastive learning of visual representations. In ICML, volume 119, pages 1597-1607, 2020.
  4. [Choe et al., 2024] Seun-An Choe, Ah-Hyung Shin, Keon- Hee Park, Jinwoo Choi, and Gyeong-Moon Park. Open-set domain adaptation for semantic segmentation. In CVPR, pages 23943-23953. IEEE, 2024.
  5. [Deng, 2012] Li Deng. The MNIST database of handwrit- ten digit images for machine learning research [best of the web]. IEEE Signal Process. Mag., 29(6):141-142, 2012.
  6. [Gao et al., 2024] Zhengqing Gao, Xu-Yao Zhang, and Cheng-Lin Liu. Unified entropy optimization for open-set test-time adaptation. In CVPR, pages 23975-23984, 2024.
  7. [Gong et al., 2022] Taesik Gong, Jongheon Jeong, Taewon Kim, Yewon Kim, Jinwoo Shin, and Sung-Ju Lee. NOTE: robust continual test-time adaptation against temporal cor- relation. In Sanmi Koyejo, S. Mohamed, A. Agarwal, Danielle Belgrave, K. Cho, and A. Oh, editors, NeurIPS, 2022.
  8. [Gong et al., 2023] Taesik Gong, Yewon Kim, Taeckyung Lee, Sorn Chottananurak, and Sung-Ju Lee. Sotta: Robust test-time adaptation on noisy data streams. In NeurIPS, 2023.
  9. [Han et al., 2025] Jisu Han, Jaemin Na, and Wonjun Hwang. Ranked entropy minimization for continual test-time adap- tation. CoRR, 2025.
  10. [He et al., 2016] Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Deep residual learning for image recog- nition. In CVPR, pages 770-778, 2016.
  11. [Hendrycks and Dietterich, 2019] Dan Hendrycks and Thomas G. Dietterich. Benchmarking neural network robustness to common corruptions and perturbations. In ICLR, 2019.
  12. [Hendrycks et al., 2021] 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 ICCV, pages 8320-8329, 2021.
  13. [Jia et al., 2021] Chao Jia, Yinfei Yang, Ye Xia, Yi-Ting Chen, Zarana Parekh, Hieu Pham, Quoc V. Le, Yun-Hsuan Sung, Zhen Li, and Tom Duerig. Scaling up visual and vision-language representation learning with noisy text su- pervision. In ICML, volume 139, pages 4904-4916, 2021.
  14. [Karmanov et al., 2024] Adilbek Karmanov, Dayan Guan, Shijian Lu, Abdulmotaleb El-Saddik, and Eric P. Xing. Ef- ficient test-time adaptation of vision-language models. In CVPR, pages 14162-14171, 2024.
  15. [Kulis and Jordan, 2012] Brian Kulis and Michael I Jordan. Revisiting k-means: new algorithms via bayesian nonpara- metrics. In Proceedings of the 29th International Cofer- ence on International Conference on Machine Learning, pages 1131-1138, 2012.
  16. [Le and Yang, 2015] Ya Le and Xuan Yang. Tiny imagenet visual recognition challenge. CS 231N, 7(7):3, 2015.
  17. [Lee et al., 2023] Jungsoo Lee, Debasmit Das, Jaegul Choo, and Sungha Choi. Towards open-set test-time adaptation utilizing the wisdom of crowds in entropy minimization. In ICCV, page 16334, 2023.
  18. [Li et al., 2023] Yushu Li, Xun Xu, Yongyi Su, and Kui Jia. On the robustness of open-world test-time training: Self- training with dynamic prototype expansion. In ICCV, pages 11802-11812, 2023.
  19. [Liang et al., 2020] Jian Liang, Dapeng Hu, and Jiashi Feng. Do we really need to access the source data? source hy- pothesis transfer for unsupervised domain adaptation. In ICML, volume 119, pages 6028-6039, 2020.
  20. [Liang et al., 2025] Jian Liang, Ran He, and Tieniu Tan. A comprehensive survey on test-time adaptation under dis- tribution shifts. Int. J. Comput. Vis., 133(1):31-64, 2025.
  21. [Liu et al., 2025] Weiming Liu, Jun Dan, Fan Wang, Xinting Liao, Junhao Dong, Hua Yu, Shunjie Dong, and Lianyong Qi. Distinguish then exploit: Source-free open set domain adaptation via weight barcode estimation and sparse label assignment. In CVPR, pages 4927-4938, 2025.
  22. [Netzer et al., 2011] Yuval Netzer, Tao Wang, Adam Coates, Alessandro Bissacco, Bo Wu, and Andrew Y. Ng. Reading digits in natural images with unsupervised feature learn- ing. In NIPS Workshop on Deep Learning and Unsuper- vised Feature Learning 2011, 2011.
  23. [Niu et al., 2022] Shuaicheng Niu, Jiaxiang Wu, Yifan Zhang, Yaofo Chen, Shijian Zheng, Peilin Zhao, and Mingkui Tan. Efficient test-time model adaptation with- out forgetting. In ICML, volume 162, pages 16888-16905, 2022.
  24. [Osowiechi et al., 2024] David Osowiechi, Mehrdad Noori, Gustavo Adolfo Vargas Hakim, Moslem Yazdanpanah, Ali Bahri, Milad Cheraghalikhani, Sahar Dastani, Farzad Beizaee, Ismail Ben Ayed, and Christian Desrosiers. WATT: weight average test time adaptation of CLIP. In NeurIPS, 2024.
  25. [Pan et al., 2024] Yuangang Pan, Yinghua Yao, and Ivor W. Tsang. PC-X: profound clustering via slow exemplars. In CPAL, volume 234, pages 1-19, 2024.
  26. [Peng et al., 2017] Xingchao Peng, Ben Usman, Neela Kaushik, Judy Hoffman, Dequan Wang, and Kate Saenko. Visda: The visual domain adaptation challenge. CoRR, 2017.
  27. [Pham et al., 2025] Thai-Hoang Pham, Yuanlong Wang, Changchang Yin, Xueru Zhang, and Ping Zhang. Open- set heterogeneous domain adaptation: Theoretical analysis and algorithm. In AAAI, pages 19895-19903, 2025.
  28. [Phan et al., 2024] Viet Hoang Phan, Tung Lam Tran, Quyen Tran, and Trung Le. Enhancing domain adaptation through prompt gradient alignment. In NeurIPS, 2024.
  29. [Qu et al., 2024] Sanqing Qu, Tianpei Zou, Lianghua He, Florian Röhrbein, Alois Knoll, Guang Chen, and Changjun Jiang. LEAD: learning decomposition for source-free universal domain adaptation. In CVPR, pages 23334-23343, 2024.
  30. [Radford et al., 2021] Alec Radford, Jong Wook Kim, Chris Hallacy, Aditya Ramesh, Gabriel Goh, Sandhini Agar- wal, Girish Sastry, Amanda Askell, Pamela Mishkin, Jack Clark, Gretchen Krueger, and Ilya Sutskever. Learning transferable visual models from natural language supervi- sion. In ICML, volume 139, pages 8748-8763, 2021.
  31. [Shu et al., 2022] Manli Shu, Weili Nie, De-An Huang, Zhiding Yu, Tom Goldstein, Anima Anandkumar, and Chaowei Xiao. Test-time prompt tuning for zero-shot gen- eralization in vision-language models. In NeurIPS, 2022.
  32. [Su et al., 2022] Yongyi Su, Xun Xu, and Kui Jia. Revisiting realistic test-time training: Sequential inference and adap- tation by anchored clustering. In NeurIPS, 2022.
  33. [Su et al., 2024a] Yongyi Su, Xun Xu, and Kui Jia. Towards real-world test-time adaptation: Tri-net self-training with balanced normalization. In Michael J. Wooldridge, Jen- nifer G. Dy, and Sriraam Natarajan, editors, AAAI, pages 15126-15135, 2024.
  34. [Su et al., 2024b] Yongyi Su, Xun Xu, Tianrui Li, and Kui Jia. Revisiting realistic test-time training: Sequential in- ference and adaptation by anchored clustering regularized self-training. IEEE Trans. Pattern Anal. Mach. Intell., 46(8):5524-5540, 2024.
  35. [Wan et al., 2024] Fuli Wan, Han Zhao, Xu Yang, and Cheng Deng. Unveiling the unknown: Unleashing the power of unknown to known in open-set source-free domain adap- tation. In CVPR, pages 24015-24024, 2024.
  36. [Wang et al., 2021] Dequan Wang, Evan Shelhamer, Shaoteng Liu, Bruno A. Olshausen, and Trevor Darrell. Tent: Fully test-time adaptation by entropy minimization. In ICLR, 2021.
  37. [Wang et al., 2022] Qin Wang, Olga Fink, Luc Van Gool, and Dengxin Dai. Continual test-time domain adaptation. In CVPR, pages 7191-7201, 2022.
  38. [Wang et al., 2024a] Ran Wang, Hua Zuo, Zhen Fang, and Jie Lu. Towards robustness prompt tuning with fully test- time adaptation for clip's zero-shot generalization. In ACM MM, pages 8604-8612, 2024.
  39. [Wang et al., 2024b] Ziqiang Wang, Zhixiang Chi, Yanan Wu, Li Gu, Zhi Liu, Konstantinos N. Plataniotis, and Yang Wang. Distribution alignment for fully test-time adapta- tion with dynamic online data streams. In ECCV, volume 15082, pages 332-349, 2024.
  40. [Wu et al., 2025] Xiangyu Wu, Feng Yu, Yang Yang, Qing- Guo Chen, and Jianfeng Lu. Multi-label test-time adapta- tion with bound entropy minimization. In ICLR, 2025.
  41. [Xu et al., 2022] Jiarui Xu, Shalini De Mello, Sifei Liu, Wonmin Byeon, Thomas M. Breuel, Jan Kautz, and Xi- aolong Wang. Groupvit: Semantic segmentation emerges from text supervision. In CVPR, pages 18113-18123, 2022.
  42. [Yang et al., 2024] Jingkang Yang, Kaiyang Zhou, Yixuan Li, and Ziwei Liu. Generalized out-of-distribution detec- tion: A survey. Int. J. Comput. Vis., 132(12):5635-5662, 2024.
  43. [Yoon et al., 2024] Hee Suk Yoon, Eunseop Yoon, Joshua Tian Jin Tee, Mark A. Hasegawa-Johnson, Yingzhen Li, and Chang D. Yoo. C-TPT: calibrated test-time prompt tuning for vision-language models via text feature disper- sion. In ICLR, 2024.
  44. [Yu et al., 2025] Zhiqi Yu, Zhichao Liao, Jingjing Li, Zhi Chen, and Lei Zhu. Dynamic target distribution estima- tion for source-free open-set domain adaptation. In AAAI, pages 22254-22262, 2025.
  45. [Zhang et al., 2024] Zhen-Yu Zhang, Zhiyu Xie, Huaxiu Yao, and Masashi Sugiyama. Test-time adaptation in non- stationary environments via adaptive representation align- ment. In NeurIPS, 2024.
  46. [Zhang et al., 2025] Qingyang Zhang, Yatao Bian, Xinke Kong, Peilin Zhao, and Changqing Zhang. COME: test- time adaption by conservatively minimizing entropy. In ICLR, 2025.
  47. [Zhao and Lee, 2024] Na Zhao and Gim Hee Lee. Robust vi- sual recognition with class-imbalanced open-world noisy data. In AAAI, pages 16989-16997, 2024.
  48. [Zhou et al., 2025] Lihua Zhou, Mao Ye, Shuaifeng Li, Ni- anxin Li, Xiatian Zhu, Lei Deng, Hongbin Liu, and Zhen Lei. Bayesian test-time adaptation for vision-language models. In CVPR, pages 29999-30009, 2025.

References were extracted automatically from the PDF and may contain errors.

Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards