Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

4283125166 · May 202619922001200920172026
48 results for confidence calibration

This paper rethinks confidence calibration under covariate shifts.

problem Calibration methods struggle with covariate shifts and unstable importance weighting.
method Derives Expectation consistency condition and proposes Expectation consistency loss (ECL).
result ECL loss is compatible with various types of calibration and has the same sample complexity as ECE.

Develops confidence intervals for ECE, a measure of model calibration.

problem Ensuring the calibration of probabilistic predictions in machine learning models.
method Develops confidence intervals for the 2\ell_2 Expected Calibration Error (ECE), considering top-1-to-kk calibration.
result Shows asymptotic normality and different convergence rates for calibrated and miscalibrated models, developing methods to construct valid confidence intervals.

New method calibrates confidence for object detection and segmentation models.

problem Intrinsically miscalibrated confidence estimates in object detection and segmentation models.
method Introduces multivariate confidence calibration for object detection and segmentation, extending ECE.
result Improves calibration, positively impacts segmentation quality.

CCAC calibrates DNN classifiers on OOD datasets by separating mis-classified samples.

problem Calibrating DNN classifiers on out-of-distribution datasets is challenging.
method CCAC introduces an auxiliary class to map DNN output to calibrated confidence, separating mis-classified from correctly classified samples.
result CCAC consistently outperforms prior methods on various DNN models, datasets, and applications.

This paper improves lottery ticketing by calibrating network confidence.

problem Uncalibrated confidence in lottery tickets leads to overconfidence and poor performance.
method The paper introduces various calibration strategies and explores their impact on lottery tickets.
result Calibration mechanisms consistently improve lottery ticket performance, even under distribution shifts.

Calibrates network confidence for unsupervised domain adaptation.

problem Calibrating a model trained on a source domain to a target domain without labeled data.
method Estimates network accuracy on the target domain and calibrates prediction confidence directly in the target domain.
result Significantly outperforms existing methods across standard datasets.

The paper tackles confidence calibration for exploratory machine learning problems.

problem Difficulty in curating datasets and confusion about category validity.
method Introduces four new algorithms for category-specific confidence estimation, including kernel density ratios.
result Kernel density ratios provide a novel approach to confidence calibration, especially for exploratory problems.

The paper investigates how dataset quality and heterogeneity affect model confidence in machine learning.

problem Understanding how dataset quality and heterogeneity impact model confidence in machine learning.
method The study uses theoretical explanations and experimental demonstrations to investigate the effects of dataset size, label noise, and class heterogeneity on model confidence.
result Label noise reduces model confidence, while reduced dataset size increases it, and class heterogeneity leads to inconsistent confidence across classes.

New method improves model calibration by adjusting confidence based on prediction correctness.

problem Improving model confidence alignment with true class probabilities.
method Post-hoc calibration objective using transformed samples for training.
result Competitive calibration performance on in-distribution and out-of-distribution test sets.

LLMs show surprising confidence in their answers, beyond just tokens.

problem LLMs lack meaningful confidence estimates for their responses.
method Semantic calibration test based on local loss optimality and equivalence classes.
result Base LLMs are semantically calibrated across tasks, contrary to expectations.

Improves confidence calibration in neural networks by smoothing labels based on class similarity.

problem Improving confidence calibration in deep neural networks for safety-critical applications.
method Proposes a novel label smoothing technique where label values are based on similarities with the reference class, using different similarity measurements.
result Consistently outperforms state-of-the-art calibration techniques on various datasets and network architectures.

Study three types of uncertainty quantification for binary classification without distributional assumptions.

problem Uncertainty quantification for binary classification in a distribution-free setting.
method Established theorems connecting calibration, confidence intervals, and prediction sets for score-based classifiers.
result Distribution-free calibration is only possible using scoring functions that partition feature space into countably many sets.

New method estimates grouping loss in neural networks to improve confidence scores.

problem Improving confidence scores in neural networks to reflect true posterior probabilities.
method Proposed an estimator to approximate the grouping loss.
result Modern neural networks exhibit grouping loss, especially in distribution shifts.

Deep neural networks (DNNs) are poorly calibrated when trained in conventional ways. To improve confidence calibration of DNNs, we propose a novel training method, distance-based learning from errors (DBLE). DBLE bases its confidence estimation on distances in the representation space. In DBLE, we first adapt prototypi…

2019-12-03abs ↗pdf ↗

A new framework evaluates LLM calibration in open-ended QA.

problem Evaluating LLM calibration in open-ended QA settings.
method Sem-ECE framework: sampling answers, grouping by semantic classes, and using frequencies as confidence.
result Sem-ECE estimators are unbiased and Sem2_2 achieves smaller calibration error.

We propose an algorithm combining calibrated prediction and generalization bounds from learning theory to construct confidence sets for deep neural networks with PAC guarantees---i.e., the confidence set for a given input contains the true label with high probability. We demonstrate how our approach can be used to cons…

2019-12-31abs ↗pdf ↗

The study examines when to trust confidence thresholding in pseudo-labelling regression.

problem Calibrated probabilities from classifiers used for pseudo-labelling need careful handling to avoid bias in downstream regression.
method Developed a diagnostic apparatus to predict and bound the bias induced by confidence thresholding, derived a closed-form expression for the attenuation bias.
result The bias can be predicted from the residual score variance VV^{*}, motivating a structural separation between classifier features and downstream controls.

This paper improves confidence measurement in deep metric learning models.

problem Measuring confidence in deep metric learning models is challenging.
method Approximates class distributions using Gaussian kernel smoothing and calibrates the confidence metric.
result Improves generalization and robustness of deep metric learning models.

EC method calibrates neural networks by matching average confidence to correct label proportion.

problem Overoptimism in neural network prediction confidence.
method Expectation consistency (EC) post-training rescaling of weights.
result EC achieves similar calibration performance to temperature scaling (TS) but is based on a principled Bayesian principle.

Certified calibration methods protect model confidence from adversarial attacks.

problem Adversarial attacks degrade model calibration, reducing confidence in predictions.
method Developed certified calibration methods to provide worst-case bounds on calibration under adversarial perturbations.
result Certified calibration methods produce analytic and approximate bounds for the Brier score and expected calibration error.

The paper shows over-confidence in models isn't just due to over-parametrization.

problem Over-confidence in machine learning models, especially in binary classification.
method Theoretical analysis of logistic regression and other binary classification problems.
result Logistic regression is inherently over-confident in certain settings, but over-confidence is not always the case.

BoC probe assesses neural network confidence coherence, revealing architecture-specific uncertainty.

problem Poor calibration and OOD detection in neural networks.
method Bag-of-Coins (BoC) probe compares softmax confidence to pairwise dominance probabilities.
result BoC reveals clear ID/OOD separation for some architectures but not others.

Study on learning to defer to multiple experts with consistent surrogates and confidence calibration.

problem Addressing the open problems of consistent surrogates, confidence calibration, and ensembling of experts.
method Derive two consistent surrogates (softmax and OvA) and propose a conformal inference technique for choosing experts.
result The OvA-based loss does not cause mis-calibration propagation, while the softmax-based loss does.

This post introduces model calibration and evaluation measures, highlighting issues with a common measure.

problem Ensuring model confidence accurately reflects true outcomes.
method Explains common calibration definition, ECE, and its drawbacks.
result New evaluation measures needed for comprehensive model calibration.

Annealing Double-Head calibrates deep neural networks during training.

problem Overestimation or underestimation of predictive confidence in deep neural networks.
method An additional calibration head and Annealing technique to dynamically scale logits.
result State-of-the-art model calibration performance achieved without post-processing.

This paper improves multi-class calibration methods using mutual information maximization-based binning.

problem Calibration of deep neural network predictions, especially for small prior classes.
method I-Max concept for binning, shared class-wise calibration strategy.
result Improves multi-class ranking and calibration performance using a small calibration set.

CAT improves domain adaptation for fault diagnosis by calibrating teacher network predictions.

problem Performance drops in deep learning models when applied to different data distributions.
method CAT uses post-hoc calibration techniques to calibrate predictions of the teacher network during self-training.
result CAT achieves state-of-the-art performance on most transfer tasks in domain-adaptive IFD.

Time series foundation models are well-calibrated, improving over baseline models.

problem Calibration of time series foundation models for practical applications.
method Systematic evaluations of five time series foundation models and two baselines, assessing calibration, prediction heads, and long-term forecasting.
result Time series foundation models are consistently better calibrated than baseline models and do not show over- or under-confidence.

Spatially weighted conformal prediction improves uncertainty quantification in house price models.

problem Uncertainty quantification in automated valuation models with spatial dependencies.
method Survey and demonstration of various spatially weighted approaches to adjust conformal prediction confidence sets.
result Spatially weighted CP makes confidence sets more consistently calibrated across geographical regions.

The study examines label smoothing to improve confidence calibration in fine-tuned LLMs.

problem Improving confidence calibration in fine-tuned large language models (LLMs) after instruction tuning.
method Examine various open-sourced LLMs, label smoothing, and custom kernel design.
result Label smoothing is effective in maintaining confidence calibration but faces challenges in large vocabulary LLMs.

We present a new method for computing ASR word confidences that effectively mitigates the effect of ASR errors for diverse downstream applications, improves the word error rate of the 1-best result, and allows better comparison of scores across different models. We propose 1) a new method for modeling word confidence u…

2019-07-22abs ↗pdf ↗

No policy can simultaneously be fully autonomous, optimally calibrated, and helpful, proving a trilemma.

problem Proving impossibility of a policy achieving maximum helpfulness, optimal calibration, and full autonomy.
method Geometric proof showing that adding any non-affine autonomy incentive to a strictly proper scoring rule destroys strict properness.
result The Behavioral Credibility Trilemma: no policy can achieve all three goals simultaneously.