arXiv:2609.17386v1 Announce Type: new
Abstract: Test-time prompt tuning (TPT) enables adaptation on a single test instance, achieving improved accuracy but often sacrificing calibration performance....
By Yuwei Liang, Jian Liang, Dapeng Hu, Yinuo Xu, Ran He
arXiv:2606. 06943v1 Announce Type: cross Abstract: Vision-language models (VLMs) such as CLIP achieve strong zero-shot recognition but remain highly fragile under adversarial perturbations.
By Sunoh Kim, Daeho Um
arXiv:2607. 09450v1 Announce Type: cross Abstract: Pre-trained Vision-Language Models (VLMs) such as CLIP achieve strong zero-shot generalization, but their performance degrades sharply under adversarial perturbations.
By Xingyu Zhu, Huanshen Wu, Shuo Wang, Beier Zhu, Jiannan Ge, Jiaheng Zhang, Long Chen
The paper introduces SMART, a lightweight recalibration technique that adjusts logits based on the margin between the top two logits, called the logit gap. It uses a soft-binned Expected Calibration Error objective to balance bias and variance, enabling stable updates even with limited calibration data. Experiments across various datasets and architectures show SMART achieves state‑of‑the‑art calibration with fewer parameters than existing methods.
By Haolan Guo, Linwei Tao, Haoyang Luo, Minjing Dong, Chang Xu
Test-time adaptation (TTA) can mitigate domain shift without source data, but it is highly brittle under adversarially contaminated test streams, where corrupted inputs also destabilize online updates. We study robust test-time adaptation (RTTA) in the adversarial-stream setting, which remains comparatively underexplored relative to standard TTA, and propose SAFER (Stochastic Augmentation Framework for Enhanced Robustness), a training-free reliability-guided augmentation wrapper for RTTA.
arXiv:2608. 10372v1 Announce Type: new Abstract: Post-hoc calibration aligns a classifier's predicted confidences with its empirical accuracy without retraining.
By Lening Zhao, Qipeng Zhan, Li Shen
arXiv:2605. 30188v2 Announce Type: replace-cross Abstract: Reliable probability estimates are critical in many machine learning applications, yet modern classifiers are often poorly calibrated.
By Eug\`ene Berta, David Holzm\"uller, Francis Bach, Michael I. Jordan
Optimizable Model Averaging (OMA) is a black‑box method that assigns nonnegative weights to each candidate model’s predictive probabilities, keeping all model parameters frozen. By minimizing regularized predictive entropy, OMA learns a single scalar coefficient per model to average outputs from heterogeneous architectures. The authors show that appropriate regularization reduces expected calibration error and improves the trade‑off between performance and calibration compared to simple output averaging.
By Mijung Park
The paper introduces MAGIC, a method for improving test-time robustness of large vision‑language models by mitigating language bias. MAGIC evaluates decision margins to selectively activate textual and visual perturbation branches, integrates logits from multiple perturbed views, and restores the most informative corrupted views for ambiguous samples. It also uses a calibration dataset to prune ineffective branches, reducing inference cost while enhancing performance on benchmark datasets.
By Shunshun Gu, Enze Zhang, Ming Pei, Hang Zhou, Xiao Luo
arXiv:2607. 08347v1 Announce Type: cross Abstract: Active testing provides a label--efficient approach to risk estimation by adaptively selecting which test points should be labelled.
By Kianoosh Ashouritaklimi, Valentin Kilian, Daolang Huang, Tom Rainforth, Fran\c{c}ois Caron
The paper introduces EUA‑Cal, a calibration method that preserves the early‑training uncertainty of deep neural networks. By regularizing predictions and feature prototypes based on the early model, EUA‑Cal mitigates overconfidence while maintaining accuracy. Experiments on image classification and multiple‑choice question answering across eight models show EUA‑Cal outperforms existing calibration techniques.
By Yutong Xie, Jiawei Tang, Zhenglin Hua, Yuxiang Ma, Si Qin, Yaxin Hou, Hui Liu, Junhui Hou, Yuheng Jia
The paper introduces Local Adaptive Probability Estimation (LAPE), a post‑hoc residual calibration framework that refines global calibrator outputs using non‑parametric local evidence from neighboring samples in feature space. LAPE serves as a plug‑and‑play module that leverages feature‑space geometry and reuses calibration data, improving calibration quality for various baselines. The authors also extend the approach to multi‑view inputs with Cascade Feature Augmentation Fusion (CFAF) and demonstrate its effectiveness through extensive experiments.
By Xihao Wang, Chengyao Yu, Ruixing Ming