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

94189283377 · Jun 202019922001200920172026
48 results for reduced calibration

Two methods improve calibration of probabilistic classifiers, especially for multi-class problems.

problem Improving calibration of probabilistic classifiers, especially for multi-class problems.
method Two techniques: reduced calibration and class-wise calibration.
result Class-wise reduced calibration algorithms reduce prediction and per-class calibration errors.

A novel post-hoc calibration method reduces neural network calibration errors.

problem Neural networks produce poorly calibrated probabilities, leading to underconfidence and overconfidence.
method Probability bounding (PB) via box-constrained softmax (BCSoftmax) function.
result Consistently reduces calibration errors on four real-world datasets.

Meta-learning reduces set prediction size in conformal prediction for few-shot calibration.

problem Inefficient set prediction in conformal prediction for limited training data.
method Meta-learning approach using cross-validation-based conformal prediction.
result Meta-learning scheme reduces set prediction size and preserves formal guarantees.

In order to cope with the increased data volumes generated by modern radio interferometers such as LOFAR (Low Frequency Array) or SKA (Square Kilometre Array), fast and efficient calibration algorithms are essential. Traditional radio interferometric calibration is performed using nonlinear optimization techniques such…

2013-03-05abs ↗pdf ↗

A co-evolutionary approach for Heston model calibration reduces overfitting with diverse datasets.

problem Overfitting and lack of generalization in Heston model calibration.
method Coupling a genetic algorithm with an evolving neural inverse map, using both GA-history sampling and Latin hypercube sampling.
result Diverse datasets improve out-of-sample stability and calibration accuracy.

In recent years research on credit risk modelling has mainly focused on default probabilities. Recovery rates are usually modelled independently, quite often they are even assumed constant. Then, however, the structural connection between recovery rates and default probabilities is lost and the tails of the loss distri…

2011-02-23abs ↗pdf ↗

New method calibrates stochastic reduced-order models from data efficiently.

problem Challenges in estimating drift and diffusion coefficients from data for high-dimensional systems.
method Uses a novel relationship between conditional score and transition density to constrain model coefficients directly from finite-lag statistics.
result Validated on various systems, the method reproduces statistical and dynamical properties of the original models.

Generative models often misrepresent class frequencies; this paper calibrates them.

problem Miscalibration of class frequencies in generative models.
method Formulated as constrained optimization, using surrogate objectives to approximate constraints.
result Significant reduction in calibration error across various models and applications.

American put options are among the most frequently traded single stock options, and their calibration is computationally challenging since no closed-form expression is available. Due to the higher flexibility in comparison to European options, the mathematical model involves additional constraints, and a variational in…

2016-11-19abs ↗pdf ↗

KCal calibrates deep networks by embedding logits in a metric space.

problem Overconfident predictions from DNNs, especially in high-risk applications.
method KCal learns a metric space on the penultimate-layer latent embedding and generates predictions using kernel density estimates.
result KCal provides a provable full calibration guarantee and consistently outperforms baselines.

Develops geometric framework for uncertainty-aware multi-class classification.

problem Silent failure of AI models when uncertain, especially in multi-class settings.
method Geometric framework treating probability vectors as points on the (c1)(c-1)-dimensional probability simplex, using Fisher--Rao metric for calibration and uncertainty quantification.
result Empirical validation shows 72.5% of errors captured while deferring 34.5% of ambiguous predictions, reducing automated decision error rates from 16.8% to 6.9%.

Post-processing predictors reduces calibration errors for decision-making.

problem Predictors with low calibration error for machine learning may have high error for decision-making.
method Post-processing with ε distance to calibration adds noise to make predictions differentially private.
result Post-processing achieves O(√ε) ECE and CDL, asymptotically optimal.

C-PP-COAD detects anomalies with limited real data, reducing dependency on real calibration data.

problem Limited real calibration data for online anomaly detection.
method Context-aware prediction-powered conformal online anomaly detection (C-PP-COAD).
result Significantly reduces dependency on real calibration data without compromising FDR control.

The paper certifies AI reliability via sampling and calibration, providing exact guarantees.

problem Ensuring trust in black-box AI systems' outputs.
method Self-consistency sampling and conformal calibration.
result Reliability levels derived from these methods offer finite-sample guarantees.

Post-calibration improves the accuracy of causal effect estimation.

problem Improperly calibrated propensity scores lead to inaccurate causal effect estimation.
method Performed a simulation study to assess the impact of post-calibration on causal effect estimation.
result Post-calibration reduces the error in estimating the average treatment effect, especially for expressive uncalibrated statistical estimators.

Trimming helps in conformal prediction when it separates anomaly scores.

problem Effectiveness of trimming in conformal prediction under contamination.
method Analyse fixed-threshold trimming as a replacement of the contaminated calibration law with a retained law.
result Trimming helps when it separates anomaly scores, reducing clean-target coverage to a one-dimensional score-CDF transfer problem.

This research improves deep neural network calibration using a new loss function.

problem Improving probability calibration in deep neural networks.
method Introduces Focal Calibration Loss (FCL) to minimize Euclidean norm and penalize calibration error.
result FCL achieves state-of-the-art performance in both calibration and accuracy metrics.

New method improves calibration in multi-output probabilistic models.

problem Challenges in achieving multivariate calibration in multi-output regression.
method General regularization framework to enforce multivariate calibration during training for arbitrary pre-rank functions.
result Significant improvement in calibration across all pre-rank functions without sacrificing predictive accuracy.

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.

Applications such as weather forecasting and personalized medicine demand models that output calibrated probability estimates---those representative of the true likelihood of a prediction. Most models are not calibrated out of the box but are recalibrated by post-processing model outputs. We find in this work that popu…

2019-09-23abs ↗pdf ↗

Excellent ranking power along with well calibrated probability estimates are needed in many classification tasks. In this paper, we introduce a technique, Calibrated Boosting-Forest that captures both. This novel technique is an ensemble of gradient boosting machines that can support both continuous and binary labels. …

2017-10-16abs ↗pdf ↗

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.

Improves robustness of propensity score estimators in challenging settings.

problem Limited overlap, small sample sizes, or unbalanced data.
method Extends calibration techniques for propensity score models, focusing on sample-splitting schemes.
result Calibration reduces variance and bias in inverse probability weighting and double/debiased machine learning frameworks.

This paper improves MI-based BCIs by applying transfer learning across all components.

problem Reducing calibration effort for new subjects in MI-based BCIs.
method Proposes TL in spatial filtering, feature engineering, and classification blocks, and adds data alignment.
result Integrating data alignment and sophisticated TL significantly improves classification performance and reduces calibration effort.

SOCP uses SOM to find groups and local calibration buffers for better regional coverage.

problem Heterogeneous regional coverage gaps in conformal prediction.
method Self-Organizing Map (SOM) for group discovery; local calibration buffers at BMU or fixed grid.
result Reduces regional coverage gaps on 7/8 benchmarks by 7.1%.

CCI combines Bayesian and gradient boosting to create fair, reliable credit risk scores.

problem Tackles high-stakes lending decisions with changing data distributions and fairness constraints.
method Combines Bayesian neural risk scorer and fairness-constrained gradient boosting with shift-aware fusion.
result CCI achieves best trade-off between discrimination, calibration, stability, and fairness.

PosCal training improves classification models by calibrating posterior probabilities.

problem Poorly calibrated posterior probabilities in classification models.
method End-to-end training procedure that directly optimizes the objective while minimizing the difference between predicted and empirical posterior probabilities.
result PosCal training achieves about 2.5% task performance gain and 16.1% calibration error reduction.