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

25.0%50.0%75.0%100.0% · Jun 199319922001200920172026
48 results for Calibration theory

We introduce and study the notion of plurisubharmonic functions in calibrated geometry. These functions generalize the classical plurisubharmonic functions from complex geometry and enjoy their important properties. Moreover, they exist in abundance whereas the corresponding pluriharmonics are generally quite scarce. A…

2007-10-21abs ↗pdf ↗

We provide an introduction to the theory of calibrated submanifolds through the key examples related with special holonomy. We focus on calibrated geometry in Calabi-Yau, G2_2 and Spin(7) manifolds, and describe fundamental results and techniques in the field.

2018-10-19abs ↗pdf ↗

New framework ensures valid uncertainty estimates for any data stream changes.

problem Challenges of distribution shifts and adversarial actors in real-world data streams.
method Leveraging Blackwell approachability from game theory, the framework guarantees calibrated uncertainties for any compact space.
result Improves calibration and decision-making for energy systems.

Study of interactions between functions on manifolds via submersions.

problem Understanding interactions between convex, subharmonic, and pluri-subharmonic functions on manifolds.
method Application of pluri-potential theory and analysis of Kähler and G2 manifolds.
result Previous results on Lagrangian fibrations can be viewed as applications of this framework.

We review some results concerning the deformations of calibrated minimal submanifolds which occur in Riemannian manifolds with special holonomy. The calibrated submanifolds are assumed compact with a non-empty boundary which is constrained to move in a particular fixed submanifold. The results extend McLean's deformati…

2019-10-02abs ↗pdf ↗

We introduce a version of Aubry-Mather theory for the length functional of causal curves in compact Lorentzian manifolds. Results include the existence of maximal invariant measures, calibrations and calibrated curves. We prove two versions of the Mather's graph theorem. A class of examples, the Lorentzian Hedlund exam…

2011-02-07abs ↗pdf ↗

For Hitchin's generalised geometries we introduce and analyse the concept of a structured submanifold which encapsulates the classical notion of a calibrated submanifold. Under a suitable integrability condition on the ambient geometry, these generalised calibrated cycles minimise a functional occurring as D-brane ener…

2006-05-29abs ↗pdf ↗

New method improves decision-making accuracy without complex calculations.

problem Improving decision-making accuracy in machine learning.
method Introducing a new measure called calibration decision loss (CDLK\mathsf{CDL}_K) for structured families of post-processing functions.
result Proves upper and lower bounds for natural classes KK of post-processing functions.

New framework allows selective removal of stale data in option calibration.

problem Inability to remove old data from calibrated option pricing models without full retraining.
method Introduces operator-theoretic Gauss-Newton framework for selective forgetting.
result Provides stability guarantees and perturbation bounds for selective data removal.

We construct a deep portfolio theory. By building on Markowitz's classic risk-return trade-off, we develop a self-contained four-step routine of encode, calibrate, validate and verify to formulate an automated and general portfolio selection process. At the heart of our algorithm are deep hierarchical compositions of p…

2016-05-23abs ↗pdf ↗

This paper argues against using calibration metrics for assessing posterior probabilities and proposes expected proper scoring rules instead.

problem The assessment of posterior probabilities generated by machine learning classifiers using calibration metrics is flawed and should be replaced with expected proper scoring rules.
method The paper reviews proper scoring rules from a practical perspective, explains why expected PSRs are a principled measure of posterior quality, and introduces a new calibration metric called calibration loss.
result Calibration loss is superior to expected calibration error and expected score divergence calibration metrics for assessing posterior probabilities.

Unique solutions found for Plateau problems in smooth and continuous calibrations.

problem Finding unique solutions to the Plateau problem for specific types of currents.
method Boundary regularity theory for area-minimizing currents and unique continuation argument.
result Every compactly supported smoothly or continuously calibrated integral current is the unique solution to the Plateau problem for its boundary data.

For product manifolds, cohomologically calibrated affine connections are geometrically irreducible.

problem Establishing geometric irreducibility of cohomologically calibrated affine connections on product manifolds.
method Proof relies on Hodge theory and integral arguments showing non-cancellation of off-diagonal components in the Riemann curvature tensor.
result Cohomologically calibrated affine connections on product manifolds are holonomically irreducible.

New truthful calibration errors improve model ranking in multiclass prediction.

problem Non-truthful calibration errors can mislead model comparisons.
method Introduced perfectly truthful calibration errors for multiclass predictions.
result Truthful calibration errors preserve decision-theoretic dominance and stabilize model rankings.

Study adiabatic limits of calibrated submanifolds in Riemannian geometry.

problem Understanding the behavior of calibrated submanifolds under adiabatic limits.
method Define a 1-parameter family of forms and study their adiabatic limit, showing it is a generalized calibration.
result Adiabatic calibrated submanifolds are anisotropic minimal in the classical sense.

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 paper improves methods for generating prediction intervals in regression.

problem Uncertainty quantification in regression models.
method Formalizes prediction interval generation as an optimization problem, studying generalization and calibration.
result Empirical demonstration of improved testing performances compared to existing methods.

In this paper we introduce and study the notion of plurisubharmonic functions in calibrated geometry. These functions generalize the classical plurisubharmonic functions from complex geometry and enjoy many of their important properties. Moreover, they exist in abundance whereas the corresponding pluriharmonics are gen…

2006-01-19abs ↗pdf ↗

The paper studies pp-harmonic functions and their conjugates, showing they converge to calibrations of laminations.

problem Behavior of qq-harmonic functions and their conjugates in the limit as qo1q o 1.
method Analysis of pp-harmonic conjugates and their convergence to calibrations of laminations.
result The laminations calibrated by the limiting pp-harmonic conjugates are exactly those arising from the 11-Laplacian.

LLMs show surprising confidence in their answers, beyond just tokens.

problem LLMs lack meaningful confidence estimates for their responses.
method Semantic calibration test based on local loss optimality and equivalence classes.
result Base LLMs are semantically calibrated across tasks, contrary to expectations.

Post-hoc calibration of neural networks using g-Layers proves theoretical justification.

problem Ensuring the confidence of neural network decisions in real-world applications.
method Proves theoretical justification for post-hoc calibration methods by adding g-Layers and minimizing NLL.
result Proves that adding g-Layers and minimizing NLL can lead to a calibrated network.

MCP extends conformal prediction to vector-valued score functions without data splitting.

problem Fixed prediction set shapes in scalar score functions limit coverage guarantees.
method MCP uses a single optimization problem for prediction set design and calibration, eliminating data splitting.
result RemMCP and RelMCP achieve target coverage with smaller or comparable prediction set sizes, reducing variance.

These notes are based on lectures given at the Clay School on Geometry and String Theory, Isaac Newton Institute, Cambridge, 25 March - 19 April 2002. They attempt to provide an elementary and somewhat self contained discussion of the construction of supergravity solutions describing branes wrapping calibrated cycles, …

2003-05-09abs ↗pdf ↗

The paper uses optimal transport to calibrate stochastic simulations.

problem Improper fidelity of stochastic simulators in scientific applications.
method Optimal transport theory applied to neural network corrections.
result Calibrated stochastic simulations improve fidelity to reality.

The subject of these Notes is the new proof, proposed in [F. H{é}lein, In{é}galit{é} isop{é}rim{é}trique et calibrations, Annales de l'Institut Fourier 44, 4 (1994), 1211-1218] of the classical isoperimetric inequality in the plane. This proof is far from being the first one, but its interest is that it uses essentiall…

2018-05-25abs ↗pdf ↗

In this paper we study several issues related to the generation of superpotential induced by background Ramond-Ramond fluxes in compactification of Type IIA string theory on Calabi-Yau four-folds. Identifying BPS solitons with D-branes wrapped over calibrated submanifolds in a Calabi-Yau space, we propose a general for…

1999-11-03abs ↗pdf ↗

We systematically analyse the necessary and sufficient conditions for the preservation of supersymmetry for bosonic geometries of the form R^{1,9-d} \times M_d, in the common NS-NS sector of type II string theory and also type I/heterotic string theory. The results are phrased in terms of the intrinsic torsion of G-str…

2003-02-19abs ↗pdf ↗

The study analyzes Dirac operators twisted by specific bundles, revealing their geometric and regularity properties.

problem Analyzing Dirac operators twisted by ramified Euclidean line bundles.
method Describes closed extensions of Dirac operators in terms of Gelfand-Robbin quotient, constructs geometric realizations, and develops an L2L^2 regularity theory.
result Geometric realizations of the Gelfand-Robbin quotient and an L2L^2 regularity theory are constructed.

This work tackles uncertainty quantification in language models, proposing a principled approach.

problem Challenges in identifying task-specific uncertainties in large language models.
method Bayesian decision theory, focusing on a similarity measure between generated and hypothetical true responses.
result Derives a measure for epistemic uncertainty based on a missing data perspective.

Probabilistic classifiers output a probability distribution on target classes rather than just a class prediction. Besides providing a clear separation of prediction and decision making, the main advantage of probabilistic models is their ability to represent uncertainty about predictions. In safety-critical applicatio…

2019-02-19abs ↗pdf ↗