Multi-Label Test-Time Adaptation with Bayesian Conditional Priors

• URL: http://arxiv.org/abs/2606.12925v1
• Date: Thu, 11 Jun 2026 05:29:00 GMT
• Title: Multi-Label Test-Time Adaptation with Bayesian Conditional Priors
• Abstract summary: Conditional Priors Estimation (BCP) is a gradient-free test-time adaptation method that injects label dependency without tuning the backbone.<n>BCP operates without target annotations by estimating anchor-conditioned priors online from the unlabeled test stream.<n>BCP consistently outperforms strong TTA baselines across standard multi-label benchmarks and multiple CLIP backbones.
• Score: 15.878958356965159
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Multi-label recognition with frozen Vision-Language Models (VLMs) is brittle under distribution shift: standard zero-shot inference scores labels independently, ignoring co-occurrence structure and producing incoherent label sets where dominant concepts suppress weaker but compatible labels. We introduce Bayesian Conditional Priors (BCP) Estimation, a gradient-free test-time adaptation method that injects label dependency without tuning the backbone. BCP views zero-shot logits as a proxy for marginal posteriors under a fixed image-text likelihood and attributes shift-induced errors mainly to a mismatched label prior. For each test image, it selects a high-confidence anchor label and applies an anchor-conditioned Bayesian refinement. This update is closed-form in logit space and admits a pointwise mutual information (PMI) interpretation, explicitly promoting compatible labels and suppressing incompatible ones. BCP operates without target annotations by estimating anchor-conditioned priors online from the unlabeled test stream via lightweight second-order co-occurrence statistics, adding negligible overhead beyond a single forward pass. Across standard multi-label benchmarks and multiple CLIP backbones, BCP consistently outperforms strong TTA baselines, e.g., improving RN50 average mAP from 57.31 to 69.22 and ViT-B/16 from 62.61 to 71.79.

Related papers

• Discourse-Role Labels as Presentation-Time Variables for Context Use in Language Models [3.376024929309146]
  We study the effect of Context-augmented language model systems on reader-model behavior.<n>We introduce a paired fixed-content probe over 500 MMLU-Pro items.<n>Each item receives the same misleading answer-bearing assertion under different discourse-role labels.<n>Across GPT-5.5, DeepSeek V4 Pro, Llama-3-8B-Instruct, and Qwen2.5-7B-Instruct, Misleading Adoption Rate shifts by 56-84 percentage points.
  arXiv  Detail & Related papers  (2026-06-02T18:12:57Z)
• Metric-Dependent Annotation Saturation for Learning from Label Distributions [0.0]
  We fine-tune NLI models on label distributions subsampled from ChaosNLI.<n>In our 3-class NLI setting, entropy correlation requires N 20-50 annotators to converge.<n>Soft labels carry item-specific signal that label smoothing cannot replicate.
  arXiv  Detail & Related papers  (2026-05-28T11:46:51Z)
• LATA: Laplacian-Assisted Transductive Adaptation for Conformal Uncertainty in Medical VLMs [61.06744611795341]
  Medical vision-language models (VLMs) are strong zero-shot recognizers for medical imaging.<n>We propose texttttextbfLATA (Laplacian-Assisted Transductive Adaptation), a textittraining- and label-free refinement.<n>texttttextbfLATA sharpens zero-shot predictions without compromising exchangeability.
  arXiv  Detail & Related papers  (2026-02-19T16:45:38Z)
• Multi-Label Test-Time Adaptation with Bound Entropy Minimization [12.13471668494843]
  We develop Bound Entropy Minimization (BEM) to simultaneously increase the confidence of multiple top predicted labels.<n>Across the MSCOCO, VOC, and NUSWIDE multi-label datasets, our ML--TTA framework exhibits superior performance compared to the latest SOTA methods.
  arXiv  Detail & Related papers  (2025-02-06T04:52:16Z)
• Reduction-based Pseudo-label Generation for Instance-dependent Partial Label Learning [41.345794038968776]
  We propose to leverage reduction-based pseudo-labels to alleviate the influence of incorrect candidate labels. We show that reduction-based pseudo-labels exhibit greater consistency with the Bayes optimal classifier compared to pseudo-labels directly generated from the predictive model.
  arXiv  Detail & Related papers  (2024-10-28T07:32:20Z)
• Appeal: Allow Mislabeled Samples the Chance to be Rectified in Partial Label Learning [55.4510979153023]
  In partial label learning (PLL), each instance is associated with a set of candidate labels among which only one is ground-truth. To help these mislabeled samples "appeal," we propose the first appeal-based framework.
  arXiv  Detail & Related papers  (2023-12-18T09:09:52Z)
• Generating Unbiased Pseudo-labels via a Theoretically Guaranteed Chebyshev Constraint to Unify Semi-supervised Classification and Regression [57.17120203327993]
  threshold-to-pseudo label process (T2L) in classification uses confidence to determine the quality of label. In nature, regression also requires unbiased methods to generate high-quality labels. We propose a theoretically guaranteed constraint for generating unbiased labels based on Chebyshev's inequality.
  arXiv  Detail & Related papers  (2023-11-03T08:39:35Z)
• Exploiting Completeness and Uncertainty of Pseudo Labels for Weakly Supervised Video Anomaly Detection [149.23913018423022]
  Weakly supervised video anomaly detection aims to identify abnormal events in videos using only video-level labels. Two-stage self-training methods have achieved significant improvements by self-generating pseudo labels. We propose an enhancement framework by exploiting completeness and uncertainty properties for effective self-training.
  arXiv  Detail & Related papers  (2022-12-08T05:53:53Z)
• Dist-PU: Positive-Unlabeled Learning from a Label Distribution Perspective [89.5370481649529]
  We propose a label distribution perspective for PU learning in this paper. Motivated by this, we propose to pursue the label distribution consistency between predicted and ground-truth label distributions. Experiments on three benchmark datasets validate the effectiveness of the proposed method.
  arXiv  Detail & Related papers  (2022-12-06T07:38:29Z)
• DSLA: Dynamic smooth label assignment for efficient anchor-free object detection [18.043176234010517]
  Anchor-free detectors basically formulate object detection as dense classification and regression. It is common to introduce an individual prediction branch to estimate the quality of localization. The following inconsistencies are observed when we delve into the practices of classification and quality estimation.
  arXiv  Detail & Related papers  (2022-08-01T12:56:44Z)
• In Defense of Pseudo-Labeling: An Uncertainty-Aware Pseudo-label Selection Framework for Semi-Supervised Learning [53.1047775185362]
  Pseudo-labeling (PL) is a general SSL approach that does not have this constraint but performs relatively poorly in its original formulation. We argue that PL underperforms due to the erroneous high confidence predictions from poorly calibrated models. We propose an uncertainty-aware pseudo-label selection (UPS) framework which improves pseudo labeling accuracy by drastically reducing the amount of noise encountered in the training process.
  arXiv  Detail & Related papers  (2021-01-15T23:29:57Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.