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.
The paper studies how to extend local calibration pairs to global ones in various situations. As a result, new discoveries involving mass-minimizing properties are exhibited. In particular, we show that a R-homologically nontrivial connected submanifold M of a smooth Riemannian manifold X is homologically…
Given a transportation cost c:M×Mˉ→R, optimal maps minimize the total cost of moving masses from M to Mˉ. We find a pseudo-metric and a calibration form on M×Mˉ such that the graph of an optimal map is a calibrated maximal submanifold. We define the mass of space-like current…
The paper develops methods to predict the probability of achieving a user goal in a task, ensuring the system alerts when the probability falls below a threshold.
problem Ensuring an autonomous system achieves the user's goal with calibrated probability estimates.
method Invertible conformal prediction using Probability-space Conformalized Quantile Regression (PCQR) to produce well-calibrated conditional prediction intervals.
result The method produces well-calibrated probabilities that the cumulative reward will fall within a user-specified target interval, with finite-sample guarantees.
We prove that tangent cones to 2-dimensional calibrated cycles are unique. Using this result we prove a rate of convergence for the mass of the blow-up of a calibrated integral 2-cycle towards the limiting density. With the same techniques, we can also prove such a rate for J-holomorphic maps between almost complex man…
Study of large mass limits of G2 and Calabi-Yau monopoles on specific manifolds.
problem Understanding the behavior of monopoles in the large mass limit on G2 and Calabi-Yau manifolds.
method Developed a structure theory for the limit of SU(2)G2-monopoles and Calabi-Yau monopoles, extracting singular abelian G2-monopoles with Dirac singularities.
result Proved an energy identity for monopole bubbles in the large mass limit.
The task of calibration is to retrospectively adjust the outputs from a machine learning model to provide better probability estimates on the target variable. While calibration has been investigated thoroughly in classification, it has not yet been well-established for regression tasks. This paper considers the problem…
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.
In this paper we calibrate chaotic models for interest rates to market data using a polynomial-exponential parametrization for the chaos coefficients. We identify a subclass of one-variable models that allow us to introduce complexity from higher order chaos in a controlled way while retaining considerable analytic tra…
We propose a correlated stochastic process of which the novel non-Gaussian probability mass function is constructed by exactly solving moment generating function. The calculation of cumulants and auto-correlation shows that the process is convergent and scale invariant in the large but finite number limit. We demonstra…
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…
The Gilbert-Steiner problem is a mass transportation problem, where the cost of the transportation depends on the network used to move the mass and it is proportional to a certain power of the "flow". In this paper, we introduce a new formulation of the problem, which turns it into the minimization of a convex function…
Study examines Yang-Mills-Higgs energy convergence to codimension-three area functional.
problem Asymptotic behavior of Yang-Mills-Higgs energy in large mass limit.
method Investigates the asymptotic behavior of Yang-Mills-Higgs energy in the large mass limit, proving convergence to the codimension-three area functional.
result The (n−3)-currents dual to the Yang-Mills-Higgs energy converge to a relative integral (n−3)-cycle.
The Gaussian mechanism is an essential building block used in multitude of differentially private data analysis algorithms. In this paper we revisit the Gaussian mechanism and show that the original analysis has several important limitations. Our analysis reveals that the variance formula for the original mechanism is …
Sources of variability in experimentally derived data include measurement error in addition to the physical phenomena of interest. This measurement error is a combination of systematic components, originating from the measuring instrument, and random measurement errors. Several novel biological technologies, such as ma…
One of the consequences of passing from mass production to mass customization paradigm in the nowadays industrialized world is the need to increase flexibility and responsiveness of manufacturing companies. The high-mix / low-volume production forces constant accommodations of unknown product variants, which ultimately…
The paper proposes a method to construct well-calibrated prediction sets for correlated target variables.
problem Constructing well-calibrated prediction sets for correlated target variables.
method The method uses vine copulas to estimate the joint cumulative distribution function of non-conformity scores and improves the asymptotic efficiency of the quantile estimate.
result The method guarantees asymptotically exact coverage and competitive efficiency on real-world regression problems.
We describe a high performance parallel implementation of a derivative pricing model, within which we introduce a new parallel method for the calibration of the industry standard SABR (stochastic-αβρ) stochastic volatility model using three strike inputs. SABR calibration involves a non-linear three dimensional minimis…
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.
In this work we present an analytical model, based on the path-integral formalism of Statistical Mechanics, for pricing options using first-passage time problems involving both fixed and deterministically moving absorbing barriers under possible non-gaussian distributions of the underlying object. We adapt to our probl…
Whether you trade futures for yourself or a hedge fund, your strategy is counted. Long and short position limits make the number of unique strategies finite. Formulas of the numbers of strategies, transactions, do nothing actions are derived. A discrete distribution of actions, corresponding probability mass, cumulativ…
Supervised learning is the workhorse for regression and classification tasks, but the standard approach presumes ground truth for every measurement. In real world applications, limitations due to expense or general in-feasibility due to the specific application are common. In the context of agriculture applications, yi…
CPCR mitigates bias in PCR for overparameterized models.
problem Bias in Principal Component Regression (PCR) for overparameterized models.
method Calibrated Principal Component Regression (CPCR) learns a low-variance prior in the PC subspace and calibrates the model in the original feature space.
result CPCR outperforms standard PCR in overparameterized settings, improving prediction across multiple problems.