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

106211317422 · Jun 202019922001200920172026
48 results for accuracy vs. calibration

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.

Calibrates historical and implied correlations in energy markets.

problem Challenges in aligning historical correlations of futures contracts with implied volatility smiles.
method Multiplicative multi-factor Heath-Jarrow-Morton model combined with stochastic volatility from lifted Heston model, using Kemna-Vorst approximation and Fourier-based techniques.
result Remarkable joint historical and implied calibration fits on the German power market.

Improves uncertainty estimation and OOD detection in neural networks.

problem Accurate uncertainty estimation and OOD detection in neural networks.
method Investigates one-vs-all and distance-based logit representations for probabilities.
result One-vs-all formulations improve calibration without additional complexity.

Proposes an accuracy-preserving calibration method for DNNs.

problem Calibration of deep neural networks (DNNs) to measure prediction reliability.
method Uses Concrete distribution on the probability simplex to calibrate DNNs without accuracy loss.
result The proposed method outperforms previous methods in accuracy-preserving calibration tasks.

Calibrated ensembles improve both ID and OOD accuracy in distribution shift.

problem Desired balance between in-distribution and out-of-distribution accuracy.
method Ensemble standard and robust models, calibrating on ID data only.
result ID-calibrated ensembles outperform state-of-the-art methods on multiple datasets.

A post-hoc framework improves model performance by calibrating different feature spaces.

problem Improving AUC performance on binary classification tasks for overconfident models.
method Identifies heterogeneous partitions of the feature space and applies post-hoc calibration techniques to each partition.
result Theoretical optimality of the framework for any model, demonstrated on deep neural networks.

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.

LiST improves neural network robustness and calibration without manual tuning.

problem Developing robust and calibrated neural networks simultaneously.
method Lipschitz Scaling Training (LiST) that iteratively adjusts the global Lipschitz constant.
result LiST yields an out-of-the-box calibrated network with competitive accuracy and robustness.

TCP provides well-calibrated prediction intervals for nonstationary time series.

problem Nonstationary time series forecasting with well-calibrated prediction intervals.
method Temporal Conformal Prediction (TCP) couples a modern quantile forecaster with a rolling split-conformal calibration layer.
result TCP achieves near-nominal coverage, providing slightly wider intervals than Historical Simulation.

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.

Training of one-vs.-rest SVMs can be parallelized over the number of classes in a straight forward way. Given enough computational resources, one-vs.-rest SVMs can thus be trained on data involving a large number of classes. The same cannot be stated, however, for the so-called all-in-one SVMs, which require solving a …

2016-11-25abs ↗pdf ↗

Improves model calibration and selection in unsupervised domain adaptation.

problem Distribution shifts in unsupervised domain adaptation.
method Developed a novel importance weighted group accuracy estimator.
result Improves state-of-the-art performances by 22% in model calibration and 14% in model selection.

A graph neural network improves multivariate post-processing of ensemble forecasts.

problem Systematic biases in ensemble forecasts and loss of dependencies across forecast dimensions.
method A composite-Loss Graph Neural Network (dualGNN) trained with a composite loss function combining ES and VS.
result The dualGNN outperforms traditional methods in multivariate verification metrics and captures spatial relationships.

Improved DNN calibration without sacrificing accuracy.

problem Poor calibration of over-parametrized DNNs in safety-critical applications.
method Decoupling feature extraction and classification layers, and applying Gaussian priors.
result Significant improvement in model calibration with minimal training cost.

CoroNet detects COVID-19 from chest X-rays with high accuracy.

problem Detecting COVID-19 from chest X-rays using limited testing kits.
method Proposes CoroNet, a deep neural network based on Xception architecture trained on a combined dataset of COVID-19 and pneumonia X-rays.
result CoroNet achieved an overall accuracy of 89.6% and precision/recall rates of 93%/98.2% for 4-class cases (COVID vs Pneumonia bacterial vs pneumonia viral vs normal).

Two approaches improve conformal Bayes for label shift, one post-hoc and one in-training.

problem Improving prediction sets for target domain under label shift.
method Two complementary approaches: post-hoc calibration and in-training adaptation.
result In-training adaptation achieves up to 43% width reduction at unchanged coverage.

In many classification problems it is desirable to output well-calibrated probabilities on the different classes. We propose a robust, non-parametric method of calibrating probabilities called SplineCalib that utilizes smoothing splines to determine a calibration function. We demonstrate how applying certain transforma…

2018-09-20abs ↗pdf ↗

The paper tackles ride-hailing fleet repositioning with a calibrated demand approach.

problem Repositioning idle supply before future demand is observed in ride-hailing.
method A predict-then-optimize approach using calibrated demand regimes, a similarity gate, and spatial queue-regret decomposition.
result The spatial gate reduces mean wait time to 82.3s compared to 85.3s for a hand-tuned similarity gate and 85.8s for a distributional-only baseline.

The study reduces a personality measurement instrument to 10 features with minimal loss of accuracy.

problem Accurately predicting personality types with minimal predictors.
method Reduced a 94-item personality survey to 10 features, using class imbalance correction methods.
result Achieved 73.81% accuracy on unseen data with only 1% loss.

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.

Boosted ensemble of decision tree (DT) classifiers are extremely popular in international competitions, yet to our knowledge nothing is formally known on how to make them \textit{also} differential private (DP), up to the point that random forests currently reign supreme in the DP stage. Our paper starts with the proof…

2020-01-26abs ↗pdf ↗

SVI and GP surrogates improve calibration of ABMs in epidemiology.

problem Calibrating stochastic ABMs in epidemiology is computationally expensive.
method Stein Variational Inference (SVI) with Gaussian process (GP) surrogates.
result SVI maintains comparable predictive accuracy and calibration effectiveness to MCMC.

Mix-n-Match improves uncertainty calibration in deep learning.

problem Post-hoc calibration of machine learning classifiers.
method Ensemble and composition strategies to improve accuracy, efficiency, and expressive power.
result Mix-n-Match strategies achieve better data-efficiency and expressive power while maintaining classification accuracy.

Graph Neural Networks (GNNs) have proven to be successful in many classification tasks, outperforming previous state-of-the-art methods in terms of accuracy. However, accuracy alone is not enough for high-stakes decision making. Decision makers want to know the likelihood that a specific GNN prediction is correct. For …

2019-05-07abs ↗pdf ↗

The paper addresses calibration in label ranking, a structured prediction task.

problem Calibration in label ranking is not well understood and often poorly calibrated.
method Formalized calibration for label ranking, developed a hierarchy of notions, and empirically evaluated models.
result Popular label ranking models are often poorly calibrated, with differences between sub-ranking and top-k metrics.