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

76152228304 · Jun 202019922001200920172026
48 results for adaptive calibration

New methods for better uncertainty prediction in ML.

problem Insufficient calibration in machine learning regression.
method Conditional calibration with respect to input features (adaptivity).
result Consistency and adaptivity are complementary, and good consistency does not guarantee good adaptivity.

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.

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.

New algorithms adaptively calibrate predictions in non-stationary environments, matching optimal rates.

problem Designing online prediction algorithms that adapt to varying levels of non-stationarity.
method Epoch-based scheduling and non-uniform partitioning of the prediction space.
result Achieves adaptive calibration guarantees under multiple measures with optimal rates.

Calibrated probabilistic solvers improve accuracy of ODE estimates.

problem Uncertainty in probabilistic ODE solutions is not well-calibrated for adaptive step sizes.
method Introduce and assess several calibration methods for probabilistic ODE solvers.
result Calibration methods interact efficiently with adaptive step-size selection, improving posteriors.

Algorithm calibrates predictions for covariate shift using domain adaptation.

problem Uncertainty estimates overestimate certainty when real-world data differs from training data.
method Uses importance weighting and learns a feature map to equalize distributions.
result Outperforms existing approaches in calibrated prediction when covariate shift occurs.

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.

AdapTable adapts tabular models to shifts without source data, improving HELOC performance.

problem Distribution shifts in tabular data threaten model performance.
method Shift-aware uncertainty calibrator and label distribution handler.
result Up to 16% improvement on HELOC dataset.

This paper tackles over-certainty in test-time adaptation models, proposing a solution to improve calibration.

problem Over-certainty in predictions caused by domain shifts, leading to misplaced trust.
method Introduces a certainty regularizer that dynamically adjusts pseudo-label confidence based on backbone entropy and logit norm.
result Achieves state-of-the-art performance in terms of Expected Calibration Error and Negative Log Likelihood, while maintaining accuracy.

New method calibrates classifier probabilities with guaranteed coverage.

problem Inaccurate probability estimates by classifiers in high-risk applications.
method Adaptive temperature scaling algorithm for conformal prediction.
result Improves calibration error measures and standard metrics across various tasks.

Researchers calibrate an adaptive Farmer-Joshi model to recover stylized facts in financial markets.

problem Recovering stylized facts in financial markets using the Farmer-Joshi model.
method Calibrated an adaptive Farmer-Joshi model using genetic and Nelder-Mead algorithms, incorporating agent adaptation.
result The adaptive model recovers additional stylized facts, including auto-correlations and kurtosis, compared to the original model.

Calibrated PRMs improve inference efficiency for LLMs by dynamically adjusting compute budgets.

problem Poor calibration of PRMs leads to overestimation of success probabilities in partial reasoning steps.
method Quantile regression for calibration, instance-adaptive scaling (IAS) framework.
result Calibrated PRMs reduce inference costs while maintaining accuracy, especially on confident problems.

Unsupervised domain adaptation (UDA) aims at inferring class labels for unlabeled target domain given a related labeled source dataset. Intuitively, a model trained on source domain normally produces higher uncertainties for unseen data. In this work, we build on this assumption and propose to adapt from source to targ…

2019-07-25abs ↗pdf ↗

Corrects bias in LLM-as-a-judge evaluations using adaptive calibration.

problem Bias in LLM evaluations due to imperfect sensitivity and specificity.
method Plug-in framework with confidence intervals accounting for test and calibration dataset uncertainties.
result LML-based evaluation yields more reliable estimates than human-only evaluation.

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.

New federated learning methods improve model performance on non-IID data.

problem Improving model performance on non-IID decentralized data.
method Proposed Federated AGMs using adaptive gradient methods with first-order and second-order momenta.
result The proposed Federated AGMs converge to a first-order stationary point under non-IID and unbalanced data settings for nonconvex optimization.

ELSA efficiently adapts to label shift without post-prediction calibrations.

problem Domain adaptation with label shift across training and testing datasets.
method Moment-matching framework based on influence function geometry; solves linear systems for adaptation weights.
result ELSA estimator is n\sqrt{n}-consistent and asymptotically normal, achieving state-of-the-art estimation performance.

Study aggregation of statistical evidence under unknown dependence using group-invariance.

problem Aggregating statistical evidence under unknown and complex dependence structures.
method Develops a framework using group-invariance and permutation-based constructions to aggregate evidence across transformed datasets.
result Shows uniform improvement in critical values for single-batch aggregation over deterministic calibrations, adapting to unknown dependence structures.

T-Cal tests model calibration with a minimax optimal test.

problem Detecting mis-calibration of predictive models using a finite validation dataset.
method T-Cal is a minimax optimal test for calibration based on a debiased plug-in estimator of the 2\ell_2-Expected Calibration Error (ECE).
result T-Cal is a practical tool for testing the calibration of probabilistic classification methods.

Most existing examples of full conformal predictive systems, split-conformal predictive systems, and cross-conformal predictive systems impose severe restrictions on the adaptation of predictive distributions to the test object at hand. In this paper we develop split-conformal and cross-conformal predictive systems tha…

2019-02-18abs ↗pdf ↗

MOPI optimizes flexible set-valued mappings to achieve superior shape adaptivity in conformal prediction.

problem Challenges in achieving valid conditional coverage in conformal prediction.
method Minimax Optimization Predictive Inference (MOPI) framework that optimizes over a flexible class of set-valued mappings.
result MOPI achieves superior shape adaptivity and maintains a principled connection to mean squared coverage error.

New bin-wise scaling methods improve prediction uncertainty calibration for machine learning.

problem Improving prediction uncertainty calibration for machine learning regression.
method Adaptations of Binwise Variance Scaling (BVS) with alternative loss functions and feature-based binning.
result Improved adaptivity and consistency in prediction uncertainty calibration.

Overconfidence and underconfidence in machine learning classifiers is measured by calibration: the degree to which the probabilities predicted for each class match the accuracy of the classifier on that prediction. How one measures calibration remains a challenge: expected calibration error, the most popular metric, ha…

2019-04-02abs ↗pdf ↗

Improves forecast calibration for extreme events using modified loss functions.

problem Improperly specified models do not issue calibrated forecasts for extreme events.
method Adapting loss functions based on weighted scoring rules and tail miscalibration regularization.
result Calibrated forecasts for extreme wind speeds can be improved by suitable adaptations to the loss function during model training.

Adaptive method improves prediction intervals with global coverage guarantees and local error distribution.

problem Global coverage guarantees of conformal regression are often violated by local error distributions.
method Adaptive Conformal Regression with Jackknife+ Rescaled Scores
result Improves local coverage without sacrificing global coverage, especially in low-data regimes.

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.

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.

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 ↗

New method speeds up NIR spectroscopy calibration by 400x.

problem Efficient preprocessing selection in NIR spectroscopy.
method Operator-adaptive PLS and Ridge regression.
result Significant reduction in fitting time with comparable prediction quality.

LCMQR improves prediction intervals by adapting to local heteroscedasticity.

problem Efficient and adaptive prediction intervals for local heteroscedasticity.
method LCMQR combines multi-quantile information with kernel-based localization.
result LCMQR constructs tighter intervals than prior methods, especially in heterogeneous environments.

LoBoost improves local conformal prediction for gradient-boosted trees without extra data splits.

problem Quantifying uncertainty in gradient-boosted tree predictions.
method Model-native local conformal prediction using leaf structure.
result Competitive interval quality and improved test MSE with large calibration speedups.

Extends DML for parametric problems, improving accuracy and efficiency in pricing and calibration.

problem Improving precision and efficiency in pricing and calibration for parametric problems.
method Exploits derivative information, uses adaptive parameter sampling, constructs pricing surrogates, and optimizes globally.
result Demonstrates improved accuracy and efficiency in pricing and calibration for complex models.