paper-with-me

Papers

Adaptive Debiasing Tsallis Entropy for Test-Time Adaptation

2026-02-12 · Xiangyu Wu, Dongming Jiang, Feng Yu, Yueying Tian, Jiaqi Tang, Qing-Guo Chen, Yang Yang, Jianfeng Lu arxiv

Mainstream Test-Time Adaptation (TTA) methods for adapting vision-language models, e.g., CLIP, typically rely on Shannon Entropy (SE) at test time to measure prediction uncertainty and inconsistency. However, since CLIP has a built-in bias from pretraining on highly imbalanced web-crawled data, SE inevitably results in producing biased estimates of uncertainty entropy. To address this issue, we notably find and demonstrate that Tsallis Entropy (TE), a generalized form of SE, is naturally suited for characterizing biased distributions by introducing a non-extensive parameter q, with the performance of SE serving as a lower bound for TE. Building upon this, we generalize TE into Adaptive Debiasing Tsallis Entropy (ADTE) for TTA, customizing a class-specific parameter q^l derived by normalizing the estimated label bias from continuously incoming test instances, for each category. This adaptive approach allows ADTE to accurately select high-confidence views and seamlessly integrate with a label adjustment strategy to enhance adaptation, without introducing distribution-specific hyperparameter tuning. Besides, our investigation reveals that both TE and ADTE can serve as direct, advanced alternatives to SE in TTA, without any other modifications. Experimental results show that ADTE outperforms state-of-the-art methods on ImageNet and its five variants, and achieves the highest average performance on 10 cross-domain benchmarks, regardless of the model architecture or text prompts used. Our code is available at https://github.com/Jinx630/ADTE.

📄 PDF Abstract BibTeX arXiv:2602.11743

Code (0)

등록된 구현이 없습니다.

Tasks

Test-time Adaptation

Similar Papers 제목 키워드 기반

Tsallis Reinforcement Learning: A Unified Framework for Maximum Entropy Reinforcement Learning

2019-01-31 · Kyungjae Lee, Sungyub Kim, Sungbin Lim, Sungjoon Choi 외

In this paper, we present a new class of Markov decision processes (MDPs), called Tsallis MDPs, with Tsallis entropy maximization, which generalizes existing maximum entropy reinforcement learning (RL). A Tsallis MDP pro…

MuJoCoreinforcement-learningReinforcement LearningReinforcement Learning (RL)

Continuous-time q-Learning for Jump-Diffusion Models under Tsallis Entropy

2024-07-04 · Lijun Bo, YiJie Huang, Xiang Yu, Tingting Zhang

This paper studies the continuous-time reinforcement learning in jump-diffusion models by featuring the q-learning (the continuous-time counterpart of Q-learning) under Tsallis entropy regularization. Contrary to the Sha…

Q-Learning

TsallisPGD: Adaptive Gradient Weighting for Adversarial Attacks on Semantic Segmentation

2026-05-05 · Alexander Matyasko, Xin Lou, Indriyati Atmosukarto, Wei Zhang arxiv

Attacking semantic segmentation models is significantly harder than image classification models because an attacker must flip thousands of pixel predictions simultaneously. Standard pixel-wise cross-entropy (CE) is ill-s…

Semantic SegmentationImage ClassificationAdversarial Attack

Unifying Decision Trees Split Criteria Using Tsallis Entropy

2015-11-25 · Yisen Wang, Chaobing Song, Shu-Tao Xia

The construction of efficient and effective decision trees remains a key topic in machine learning because of their simplicity and flexibility. A lot of heuristic algorithms have been proposed to construct near-optimal d…

A Quantitative Comparison between Shannon and Tsallis Havrda Charvat Entropies Applied to Cancer Outcome Prediction

2022-03-22 · Thibaud Brochet, Jérôme Lapuyade-Lahorgue, Pierre Vera, Su Ruan

In this paper, we propose to quantitatively compare loss functions based on parameterized Tsallis-Havrda-Charvat entropy and classical Shannon entropy for the training of a deep network in the case of small datasets whic…

Image Reconstruction