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

Trend · papers per month

4794140187 · May 202619922001200920172026
48 results for cumulative mass calibration

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.

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\mathbb R-homologically nontrivial connected submanifold MM of a smooth Riemannian manifold XX is homologically…

2015-11-12abs ↗pdf ↗

Given a transportation cost c:M×MˉRc: M \times\bar M \to\mathbf{R}, optimal maps minimize the total cost of moving masses from MM to Mˉ\bar M. We find a pseudo-metric and a calibration form on M×MˉM\times\bar M such that the graph of an optimal map is a calibrated maximal submanifold. We define the mass of space-like current…

2009-07-28abs ↗pdf ↗

The study uses statistical methods to analyze nuclear mass models.

problem Understanding the information content of nuclear masses from models.
method Bayesian calibration, Bayesian model averaging, chi-square correlation analysis, principal component analysis.
result A dramatic parameter reduction can be achieved in both 4-parameter and 14-parameter models.

The paper introduces a spline-based method for calibrating neural networks.

problem Ensuring neural network outputs are reliable for safety-critical applications.
method Approximating the empirical cumulative distribution function using splines to map network outputs to calibrated probabilities.
result The spline-based recalibration consistently outperforms existing methods on calibration measures.

Improves calibration of regression models without requiring additional data.

problem Poor calibration of regression models leading to unreliable predictions.
method Quantile regularizer based on cumulative KL divergence.
result Significantly improves calibration for regression models trained with Dropout VI and Deep Ensembles.

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.

A method to monitor probability predictions for calibration loss in image classification models.

problem Maintaining calibration in machine learning predictions over time.
method Cumulative sum-based approach with dynamic limits for early detection of miscalibration.
result Early detection of operational context changes impacting image classification performance.

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…

2005-01-29abs ↗pdf ↗

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)SU(2) G2G_2-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…

2018-06-20abs ↗pdf ↗

New method detects strong calibration in ML models, even for small poorly calibrated subgroups.

problem Auditing machine learning models for strong calibration is difficult, especially for small poorly calibrated subgroups.
method Reorder observations by expected residuals and use changepoint detection for score-based cumulative sum (CUSUM) test.
result The proposed adaptive CUSUM test consistently achieved higher power and more than doubled power in auditing mortality risk prediction models.

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.

Plots show miscalibration directly as slopes of secant lines.

problem Detecting discrepancies between probabilistic predictions and actual outcomes.
method Cumulative differences between observed and expected values displayed as slopes of secant lines.
result Directly shows miscalibration without binning or kernel density estimation.

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…

2011-06-13abs ↗pdf ↗

New findings show that not all area-minimizing surfaces are calibrated, even on complex manifolds.

problem Understanding when area-minimizing surfaces cannot be calibrated.
method Analyzing homology classes and metrics on manifolds to determine if area-minimizers are calibrated.
result Calibrated area-minimizers are non-generic, challenging the common assumption that they are typical.

Histogram binning method proven with guarantees without splitting data.

problem Proving theoretical guarantees for histogram binning without sample splitting.
method Using Markov property of order statistics to prove calibration guarantees for original method.
result Proves histogram binning has strong calibration guarantees without sample splitting.

Study three types of uncertainty quantification for binary classification without distributional assumptions.

problem Uncertainty quantification for binary classification in a distribution-free setting.
method Established theorems connecting calibration, confidence intervals, and prediction sets for score-based classifiers.
result Distribution-free calibration is only possible using scoring functions that partition feature space into countably many sets.

DNAMite creates interpretable, calibrated survival analysis models.

problem Limited interpretability in survival analysis models, especially for healthcare applications.
method Feature discretization and kernel smoothing in embedding module for flexible shape functions.
result DNAMite produces calibrated shape functions interpretable as contributions to cumulative incidence function.

Bayesian framework predicts aerodynamic uncertainty from sparse measurements.

problem Calibrating aerodynamic models with sparse and uncertain measurements.
method Bayesian latent Gaussian process for surrogate model calibration.
result Calibrated surrogate model accurately predicts aerodynamic 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.

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…

2014-08-11abs ↗pdf ↗

Meta-learning improves Gaussian process uncertainty estimation.

problem Poor uncertainty estimation in Gaussian processes with deep kernels.
method Meta-learning to calibrate deep kernel GPs using task-specific uncalibrated and calibrated distributions.
result Improves uncertainty estimation performance with high regression performance.

Study online monotone density estimation with expert aggregation and log-optimal calibration.

problem Online monotone density estimation and log-optimal calibration.
method Proposed two online estimators: Grenander estimator and expert aggregation estimator.
result Online estimators achieve O(n1/3)O(n^{1/3}) cumulative log-likelihood gap and nlogn\sqrt{n\log{n}} pathwise regret bound.

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 (n3)(n-3)-currents dual to the Yang-Mills-Higgs energy converge to a relative integral (n3)(n-3)-cycle.

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…

2016-10-13abs ↗pdf ↗

This work tackles multivariate CDFs and copulas using tensor factorization.

problem Learning multivariate distributions, especially for mixed random variables, is challenging.
method Introducing a low-rank model for efficient sampling, inference, and uncertainty quantification.
result The proposed model outperforms traditional methods in various applications.

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.

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.

The paper prices energy spread options using a complex stochastic model.

problem Pricing energy spread options with specific stochastic dynamics.
method Uses an exponential Ornstein-Uhlenbeck process driven by variance gamma processes, applying the Esscher transform and FFT method.
result Derives an analytical formula for pricing forwards and spread options.

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…

2017-12-19abs ↗pdf ↗

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.