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,694 papers · 148 categories

Trend · papers per month

96193289385 · May 202619922001200920172026
48 results for finite calibration

Smooth calibration improves forecast reliability even with leaked information.

problem Improving forecast reliability with leaked information.
method Combining nearby forecasts to ensure smooth calibration, which can be guaranteed by deterministic procedures.
result Smooth calibration can be guaranteed by deterministic procedures even with leaked forecasts, and it yields uncoupled finite-memory dynamics in games.

New calibration energy measures deviation from calibrated geometry, enabling mean curvature flow in infinite volumes.

problem Mean curvature flow in infinite volumes with finite energy.
method Introducing calibration energy and proving its dissipation identity for mean curvature flows.
result Every proper self-expander with finite calibration energy is a plane in all dimensions and codimensions.

Unified framework for generalized Venn and Venn-Abers calibration for reliable prediction.

problem Asymptotic guarantees of popular distribution-free methods in model calibration.
method Unified framework extending Vovk's approach to generic loss functions, transforming predictors into set-valued predictions.
result Finite-sample set predictions shrink to a single conditionally calibrated prediction, capturing epistemic uncertainty.

Proposes a method to create shorter, more accurate prediction intervals.

problem Challenges in achieving both conditional validity and interval efficiency in complex settings.
method Uses a conformal-style calibration method for neural network responses, adjusting to empirical PIT distribution.
result Demonstrates better conditional calibration and shorter intervals than existing methods.

Every graph can be represented as a singular set of a special surface.

problem Representing any finite graph as the singular set of a compact 3D surface.
method Constructing a calibrated 3-dimensional homologically area minimizing surface with a special Lagrangian form.
result The singular set of the surface is precisely the given graph.

New calibration bands for various distributions improve testing for auto-calibration.

problem Testing for auto-calibration in finite samples is challenging.
method Construct calibration bands for the exponential dispersion family using finite sample properties.
result Calibration bands allow for various tests for calibration and auto-calibration.

ICP improves prediction intervals for continuous outcomes at lower computational cost.

problem Systematic bias in point predictions that undermines their use in decision-making.
method Develops Isotonic Conformal Prediction (ICP) framework to decouple calibration from prediction-set construction.
result SICP and TICP procedures match SC-CP coverage at lower computational cost.

The paper investigates how calibrating propensity scores improves DML estimates of average treatment effects.

problem Improving the accuracy of DML estimates in finite samples.
method Propensity score calibration within the Double/debiased machine learning framework.
result Calibrating propensity scores reduces the root mean squared error of DML estimates of average treatment effects in finite samples.

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.

New method calibrates LV surfaces for exotic derivatives with smoother, more stable Greeks.

problem Challenges in LV calibration leading to spiky surfaces and unstable Greeks.
method Automatic local regression to pre-process market observables and smooth LV surfaces.
result Significantly smoother LV surfaces and greatly improved Greek stability with negligible additional cost.

A new method calibrates value predictions in offline RL to improve reliability.

problem Difficulty in long-horizon value prediction in offline reinforcement learning.
method Bellman calibration, a weak reliability criterion, and Iterated Bellman Calibration.
result Finite-sample guarantees show that Bellman calibration error is controlled at nonparametric rates.

Self-calibrating conformal prediction improves interval efficiency and offers a practical alternative.

problem Improving the reliability and uncertainty quantification of machine learning predictions.
method Combines Venn-Abers calibration and conformal prediction for binary and regression problems.
result Improves interval efficiency through model calibration and offers practical alternatives.

Study non-monotonic loss functions in CRC, achieving valid risk control with large calibration samples.

problem Non-monotonic loss functions in CRC, violating existing theory's monotonicity assumption.
method Finite grid selection, calibration sample size analysis, Lipschitz continuity, monotonicity, distribution shift.
result Valid CRC achieved with large calibration samples, optimal excess risk rate of log(m)/n\sqrt{\log(m)/n}.

This work proves L2L_2-regularized ERM controls smCE without post-hoc correction.

problem Calibration of predicted probabilities in machine learning models.
method Canonical L2L_2-regularized empirical risk minimization.
result Theoretical proof that smCE is controlled by ERM without post-hoc correction.

The Bass model is calibrated to vanilla options using a fixed-point equation.

problem Calibration of the Bass local volatility model to vanilla options.
method Solving a fixed-point equation to achieve calibration.
result Existence and uniqueness of the solution to the fixed-point equation, and linear convergence of the fixed-point iteration scheme.

CP4SBI improves the calibration of credible sets in SBI models.

problem Inaccurate credible sets in SBI models lead to underestimation of true parameters.
method Develops a local conformal calibration framework for SBI models.
result Improves the quality of uncertainty quantification for neural posterior estimators.

New algorithm achieves online calibration in polynomial time for high-dimensional problems.

problem Online calibration of high-dimensional probability distributions over many days.
method Randomly selects among sub-forecasters, each predicting empirical outcome frequency over recent time windows.
result Achieves asymptotically calibrated strategies after polynomial number of rounds, resolving open questions.

We provide yet another proof of the existence of calibrated forecasters; it has two merits. First, it is valid for an arbitrary finite number of outcomes. Second, it is short and simple and it follows from a direct application of Blackwell's approachability theorem to carefully chosen vector-valued payoff function and …

2009-12-18abs ↗pdf ↗

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.

Time-series calibrations often suggest that the GARCH diffusion model could also be a suitable candidate for option (risk-neutral) calibration. But unlike the popular Heston model, it lacks a fast, semi-analytic solution for the pricing of vanilla options, perhaps the main reason why it is not used in this way. In this…

2018-01-18abs ↗pdf ↗

The paper studies multi-curve interest rate models and their consistency and finite-dimensional realizations.

problem Consistency and existence of finite-dimensional realizations for multi-curve interest rate models.
method Geometric approach, characterizing consistency and existence of finite-dimensional realizations for multi-curve models.
result Characterization of consistency and existence of finite-dimensional realizations for multi-curve models.

Framework calibrates ML models for risk control in various tasks.

problem Achieving statistical guarantees for model predictions.
method Reframing risk control as multiple hypothesis testing, applying statistical techniques.
result New calibration methods for multi-label classification, instance segmentation, outlier detection, and confidence set coverage.

TA-CQR predicts regression intervals with exact coverage, splitting miscoverage between endpoints.

problem Predicting regression intervals with exact coverage under reporting constraints.
method TA-CQR uses tail allocation to parameterize the oracle, estimating the allocation by searching quantile cores and applying nonnegative additive split-conformal calibration.
result TA-CQR achieves exact finite-sample marginal coverage under exchangeability, with theoretical guarantees on calibration and length.

Two methods improve Gaussian process predictive distributions' calibration.

problem Improving the reliability of Gaussian process predictive intervals.
method Introduces two methods: cps-gp and bcr-gp, both adapting conformal predictive systems to GP interpolation.
result Both methods provide finite-sample marginal calibration and smooth predictive distributions.

We propose nonparametric methods for individual calibration in regression models.

problem Uncertainty quantification and individual calibration for regression models.
method Nonparametric methods agnostic of the underlying model, combining nonparametric and covering number arguments.
result Established matching upper and lower bounds for calibration error.

We lay down an elementary yet fundamental lemma concerning a finite algebraicness property of a smooth map from an Azumaya/matrix manifold with a fundamental module to a smooth manifold. This gives us a starting point to build a synthetic (synonymously, CC^{\infty}-algebraic) symplectic geometry and calibrated geometr…

2015-04-08abs ↗pdf ↗

New framework calibrates decision robustness using inverse conformal risk control.

problem Inadequate robustness levels in decision-making due to ad hoc choices.
method Constructs valid estimators to trace miscoverage-regret Pareto frontier.
result Provides distribution-free, finite-sample guarantees on robustness levels.

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.

Exact distribution of split conformal prediction coverage found.

problem Determining the reliability of prediction sets in batch mode.
method Analysis of exchangeable data to find universal distribution of empirical coverage.
result Exact distribution of empirical coverage is universal and determined by nominal miscoverage level and calibration sample size.

The paper improves conformal prediction by analyzing the beta law of conditional coverage.

problem Improving finite-sample marginal coverage guarantees for non-i.i.d. data.
method The method uses Wasserstein distances to quantify deviations from the beta law of conditional coverage.
result The framework provides direct bounds on marginal coverage gaps and bad-calibration probabilities.

The paper calibrates a model to market quotes efficiently and arbitrage-free.

problem Calibrating a model to market option quotes efficiently and without arbitrage.
method Piecewise-linear local variance function for efficient calibration.
result Arbitrage-free interpolation of class C2C^2 achieved under one millisecond.

Study shows pooling scores for conformal prediction distorts group coverage.

problem Pooling scores for conformal prediction distorts group coverage.
method Derived conservation law and lower bound, demonstrated tension between fairness definitions, quantified trade-off between policies.
result Pooling scores for conformal prediction distorts group coverage.

In this paper, we study a semi-martingale optimal transport problem and its application to the calibration of Local-Stochastic Volatility (LSV) models. Rather than considering the classical constraints on marginal distributions at initial and final time, we optimise our cost function given the prices of a finite number…

2019-06-15abs ↗pdf ↗

Better uncertainty estimates for neural networks using Gaussian process priors.

problem Poor uncertainty estimates in neural networks, especially on out-of-distribution data.
method Characterize the function-space prior of an ensemble of infinitely-wide neural networks as a Gaussian process and use it to build a probabilistic model.
result The approach improves calibration of neural networks, especially under distributional shift.

New method extends conformal prediction to multivariate settings using optimal transport.

problem Limited applicability of conformal prediction to multivariate real-valued scores.
method Use optimal transport to define vector-ranks and multivariate quantile regions for finite-sample coverage.
result Constructs the first multivariate conformal predictive distributions with finite-sample calibration.

This paper improves risk control for financial markets by calibrating VaR forecasts using conformal methods.

problem Nonstationary and regime-dependent losses in financial markets.
method Regime-weighted conformal risk control (RWC) for VaR forecasting.
result RWC improves regime-conditional stability in some settings with modest conservativeness changes.