{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T00:47:21Z","timestamp":1765500441309,"version":"3.48.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","funder":[{"name":"IITP, South Korea","award":["RS-2020-II20137 and RS-2025-25422680"],"award-info":[{"award-number":["RS-2020-II20137 and RS-2025-25422680"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,11,10]]},"DOI":"10.1145\/3746252.3760858","type":"proceedings-article","created":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T18:37:32Z","timestamp":1762799852000},"page":"5161-5165","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards Robust Continual Test-Time Adaptation via Neighbor Filtration"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3920-9314","authenticated-orcid":false,"given":"Taki Hasan","family":"Rafi","sequence":"first","affiliation":[{"name":"Hanyang University, Seoul, Republic of Korea"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-8867-6271","authenticated-orcid":false,"given":"Amit","family":"Agarwal","sequence":"additional","affiliation":[{"name":"Liverpool John Moores University, Liverpool, United Kingdom"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-7492-5173","authenticated-orcid":false,"given":"Hitesh L.","family":"Patel","sequence":"additional","affiliation":[{"name":"New York University, New York, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5410-6391","authenticated-orcid":false,"given":"Dong-Kyu","family":"Chae","sequence":"additional","affiliation":[{"name":"Hanyang University, Seoul, Republic of Korea"}]}],"member":"320","published-online":{"date-parts":[[2025,11,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52688.2022.00816"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52729.2023.00744"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"e_1_3_2_1_4_1","volume-title":"Benchmarking neural network robustness to common corruptions and perturbations. arXiv preprint arXiv:1903.12261","author":"Hendrycks Dan","year":"2019","unstructured":"Dan Hendrycks and Thomas Dietterich. 2019. Benchmarking neural network robustness to common corruptions and perturbations. arXiv preprint arXiv:1903.12261 (2019)."},{"volume-title":"Deep learning with Python: A hands-on introduction","author":"Ketkar Nikhil","key":"e_1_3_2_1_5_1","unstructured":"Nikhil Ketkar. 2017. Stochastic gradient descent. In Deep learning with Python: A hands-on introduction. Springer, 113-132."},{"key":"e_1_3_2_1_6_1","unstructured":"Alex Krizhevsky Geoffrey Hinton et al. 2009. Learning multiple layers of features from tiny images. (2009)."},{"key":"e_1_3_2_1_7_1","volume-title":"Tiny imagenet visual recognition challenge. CS 231N","author":"Le Yann","year":"2015","unstructured":"Yann Le and Xuan Yang. 2015. Tiny imagenet visual recognition challenge. CS 231N, Vol. 7, 7 (2015), 3."},{"key":"e_1_3_2_1_8_1","volume-title":"Entropy is not enough for test-time adaptation: From the perspective of disentangled factors. arXiv preprint arXiv:2403.07366","author":"Lee Jonghyun","year":"2024","unstructured":"Jonghyun Lee, Dahuin Jung, Saehyung Lee, Junsung Park, Juhyeon Shin, Uiwon Hwang, and Sungroh Yoon. 2024. Entropy is not enough for test-time adaptation: From the perspective of disentangled factors. arXiv preprint arXiv:2403.07366 (2024)."},{"key":"e_1_3_2_1_9_1","volume-title":"International conference on machine learning. PMLR, 6028-6039","author":"Liang Jian","year":"2020","unstructured":"Jian Liang, Dapeng Hu, and Jiashi Feng. 2020. Do we really need to access the source data? source hypothesis transfer for unsupervised domain adaptation. In International conference on machine learning. PMLR, 6028-6039."},{"key":"e_1_3_2_1_10_1","volume-title":"Test-time adaptation to distribution shift by confidence maximization and input transformation. arXiv preprint arXiv:2106.14999","author":"Mummadi Chaithanya Kumar","year":"2021","unstructured":"Chaithanya Kumar Mummadi, Robin Hutmacher, Kilian Rambach, Evgeny Levinkov, Thomas Brox, and Jan Hendrik Metzen. 2021. Test-time adaptation to distribution shift by confidence maximization and input transformation. arXiv preprint arXiv:2106.14999 (2021)."},{"key":"e_1_3_2_1_11_1","volume-title":"Evaluating prediction-time batch normalization for robustness under covariate shift. arXiv preprint arXiv:2006.10963","author":"Nado Zachary","year":"2020","unstructured":"Zachary Nado, Shreyas Padhy, D Sculley, Alexander D'Amour, Balaji Lakshminarayanan, and Jasper Snoek. 2020. Evaluating prediction-time batch normalization for robustness under covariate shift. arXiv preprint arXiv:2006.10963 (2020)."},{"key":"e_1_3_2_1_12_1","volume-title":"Proceedings of the AAAI conference on artificial intelligence","volume":"29","author":"Naeini Mahdi Pakdaman","year":"2015","unstructured":"Mahdi Pakdaman Naeini, Gregory Cooper, and Milos Hauskrecht. 2015. Obtaining well calibrated probabilities using bayesian binning. In Proceedings of the AAAI conference on artificial intelligence, Vol. 29."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3627673.3679801"},{"key":"e_1_3_2_1_14_1","volume-title":"International conference on machine learning. PMLR, 16888-16905","author":"Niu Shuaicheng","year":"2022","unstructured":"Shuaicheng Niu, Jiaxiang Wu, Yifan Zhang, Yaofo Chen, Shijian Zheng, Peilin Zhao, and Mingkui Tan. 2022. Efficient test-time model adaptation without forgetting. In International conference on machine learning. PMLR, 16888-16905."},{"key":"e_1_3_2_1_15_1","volume-title":"arXiv preprint arXiv:2403.11675","author":"Porcher Fran\u00e7ois","year":"2024","unstructured":"Fran\u00e7ois Porcher, Camille Couprie, Marc Szafraniec, and Jakob Verbeek. 2024. Better (pseudo-) labels for semi-supervised instance segmentation. arXiv preprint arXiv:2403.11675 (2024)."},{"key":"e_1_3_2_1_16_1","volume-title":"Improving robustness against common corruptions by covariate shift adaptation. Advances in neural information processing systems","author":"Schneider Steffen","year":"2020","unstructured":"Steffen Schneider, Evgenia Rusak, Luisa Eck, Oliver Bringmann, Wieland Brendel, and Matthias Bethge. 2020. Improving robustness against common corruptions by covariate shift adaptation. Advances in neural information processing systems, Vol. 33 (2020), 11539-11551."},{"key":"e_1_3_2_1_17_1","volume-title":"Alexey Kurakin, and Chun-Liang Li.","author":"Sohn Kihyuk","year":"2020","unstructured":"Kihyuk Sohn, David Berthelot, Nicholas Carlini, Zizhao Zhang, Han Zhang, Colin A Raffel, Ekin Dogus Cubuk, Alexey Kurakin, and Chun-Liang Li. 2020. Fixmatch: Simplifying semi-supervised learning with consistency and confidence. Advances in neural information processing systems, Vol. 33 (2020), 596-608."},{"key":"e_1_3_2_1_18_1","volume-title":"International conference on machine learning. PMLR, 9229-9248","author":"Sun Yu","year":"2020","unstructured":"Yu Sun, Xiaolong Wang, Zhuang Liu, John Miller, Alexei Efros, and Moritz Hardt. 2020. Test-time training with self-supervision for generalization under distribution shifts. In International conference on machine learning. PMLR, 9229-9248."},{"key":"e_1_3_2_1_19_1","volume-title":"Mean teachers are better role models: Weight-averaged consistency targets improve semi-supervised deep learning results. Advances in neural information processing systems","author":"Tarvainen Antti","year":"2017","unstructured":"Antti Tarvainen and Harri Valpola. 2017. Mean teachers are better role models: Weight-averaged consistency targets improve semi-supervised deep learning results. Advances in neural information processing systems, Vol. 30 (2017)."},{"key":"e_1_3_2_1_20_1","volume-title":"Tent: Fully test-time adaptation by entropy minimization. arXiv preprint arXiv:2006.10726","author":"Wang Dequan","year":"2020","unstructured":"Dequan Wang, Evan Shelhamer, Shaoteng Liu, Bruno Olshausen, and Trevor Darrell. 2020. Tent: Fully test-time adaptation by entropy minimization. arXiv preprint arXiv:2006.10726 (2020)."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52688.2022.00706"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/WACV57701.2024.00172"},{"key":"e_1_3_2_1_23_1","volume-title":"Memo: Test time robustness via adaptation and augmentation. Advances in neural information processing systems","author":"Zhang Marvin","year":"2022","unstructured":"Marvin Zhang, Sergey Levine, and Chelsea Finn. 2022. Memo: Test time robustness via adaptation and augmentation. Advances in neural information processing systems, Vol. 35 (2022), 38629-38642."}],"event":{"name":"CIKM '25: The 34th ACM International Conference on Information and Knowledge Management","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Seoul Republic of Korea","acronym":"CIKM '25"},"container-title":["Proceedings of the 34th ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3746252.3760858","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T00:44:27Z","timestamp":1765500267000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3746252.3760858"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,10]]},"references-count":23,"alternative-id":["10.1145\/3746252.3760858","10.1145\/3746252"],"URL":"https:\/\/doi.org\/10.1145\/3746252.3760858","relation":{},"subject":[],"published":{"date-parts":[[2025,11,10]]},"assertion":[{"value":"2025-11-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}