Skip to content

SupportCal: Label-Free Calibration of Post-Trained LLMs via Reference Support and Corroboration

Sep 2026 · 0 citations · 27 references
Computer Science

TL;DR

SupportCal is introduced, a label-free post-hoc method that retains agreement examples at unit weight and assigns disagreement examples continuous weights based on the own-base PLM's relative support and corroboration from pretrained references selected from a size-compatible candidate pool.

Abstract

Post-training often improves task performance but can degrade confidence calibration, leaving post-trained language models (PoLMs) more overconfident than their corresponding pretrained language models (PLMs). Because task-specific labeled calibration data can be costly or unavailable, the corresponding PLM provides a natural label-free reference for post-hoc calibration. Prior agreement-gated PLM-referenced calibration fits a scalar temperature using only examples on which the PoLM and its PLM reference agree, excluding disagreement examples because direct alignment can drive the fitted temperature excessively high and induce under-confidence. We revisit this binary treatment. A controlled reintroduction diagnostic reveals a non monotonic aggregate effect: admitting a moderate fraction of disagreement examples can improve calibration, whereas the benefit diminishes as unit weight inclusion approaches the full disagreement set. We introduce SupportCal, a label-free post-hoc method that retains agreement examples at unit weight and assigns disagreement examples continuous weights based on the own-base PLM's relative support and corroboration from pretrained references selected from a size-compatible candidate pool. We further characterize when the resulting weighted objective admits a finite optimal temperature. Across MedMCQA and MathQA, SupportCal yields lower mean ECE than the agreement-only baseline for nearly all evaluated target-model configurations; supplementary TweetEval Sentiment results show the same pattern on a fixed-label classification task.

View source

Similar papers

#artificial intelligence Preprint Oct 2026

TICDA: Tabular In-Context Data Attribution

Tabular foundation models (TFMs) achieve strong predictive performance by conditioning on labeled demonstrations provided in context, without any parameter update. Yet how individual demonstrations shape a given prediction remains poorly understood. This gap matters in practice: the context is often assembled from what...

Yacine Benihaddadene, Milan Bhan, Eliot Dugelay et al. · 0 citations
#artificial intelligence Preprint Sep 2026

ABC-Align: Prediction-Powered Alignment with Adaptive Bias Control

This work proposes ABC-Align, leveraging abundant pseudo label signal to minimize variance and applying a lightweight, adaptive correction grounded in the human-labeled subset, and empirically demonstrates that ABC-Align achieves superior performance over prior semi-supervised baselines in a series of experiments on an...

Eric Frankel, Bang-Hua Zhu, Sewoong Oh et al. · 0 citations
#artificial intelligence Preprint Oct 2026

Test-time Calibration Learning for Large Language Model Reasoning

Reliable large language models (LLMs) must not only produce accurate answers but also express confidence that faithfully reflects their probability of being correct. Such calibration is essential for identifying uncertain predictions and supporting reliable decision-making in real-world deployment. Recent studies incor...

Zi-Zhuo Zhang, Xiong Peng, Jing-Wei Sun et al. · 0 citations
Preprint Aug 2026

When the API Speaks the Wrong Language: Revisiting Post-Training for Multilingual Tool Use

It is found that, in this benchmark, supervised fine-tuning (SFT) provides a strong baseline, substantially improving argument language consistency and end-to-end function call accuracy and, under consistent model selection, SFT achieves performance comparable to, and sometimes exceeding more complex reinforcement lear...

Siddharth Chauhan, Thomas Butler, Abhishek Singhania et al. · 0 citations
#artificial intelligence Preprint Oct 2026

The Standardization Trap: Certifying Joint Label Processing in Tabular Foundation Models

Linear regression and kernel smoothing offer tractable explanations of in-context learning: in both, the features determine the weight assigned to each context label. However, whether this fixed-weight account describes pretrained tabular foundation models (TFMs) remains unclear. Testing this account using derivatives...

Duong Nguyen, N. Chesneau, Milan Bhan · 0 citations

Related blog posts

MIT News · Artificial Intelligence Aug 27, 2026

Looking beyond natural sequences

A new machine-learning framework aims to improve the success rate of computational protein design while moving away from results that reproduce sequences found in nature.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.