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

Trend · papers per month

78156234312 · May 202619922001200920172026
48 results for Smooth Calibrations

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.

The paper provides a uniform convergence bound for smooth calibration error and its relationship with functional gradient.

problem Limited theoretical understanding of learning algorithms achieving high accuracy and good calibration.
method Focuses on smooth calibration error, providing a uniform convergence bound and proving the relationship with functional gradient.
result Derives conditions for simultaneous classification and calibration guarantees in gradient boosting trees, kernel boosting, and neural networks.

Improves confidence calibration in neural networks by smoothing labels based on class similarity.

problem Improving confidence calibration in deep neural networks for safety-critical applications.
method Proposes a novel label smoothing technique where label values are based on similarities with the reference class, using different similarity measurements.
result Consistently outperforms state-of-the-art calibration techniques on various datasets and network architectures.

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 ↗

The study examines label smoothing to improve confidence calibration in fine-tuned LLMs.

problem Improving confidence calibration in fine-tuned large language models (LLMs) after instruction tuning.
method Examine various open-sourced LLMs, label smoothing, and custom kernel design.
result Label smoothing is effective in maintaining confidence calibration but faces challenges in large vocabulary LLMs.

New algorithms achieve decision calibration without sample complexity dependent on feature dimension.

problem Achieving decision calibration for nonlinear loss functions with polynomial sample complexity.
method Developed smooth relaxation of decision calibration, enabling dimension-free algorithms.
result Efficient algorithms post-process predictors to satisfy decision calibration without worsening accuracy.

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.

Post-processing predictors reduces calibration errors for decision-making.

problem Predictors with low calibration error for machine learning may have high error for decision-making.
method Post-processing with ε distance to calibration adds noise to make predictions differentially private.
result Post-processing achieves O(√ε) ECE and CDL, asymptotically optimal.

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.

New method calibrates multi-class predictions efficiently without sacrificing accuracy.

problem Efficiently calibrating multi-class predictions without sacrificing accuracy.
method Formulated robust projected smooth calibration and new recalibration algorithms.
result Achieves strong guarantees for binary classification tasks with polynomial complexity.

This is a companion note of [Zhaa] (arXiv:1501.01836) where the extension of local calibration pairs of smooth submanifolds is discussed. Here we emphasize on the case of singular submanifolds. More precisely, we study when a calibration pair around the singular set of a submanifold can extend to a local calibration pa…

2015-01-25abs ↗pdf ↗

We equip many non compact non simply connected surfaces with smooth Riemannian metrics whose isoperimetric profile is smooth, a highly non generic property. The computation of the profile is based on a calibration argument, a rearrangement argument, the Bol-Fiala curvature dependent inequality, together with new result…

2007-01-07abs ↗pdf ↗

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.

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.

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.

Study shows multilingual LLM calibration effects improve model confidence but not accuracy.

problem Improving multilingual language model calibration in low-resource settings.
method Analysis of two multilingual benchmarks using instruction-tuning and label smoothing.
result Model confidence increases in low-resource languages after instruction-tuning but accuracy improvements are marginal.

Label smoothing improves model performance even with noisy labels.

problem Mitigating label noise in deep learning models.
method Examined label smoothing as a technique to cope with label noise and compared it to loss-correction methods.
result Label smoothing is competitive with loss-correction techniques under label noise and beneficial for distillation from noisy data.

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.

In many classification problems it is desirable to output well-calibrated probabilities on the different classes. We propose a robust, non-parametric method of calibrating probabilities called SplineCalib that utilizes smoothing splines to determine a calibration function. We demonstrate how applying certain transforma…

2018-09-20abs ↗pdf ↗

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 ↗

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 ↗

For an element ΨΨ in the graded vector space Ω(M,TM)Ω^*(M, TM) of tangent bundle valued forms on a smooth manifold MM, a ΨΨ-submanifold is defined as a submanifold NN of MM such that ΨNΩ(N,TN)Ψ_{|N} \in Ω^*(N, TN). The class of ΨΨ-submanifolds encompasses calibrated submanifolds, complex submanifolds and all Lie subgroups in…

2018-04-16abs ↗pdf ↗

New algorithm reduces prediction errors across various loss functions.

problem Online forecasting algorithms' inability to adapt to different loss functions.
method Design of a novel Follow-the-Perturbed-Leader (FTPL) algorithm with self-concordant noise.
result Simultaneously achieves ildeO(T) ilde O(\sqrt{T}) regret for bounded proper losses and O(logT)O(\log T) regret for bounded smooth proper losses.

The generalization and learning speed of a multi-class neural network can often be significantly improved by using soft targets that are a weighted average of the hard targets and the uniform distribution over labels. Smoothing the labels in this way prevents the network from becoming over-confident and label smoothing…

2019-06-06abs ↗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.

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 construct a Riemannian metric gg on R4\mathbb{R}^4 (arbitrarily close to the euclidean one) and a smooth simple closed curve ΓR4Γ\subset \mathbb R^4 such that the unique area minimizing surface spanned by ΓΓ has infinite topology. Furthermore the metric is almost Kähler and the area minimizing surface is calibrated…

2019-06-22abs ↗pdf ↗

Proposes a method to repair arbitrage in option prices data.

problem Arbitrage in option price data can lead to poor performance or failure of financial applications.
method Formulates data repair as a linear programming (LP) problem to minimise price changes within bid and ask price bounds.
result The proposed method gives sparse perturbations on data and improves model calibration with enhanced robustness and reduced calibration error.

We propose to use nonparametric Bernstein copulas as bivariate pair-copulas in high-dimensional vine models. The resulting smooth and nonparametric vine copulas completely obviate the error-prone need for choosing the pair-copulas from parametric copula families. By means of a simulation study and an empirical analysis…

2012-10-07abs ↗pdf ↗

This paper is devoted to the application of B-splines to volatility modeling, specifically the calibration of the leverage function in stochastic local volatility models and the parameterization of an arbitrage-free implied volatility surface calibrated to sparse option data. We use an extension of classical B-splines …

2013-06-05abs ↗pdf ↗

We study the out-of-sample properties of robust empirical optimization problems with smooth φφ-divergence penalties and smooth concave objective functions, and develop a theory for data-driven calibration of the non-negative "robustness parameter" δδ that controls the size of the deviations from the nominal model. Bu…

2017-11-17abs ↗pdf ↗

Using Malliavin calculus techniques, we derive an analytical formula for the price of European options, for any model including local volatility and Poisson jump process. We show that the accuracy of the formula depends on the smoothness of the payoff function. Our approach relies on an asymptotic expansion related to …

2007-12-20abs ↗pdf ↗

The paper solves Bernstein problems for specific submanifolds in high-dimensional spaces.

problem Bernstein problem for smooth maps to lower dimensions forming calibrated submanifolds.
method Established conditions for maps to be affine based on the slope's second elementary symmetric polynomial.
result Conditions ensuring maps are affine for coassociative and Cayley submanifolds in R7\mathbb{R}^7 and R8\mathbb{R}^8.