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.
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.
Observing prices of European put and call options, we calibrate exponential Lévy models nonparametrically. We discuss the efficient implementation of the spectral estimation procedures for Lévy models of finite jump activity as well as for self-decomposable Lévy models. Based on finite sample variances, confidence inte…
Confidence intervals and joint confidence sets are constructed for the nonparametric calibration of exponential Lévy models based on prices of European options. To this end, we show joint asymptotic normality in the spectral calibration method for the estimators of the volatility, the drift, the jump intensity and the …
Calibration of stochastic local volatility (SLV) models to their underlying local volatility model is often performed by numerically solving a two-dimensional non-linear forward Kolmogorov equation. We propose a novel finite volume (FV) discretization in the numerical solution of general 1D and 2D forward Kolmogorov eq…
Feature selection is a standard approach to understanding and modeling high-dimensional classification data, but the corresponding statistical methods hinge on tuning parameters that are difficult to calibrate. In particular, existing calibration schemes in the logistic regression framework lack any finite sample guara…
The paper proposes a method to calibrate evidential clustering using bootstrapped finite mixture models.
problem Representing uncertainty in cluster membership using Dempster-Shafer mass functions.
method Constructing Dempster-Shafer mass functions by bootstrapping finite mixture models, computing confidence intervals, and calibrating the evidential partition.
result The proposed method calibrates the evidential partition such that the belief and plausibility degrees approximate the true probabilities with high confidence.
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 …
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…
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.
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, C∞-algebraic) symplectic geometry and calibrated geometr…
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…
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.