Dynamic Distribution-Aware Uncertainty Tracking in Vision-Language Representation Learning

Ao Zhou; Cong Wang; Haoru Chen; Qing Gu; Shufan Yang; Zhiwei Jiang; Zifeng Cheng

REVIEW 5 major objections 5 minor 51 references

Dynamic Distribution-Aware Uncertainty Tracking in Vision-Language Representation Learning

T0 review · 5 major / 5 minor · reviewed 2026-08-14 · deepseek-v4-flash

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

Pith's one-line read DDA-UQ replaces static embedding-to-risk mappings with a dynamically updated Gaussian mixture and reports consistently better failure prediction across shifted, multi-label, and OOD test sets.

desk verdict DDA-UQ is a plausible and well-tested extension of post-hoc VLM uncertainty quantification, but the paper overstates its evidence for the dynamic test-time mechanism and has a concrete OOD-table inconsistency. read the letter →

arxiv 2608.09011 v1 pith:JEUOOXQU submitted 2026-08-10 cs.LG

Ao Zhou , Zhiwei Jiang , Zifeng Cheng , Cong Wang , Shufan Yang , Haoru Chen , Qing Gu This is my paper · ORCID

classification cs.LG

keywords uncertaintyquantificationvision-languagemodelsdistributionshiftGaussianmixturemodeltest-timeadaptationfailurepredictionout-of-distributiondetectionpost-hocmethods

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

The paper argues that post-hoc uncertainty estimates for vision-language models fail because they are static: they learn a fixed mapping from embeddings to risk scores on the source distribution, and that mapping breaks when the test distribution changes. It proposes DDA-UQ, which instead models the CLIP embedding space as a Gaussian mixture, extracts per-sample density and boundary-ambiguity evidence from that mixture, and updates the mixture's statistics online during inference from unlabeled test data. Across standard benchmarks, distribution-shifted variants of ImageNet and CIFAR, multi-label datasets, and OOD scenarios, the paper reports that DDA-UQ outperforms prior methods including the static ViLU baseline. A sympathetic reader would care because the method promises lightweight, post-hoc uncertainty that stays calibrated under the distribution shifts that real deployments encounter.

What carries the argument

The carrying mechanism is a Gaussian Mixture Model over CLIP's visual embedding space, with a shared covariance matrix across classes. From it the method extracts two evidence signals: the negative log-likelihood $\tilde{E}_{\mathrm{den}}(x)$ measuring distributional typicality, and the posterior entropy $\tilde{E}_{\mathrm{amb}}(x)$ measuring aleatoric ambiguity near decision boundaries. A gating network turns this evidence into per-sample scale-and-shift parameters that recalibrate the visual features, which then feed a two-layer MLP that outputs the uncertainty score in $(0,1)$. During training the mixture is updated with soft supervised responsibilities, and during inference the responsibility reduces to the zero-shot posterior, so statistics adapt online while the prediction head stays frozen.

What would settle it

Construct a shifted test set where one class splits into two visually distinct clusters (for example, 'bird' spanning waterfowl and songbirds) while another class stays compact; if DDA-UQ's AUC for failure prediction drops below ViLU's or below the static MCM baseline on that set, the single-Gaussian-per-class approximation is the failing link.

Watch

Extended reading notes

Core claim

The central claim is that uncertainty quantification for VLMs should be reframed from a sample-level decision problem into a distribution-level modeling problem: instead of learning a static embedding-to-risk map, the system fits a Gaussian Mixture Model to class-conditional CLIP embeddings, derives a two-dimensional evidence vector (negative log-likelihood density and posterior entropy), conditions the visual embedding on that evidence through a gating network, and predicts the uncertainty score with a lightweight MLP. At inference, the GMM statistics are updated via exponential moving average on unlabeled test samples, effectively performing streaming expectation-maximization, so the uncertainty estimates track the target distribution rather than the training one. The paper's own empirical claim is that this consistently achieves the best failure-prediction performance across all tested distributions, and that the adaptive variant does so even at batch size one.

Load-bearing premise

The load-bearing premise is that each class's CLIP embeddings are well approximated by a single bell-shaped cluster with one shared spread, so that the likelihood and entropy computed from that mixture are trustworthy failure signals, and that updating only those cluster statistics at test time is enough to track distribution shift.

Editorial extensions

If this is right

Failure prediction under distribution shift no longer requires retraining the uncertainty module; updating the Gaussian mixture statistics from the test stream is the adaptation mechanism.
The same trained module transfers across five CLIP backbones and to multi-label and OOD tasks without architectural changes, according to the paper's experiments.
Because the method works at batch size one, it can be deployed in streaming, resource-constrained settings where large test buffers are unavailable.
The soft risk labels derived from semantic severity and top-2 margin make training sample-efficient, reaching strong performance with only a fraction of the training data.

Reading between the lines

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

The shared-covariance assumption is the most exposed point: should a shifted distribution make one class markedly broader or multi-modal, the single-Gaussian-per-class approximation could mis-rank failures; a natural extension is class-specific low-rank covariances.
Because the evidence vector is generic (density plus ambiguity), the same framework could plausibly be dropped into other contrastive vision-language backbones without retraining the head, but the paper only tests a CLIP variant.
The dynamic GMM update might also serve as a calibration signal for downstream tasks such as selective prediction or active learning, where the uncertainty score could drive data acquisition; the paper does not pursue these uses.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Desk Editor's Note

read the letter

The combination here is genuinely new relative to ViLU, Doctor, and ProbVLM: GMM-derived density and ambiguity evidence, injected into CLIP visual features through per-channel gating, supervised with continuous soft risk labels, and updated online at test time via EMA on the GMM sufficient statistics. Each component has precedents, but putting them together for VLM failure prediction is not something I have seen. The experimental scope is also broader than most UQ papers: five in-distribution benchmarks, seven distribution-shift settings, multi-label, OOD, backbone generalization, and ablations. The adaptation variant works even at batch size 1, which is a nice practical property. Credit where due: this is a serious engineering effort with a coherent story.

Now the soft spots, roughly in proportion to how much they bother me. First, the OOD section says the method outperforms ViLU on DTD, SVHN, and Places365, but Table 5 has no ViLU row and no error bars. That is a concrete inconsistency, not a nitpick. Second, Ours (Base) uses full test-set statistics, so the Table 1 and Table 2 comparisons to static baselines are not clean. The Adaptation variant is the fair one, and it still wins, so the paper can be fixed by making Adaptation primary and demoting Base to an upper-bound reference. Third, the stress-test concern about the test-time self-update is legitimate. At inference, the GMM is updated with responsibilities that come from the GMM itself, so the evidence vector and the features fed to the frozen head depend on a self-training loop. Without a frozen-GMM control on shifted data, the reported shift gains are not actually attributable to the dynamic mechanism. The ablation with dynamic updates is only on in-distribution Caltech101. That is the load-bearing gap. I would not call it fatal, because the method as a whole performs well and the TTA-enhanced baselines in Table 3 partially address fairness, but the paper needs a frozen-GMM variant and ideally some analysis of pseudo-label drift under shift. Fourth, the soft labels for correct samples use the top-2 margin of the GMM posterior, and the evidence vector includes entropy of the same posterior, so there is some mild circularity in-distribution. Minor, but worth a sentence. I also cannot verify the key derivations because they are in appendices not available here, and there is no released code.

Who is this for: researchers working on failure prediction and calibration for CLIP-style models, especially in deployment settings where test-time adaptation is allowed. It deserves a serious referee. The right outcome is probably a major revision, not rejection. I would send it to peer review and ask for the OOD table fix, a frozen-GMM control, and the code.

Referee Report

5 major / 5 minor

Summary. The paper proposes DDA-UQ, a post-hoc uncertainty quantification framework for zero-shot CLIP classification. The method models class-conditional CLIP embedding distributions with a Gaussian mixture, extracts two evidence signals (negative log-likelihood as density typicality and GMM posterior entropy as ambiguity), fuses these signals into visual features through a gating network, and trains a lightweight risk head with soft targets. At inference, the GMM statistics are updated online by an EMA mechanism using posterior responsibilities, with the prediction head frozen. The authors evaluate the method on standard benchmarks, distribution-shift settings, test-time-adaptation baselines, multi-label datasets, OOD detection, and multiple backbones, and claim consistent state-of-the-art failure-prediction performance.

Significance. The paper has a clear and useful motivation: static embedding-to-risk mappings degrade under distribution shift, and a lightweight, test-time-adaptive uncertainty estimator for VLMs would be practically valuable. The empirical scope is broad, covering five standard benchmarks, seven shift settings, multi-label data, OOD detection, five backbones, ablations, and efficiency analyses. The soft-label formulation and the distributional evidence vector are interesting departures from binary failure supervision. If the dynamic GMM update is shown to be the actual cause of the reported gains, DDA-UQ would be a meaningful contribution. However, several experimental-protocol and reporting gaps currently prevent the headline claims from being fully supported.

major comments (5)

[4.3, Algorithm 1 (lines 5–7), Table 2] The online variant updates the GMM with responsibilities r_c(x) from Eq. (12) under lambda=0, i.e., the posterior of the very GMM being updated. No frozen-GMM inference control is reported in Table 2, and the Table 6 ablation of "dynamic GMM Updates" is performed only on in-distribution Caltech101, not under shift. Because the central claim is that test-time updates improve robustness to distribution shift, the shift gains could be explained by the GMM having access to target statistics rather than by the pseudo-label self-update. Please add a frozen-GMM control (GMM statistics estimated from the training set and never updated) and, ideally, an oracle-responsibility control, evaluated on ImageNet-R and ImageNet-C.
[Implementation Details and Table 1] Ours (Base) is defined as accessing the entire test set offline to estimate distribution statistics, whereas the static baselines are trained only on source data. Reporting Ours (Base) in Table 1 as a main comparison therefore gives the proposed method access to test-set information that ViLU, MCM, Doctor, and other baselines do not have. This makes the in-distribution "outperforms ViLU" claim not apples-to-apples. Please either report a variant whose GMM statistics are estimated from the training split only, or explicitly present Ours (Base) as a transductive upper bound and base the main comparison on the fair variant.
[5 (Applied to OOD scenarios) and Table 5] The text states that DDA-UQ outperforms ViLU on DTD, SVHN, and Places365, but ViLU is not listed in Table 5, and no standard deviations are reported for the OOD results. Without the ViLU row and repeated-run variability, the OOD claim is unsupported as presented. Please add the ViLU baseline and error bars, and state how many runs the OOD numbers are averaged over.
[4.3, Appendix A.3, and Eq. (8)] For correctly classified samples, the soft target is derived from the top-2 margin of the GMM posterior, while the evidence vector e(x) includes the entropy of that same posterior (Eq. 8). The prediction head therefore receives input features that are functions of the GMM posterior and is trained to output a label that is also a function of that posterior. Part of the reported in-distribution gain may reflect this circular dependence rather than genuine failure-prediction ability. Please provide an ablation with hard 0/1 targets while keeping the same evidence vector, and/or decouple the soft-label margin from the evidence entropy by computing them on held-out GMM statistics.
[3.2 and Section 5.1 Q2] The method relies on a Gaussian approximation that the authors themselves concede is not strict in high dimensions. The rebuttal in Q2 appeals to low-dimensional semantic manifolds and supporting citations, but no quantitative diagnostic is provided for CLIP embeddings. Please add evidence such as a covariance spectrum, a chi-square plot, or a comparison of GMM-derived density with a nonparametric density estimate, or otherwise moderate the claim that first/second-order statistics are sufficient.

minor comments (5)

[Table 3] The table uses "Ours (Full)" while the rest of the paper uses "Ours (Adaptation)"; please unify the naming to avoid confusion.
[Section 4.3] The statement that the EMA update is "mathematically equivalent" to streaming EM (Appendix A.2) is asserted rather than shown; please provide the derivation or soften the wording.
[Appendices] The text repeatedly references Appendix A.1, A.2, A.3, and A.4, but these appendices are not included in the submitted manuscript. Please ensure all referenced material is present in the revision.
[Figure 1] The caption contains the typo "naturallynximages"; please correct it.
[Abstract] The phrase "VVLMs' embedding space" in the abstract appears to be a typo for "VLMs' embedding space".

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: GMM-based evidence and soft targets share a posterior source, but hard-correctness evaluation, held-out data, and external baselines keep the central claim independently checkable.

full rationale

Walking the claimed derivation chain, I find no step in which a 'prediction' is equal by construction to its fitted input. The GMM (Eqs. 2-6) is estimated from unlabeled embeddings; E_den and E_amb (Eqs. 7-8) are negative log-likelihood and posterior entropy; the head is optimized with cross-entropy against a soft target that is partly derived from the Gaussian discriminant posterior (Sec. 4.3). Even if the correct-sample fragility margin is computed from the same posterior that supplies E_amb, the hard 0/1 correctness branch and the held-out AUC/FPR95 evaluation are external to the GMM, so the model is not merely reconstructing its own inputs. The inference-time EMA update with lambda=0 is a streaming EM self-consistency loop that incorporates new test features; it is an algorithmic choice, not a definitional equivalence, and the absence of a frozen-GMM control is an attribution gap rather than a circularity. The paper explicitly concedes the Gaussian assumption is approximate (Sec. 5.1 Q2: 'no strict multivariate Gaussian exists in high dimensions') and defers the soft-label derivation to Appendix A.3, which is not present in the supplied text; these are support and completeness concerns, not circularity. Self-citations ([22], [45]) are related-work pointers and are not load-bearing. The central comparison against external baselines (ViLU, MCM, DOTA, etc.) keeps the empirical claim independently checkable.

Assumptions & free parameters 4 free parameters · 6 assumptions · 0 invented entities

The method introduces no new physical or mathematical entities; it constructs an evidence vector from existing GMM quantities. The free parameters and assumptions above are the main elements the central claim rests on that the reader does not derive from first principles.

free parameters (4)

lambda (supervision strength in gate responsibility r_c) = not reported
Controls how strongly the ground-truth label biases GMM updates during training (Eq. 12). No value or sensitivity analysis is given in the main text.
EMA momentum for GMM updates = not reported
Determines adaptation speed of means and covariances in Algorithm 1 Step 1. Not specified in the main text.
Number of GMM components K = K = C (number of classes)
Chosen by sensitivity analysis in Section 5.3. Performance improves as K increases and stabilizes near C.
Soft-label scaling constants for semantic severity and predictive fragility = not reported
Soft target construction in Section 4.3 deferred to Appendix A.3. Constants and functional form are absent from the main text.

assumptions (6)

domain assumption Class-conditional CLIP embeddings follow an approximately multivariate Gaussian distribution.
Section 3.2 and Section 5.1 Q2. Authors rely on references [40,43,47] and concede strict Gaussianity does not hold.
domain assumption A single shared covariance matrix captures the relevant distribution geometry across all classes.
Section 3.2: 'we adopt a shared covariance matrix across all semantic classes.' This reduces the discriminant to a linear function of the class means.
domain assumption CLIP embeddings have low intrinsic dimensionality, making GMM estimation tractable.
Section 5.1 Q2: 'CLIP embeddings reside on low-dimensional semantic manifolds.' Needed to justify high-dimensional density estimation.
ad hoc to paper Soft targets defined by semantic severity and predictive fragility are valid calibration labels.
Section 4.3 and Appendix A.3. The labels are constructed by the authors and their derivation is not in the main text.
domain assumption EMA updates are equivalent to streaming EM and improve distribution estimates.
Algorithm 1 and Appendix A.2. Asserted equivalence is not demonstrated in the supplied text.
domain assumption Frozen prediction head with updated GMM statistics is sufficient for test-time adaptation.
Section 4.3 inference phase: only GMM statistics are updated, the predictor is frozen. This is a design choice whose sufficiency is not proven.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Dynamic Distribution-Aware Uncertainty Tracking in Vision-Language Representation Learning." pith.science (2026). https://pith.science/paper/JEUOOXQU

@misc{pith2026260809011,
  author       = {Pith},
  title        = {Pith review of: Dynamic Distribution-Aware Uncertainty Tracking in Vision-Language Representation Learning},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/JEUOOXQU}},
  note         = {Machine review of arXiv:2608.09011}
}

read the original abstract

Uncertainty Quantification (UQ) aims to measure the reliability of model predictions, serving as a critical safeguard for deploying Vision-Language Models (VLMs) in safety-critical scenarios. Post-hoc approaches are widely adopted due to their lightweight nature, mapping the outputs of VLMs to uncertainty measures through learnable modules or inductive summarization. However, Post-hoc approaches remain inherently confined to fitting the failure patterns of the source domain, ignoring the dynamic nature of test distributions. To address this challenge, we propose a Dynamic Distribution-Aware Uncertainty Quantification framework (DDA-UQ) that shifts the paradigm from static mapping to a dynamic distribution-aware process. During training, we leverage a Gaussian Mixture Model to model the VVLMs'embedding space and extract distributional evidence, thereby dynamically deriving uncertainty estimates. During inference, the design dynamically responds to changes in the data distribution. Extensive experiments demonstrate that our approach significantly outperforms state-of-the-art methods.

Figures

Figures reproduced from arXiv: 2608.09011 by the authors.

**Figure 2.** Framework overview. We model VLM outputs as a Gaussian mixture distribution updated with incoming streams. [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗

**Figure 3.** Generalization performance of different methods [PITH_FULL_IMAGE:figures/full_fig_p007_3.png] view at source ↗

Figures from the paper (2 more)

**Figure 5.** Figure 5: , our framework demonstrates remarkable efficiency in both training and inference phases. First, regarding training efficiency (Figure 5a), our method rapidly converges, surpassing the strong zero-shot baseline (MCM) using as little as 20% of the training data. We at…

**Figure 4.** Figure 4: Uncertainty Score Distributions on ImageNet and [PITH_FULL_IMAGE:figures/full_fig_p008_4.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

51 extracted references · 39 canonical work pages

[1]

Jihwan Bang, Sumyeong Ahn, and Jae-Gil Lee. 2024. Active prompt learning in vision language models. InProceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. 27004–27014

work page 2024
[2]

Anton Baumann, Rui Li, Marcus Klasson, Santeri Mentu, Shyamgopal Karthik, Zeynep Akata, Arno Solin, and Martin Trapp. 2024. Post-hoc probabilistic vision- language models.arXiv preprint arXiv:2412.06014(2024)

arXiv 2024
[3]

Luke Chen, Junyao Wang, Trier Mortlock, Pramod Khargonekar, and Moham- mad Abdullah Al Faruque. 2025. Hyperdimensional uncertainty quantification for multimodal uncertainty fusion in autonomous vehicles perception. InProceedings of the Computer Vision and Pattern Recognition Conference. 22306–22316

work page 2025
[4]

Sanghyuk Chun. [n. d.]. Improved Probabilistic Image-Text Representations. In The Twelfth International Conference on Learning Representations

work page
[5]

Zheng Ding, Jieke Wang, and Zhuowen Tu. 2023. Open-vocabulary universal image segmentation with MaskCLIP. InProceedings of the 40th International Conference on Machine Learning. 8090–8102

work page 2023
[6]

Nikita Durasov, Timur Bagautdinov, Pierre Baque, and Pascal Fua. 2021. Masksem- bles for uncertainty estimation. InProceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. 13539–13548

work page 2021
[7]

Yarin Gal and Zoubin Ghahramani. 2016. Dropout as a bayesian approximation: Representing model uncertainty in deep learning. Ininternational conference on machine learning. PMLR, 1050–1059

2016
[8]

Eduardo Dadalto Câmara Gomes, Marco Romanelli, Georg Pichler, and Pablo Pi- antanida. 2023. A data-driven measure of relative uncertainty for misclassification detection. InThe Twelfth International Conference on Learning Representations

work page 2023

Show all 51 references

[9]

Federica Granese, Marco Romanelli, Daniele Gorla, Catuscia Palamidessi, and Pablo Piantanida. 2021. Doctor: A simple method for detecting misclassification errors.Advances in Neural Information Processing Systems34 (2021), 5669–5681

2021
[10]

Klaus Greff, Sjoerd Van Steenkiste, and Jürgen Schmidhuber. 2017. Neural ex- pectation maximization.Advances in neural information processing systems30 (2017)

2017
[11]

Chuan Guo, Geoff Pleiss, Yu Sun, and Kilian Q Weinberger. 2017. On calibration of modern neural networks. InInternational conference on machine learning. PMLR, 1321–1330

2017
[12]

Yongbin Guo, Shuzhen Li, Zhulin Liu, Tong Zhang, and CL Philip Chen. 2025. A Parameter-Efficient and Fine-Grained Prompt Learning for Vision-Language Models. InProceedings of the 63rd Annual Meeting of the Association for Computa- tional Linguistics (Volume 1: Long Papers). 31...

2025
[13]

Zongbo Han, Jialong Yang, Guangyu Wang, Junfan Li, Qianli Xu, Mike Zheng Shou, and Changqing Zhang. 2025. Dota: Distributional test-time adaptation of vision-language models.Advances in Neural Information Processing Systems (2025)

2025
[14]

Marton Havasi, Rodolphe Jenatton, Stanislav Fort, Jeremiah Zhe Liu, Jasper Snoek, Balaji Lakshminarayanan, Andrew Mingbo Dai, and Dustin Tran. [n. d.]. Training independent subnetworks for robust prediction. InInternational Conference on Learning Representations
[15]

Wenchong He, Zhe Jiang, Tingsong Xiao, Zelin Xu, and Yukun Li. 2025. A survey on uncertainty quantification methods for deep learning.Comput. Surveys(2025)

2025
[16]

Michael Kirchhof, Mark Collier, Seong Joon Oh, and Enkelejda Kasneci. 2024. Pretrained visual uncertainties.arXiv preprint arXiv:2402.16569(2024)

2024 arXiv
[17]

Frank Klinker. 2011. Exponential moving average versus moving exponential average.Mathematische Semesterberichte58, 1 (2011), 97–107

2011
[18]

Marc Lafon, Yannis Karmim, Julio Silva-Rodríguez, Paul Couairon, Clément Rambour, Raphaël Fournier-Sniehotta, Ismail Ben Ayed, Jose Dolz, and Nicolas Thome. 2025. ViLU: Learning vision-language uncertainties for failure prediction. InProceedings of the IEEE/CVF International C...

2025
[19]

Mengcheng Lan, Chaofeng Chen, Yiping Ke, Xinjiang Wang, Litong Feng, and Wayne Zhang. 2024. Proxyclip: Proxy attention improves clip for open-vocabulary segmentation. InEuropean Conference on Computer Vision. Springer, 70–88

2024
[20]

Hugo Laurençon, Léo Tronchon, Matthieu Cord, and Victor Sanh. 2024. What matters when building vision-language models?Advances in Neural Information Processing Systems37 (2024), 87874–87907

2024
[21]

Junnan Li, Dongxu Li, Silvio Savarese, and Steven Hoi. 2023. Blip-2: Bootstrapping language-image pre-training with frozen image encoders and large language models. InInternational conference on machine learning. PMLR, 19730–19742

2023
[22]

Qiru Li, Ao Zhou, Zhiwei Jiang, Zifeng Cheng, Cong Wang, Yafeng Yin, and Qing Gu. 2026. Multi-Label Test-Time Adaptation with Bayesian Conditional Priors. arXiv preprint arXiv:2606.12925(2026)

2026 arXiv
[23]

Shawn Li, Huixian Gong, Hao Dong, Tiankai Yang, Zhengzhong Tu, and Yue Zhao
[24]

Xixi Liu, Yaroslava Lochman, and Christopher Zach. 2023. Gen: Pushing the limits of softmax-based out-of-distribution detection. InProceedings of the IEEE/CVF conference on computer vision and pattern recognition. 23946–23955

2023
[25]

Yifei Ming, Ziyang Cai, Jiuxiang Gu, Yiyou Sun, Wei Li, and Yixuan Li. 2022. Delving into out-of-distribution detection with vision-language representations. Advances in neural information processing systems35 (2022), 35087–35102

2022
[26]

Todd K Moon. 1996. The expectation-maximization algorithm.IEEE Signal processing magazine13, 6 (1996), 47–60

1996
[27]

Balamurali Murugesan, Julio Silva-Rodríguez, Ismail Ben Ayed, and Jose Dolz
[28]

Boyang Peng, Sanqing Qu, Tianpei Zou, Fan Lu, Ya Wu, Kai Chen, Siheng Chen, Yong Wu, and Guang Chen. [n. d.]. OOD-Barrier: Build a Middle-Barrier for Open-Set Single-Image Test Time Adaptation via Vision Language Models. In The Thirty-ninth Annual Conference on Neural Informat...
[29]

Alec Radford, Jong Wook Kim, Chris Hallacy, Aditya Ramesh, Gabriel Goh, Sandhini Agarwal, Girish Sastry, Amanda Askell, Pamela Mishkin, Jack Clark, et al. 2021. Learning transferable visual models from natural language supervision. InInternational conference on machine learnin...

2021
[30]

Thomas Savage, John Wang, Robert Gallo, Abdessalem Boukil, Vishwesh Patel, Seyed Amir Ahmad Safavi-Naini, Ali Soroush, and Jonathan H Chen. 2025. Large language model uncertainty proxies: discrimination and calibration for medical diagnosis and treatment.Journal of the America...

2025
[31]

Murat Sensoy, Lance Kaplan, and Melih Kandemir. 2018. Evidential deep learning to quantify classification uncertainty.Advances in neural information processing systems31 (2018)

2018
[32]

Ola Shorinwa, Zhiting Mei, Justin Lidard, Allen Z Ren, and Anirudha Majumdar
[33]

Yiyou Sun, Yifei Ming, Xiaojin Zhu, and Yixuan Li. 2022. Out-of-distribution detection with deep nearest neighbors. InInternational conference on machine learning. PMLR, 20827–20840

2022
[34]

Christian Tomani, Futa Kai Waseda, Yuesong Shen, and Daniel Cremers. 2023. Beyond in-domain scenarios: Robust density-aware calibration. InInternational Conference on Machine Learning. PMLR, 34344–34368

2023
[35]

Surveys(2025)

A survey on uncertainty quantification of large language models: Taxonomy, open research challenges, and future directions.Comput. Surveys(2025)

2025
[36]

Uddeshya Upadhyay, Shyamgopal Karthik, Massimiliano Mancini, and Zeynep Akata. 2023. Probvlm: Probabilistic adapter for frozen vison-language models. In Proceedings of the IEEE/CVF International Conference on Computer Vision. 1899– 1910

2023
[37]

Jiamian Wang, Guohao Sun, Pichao Wang, Dongfang Liu, Sohail Dianat, Majid Rabbani, Raghuveer Rao, and Zhiqiang Tao. 2024. Text is mass: Modeling as stochastic embedding for text-video retrieval. InProceedings of the IEEE/CVF conference on computer vision and pattern recognitio...

2024
[38]

Weijie Tu, Weijian Deng, Dylan Campbell, Stephen Gould, and Tom Gedeon. 2024. An empirical study into what matters for calibrating vision-language models. In International Conference on Machine Learning. PMLR

2024
[39]

Shuoyuan Wang, Yixuan Li, and Hongxin Wei. 2024. Understanding and Mitigat- ing Miscalibration in Prompt Tuning for Vision-Language Models. InForty-second International Conference on Machine Learning

2024
[40]

Zhengbo Wang, Jian Liang, Lijun Sheng, Ran He, Zilei Wang, and Tieniu Tan. [n. d.]. A Hard-to-Beat Baseline for Training-free CLIP-based Adaptation. InThe Twelfth International Conference on Learning Representations
[41]

Ke Wang, Chongqiang Shen, Xingcan Li, and Jianbo Lu. 2025. Uncertainty quantification for safe and reliable autonomous vehicles: A review of methods and applications.IEEE Transactions on Intelligent Transportation Systems(2025)

2025
[42]

Hantao Yao, Rui Zhang, and Changsheng Xu. 2023. Visual-language prompt tun- ing with knowledge-guided context optimization. InProceedings of the IEEE/CVF conference on computer vision and pattern recognition. 6757–6767

2023
[43]

Maxime Zanella, Benoît Gérin, and Ismail Ayed. 2024. Boosting vision-language models with transduction.Advances in Neural Information Processing Systems37 (2024), 62223–62256

2024
[44]

Yeming Wen, Dustin Tran, and Jimmy Ba. [n. d.]. BatchEnsemble: an Alternative Approach to Efficient Ensemble and Lifelong Learning. InInternational Conference on Learning Representations
[45]

Ao Zhou, Bin Liu, Jin Wang, and Grigorios Tsoumakas. 2025. Batch selection for multi-label classification guided by uncertainty and dynamic label correlations. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 39. 22902–22909

2025
[46]

Kaiyang Zhou, Jingkang Yang, Chen Change Loy, and Ziwei Liu. 2022. Conditional prompt learning for vision-language models. InProceedings of the IEEE/CVF conference on computer vision and pattern recognition. 16816–16825

2022
[47]

Jingyi Zhang, Jiaxing Huang, Sheng Jin, and Shijian Lu. 2024. Vision-language models for vision tasks: A survey.IEEE transactions on pattern analysis and MM ’26, November 10–14, 2026, Rio de Janeiro, Brazil Ao Zhou et al. machine intelligence46, 8 (2024), 5625–5644

2024
[50]

Xingyu Zhu, Beier Zhu, Yi Tan, Shuo Wang, Yanbin Hao, and Hanwang Zhang
[51]

Enhancing zero-shot vision models by label-free prompt distribution learning and bias correcting.Advances in Neural Information Processing Systems 37 (2024), 2001–2025

2024
[2024]

InEuropean Conference on Computer Vision

Robust calibration of large vision-language adapters. InEuropean Conference on Computer Vision. Springer, 147–165
[2025]

InProceedings of the Computer Vision and Pattern Recognition Conference

Dpu: Dynamic prototype updating for multimodal out-of-distribution de- tection. InProceedings of the Computer Vision and Pattern Recognition Conference. 10193–10202

Pith tools

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

[1] [1]

Jihwan Bang, Sumyeong Ahn, and Jae-Gil Lee. 2024. Active prompt learning in vision language models. InProceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. 27004–27014

work page 2024

[2] [2]

Anton Baumann, Rui Li, Marcus Klasson, Santeri Mentu, Shyamgopal Karthik, Zeynep Akata, Arno Solin, and Martin Trapp. 2024. Post-hoc probabilistic vision- language models.arXiv preprint arXiv:2412.06014(2024)

arXiv 2024

[3] [3]

Luke Chen, Junyao Wang, Trier Mortlock, Pramod Khargonekar, and Moham- mad Abdullah Al Faruque. 2025. Hyperdimensional uncertainty quantification for multimodal uncertainty fusion in autonomous vehicles perception. InProceedings of the Computer Vision and Pattern Recognition Conference. 22306–22316

work page 2025

[4] [4]

Sanghyuk Chun. [n. d.]. Improved Probabilistic Image-Text Representations. In The Twelfth International Conference on Learning Representations

work page

[5] [5]

Zheng Ding, Jieke Wang, and Zhuowen Tu. 2023. Open-vocabulary universal image segmentation with MaskCLIP. InProceedings of the 40th International Conference on Machine Learning. 8090–8102

work page 2023

[6] [6]

Nikita Durasov, Timur Bagautdinov, Pierre Baque, and Pascal Fua. 2021. Masksem- bles for uncertainty estimation. InProceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. 13539–13548

work page 2021

[7] [7]

Yarin Gal and Zoubin Ghahramani. 2016. Dropout as a bayesian approximation: Representing model uncertainty in deep learning. Ininternational conference on machine learning. PMLR, 1050–1059

2016

[8] [8]

Eduardo Dadalto Câmara Gomes, Marco Romanelli, Georg Pichler, and Pablo Pi- antanida. 2023. A data-driven measure of relative uncertainty for misclassification detection. InThe Twelfth International Conference on Learning Representations

work page 2023