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

Trend · papers per month

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for calibration-based approach

Language models are miscalibrated, leading to overestimated entropy rates and memory usage.

problem Miscalibration of language models leading to overestimated entropy rates and memory usage.
method Calibration-based approach to measure discrepancies and improve models.
result State-of-the-art language models are miscalibrated, causing overestimated entropy rates and memory usage.

New approach for adaptive conformal inference using Blackwell's theory.

problem Non-exchangeable environments in sequential conformal inference.
method Reinterpretation of ACI as a game, construction of coverage and efficiency objectives, approachability strategy.
result Algorithm achieves strong theoretical guarantees and practical insights.

Recently, a novel family of biologically plausible online algorithms for reducing the dimensionality of streaming data has been derived from the similarity matching principle. In these algorithms, the number of output dimensions can be determined adaptively by thresholding the singular values of the input data matrix. …

2016-12-11abs ↗pdf ↗

Reassesses calibration metrics in machine learning models.

problem Inconsistent reporting of calibration metrics in recent literature.
method Calibration-based decomposition of Bregman divergences, visualization of calibration and generalization error.
result New visualization technique for detecting trade-offs between calibration and generalization.

The paper explores various forms of calibration scores and their implications for fairness.

problem The evaluation of probabilistic predictions through calibration.
method The authors organize three grouping choices and one agglomeration of group errors, providing a framework for comparing and creating new calibration scores.
result The study demonstrates that appropriate choices of grouping can provide notions of (sub-)group or individual fairness.

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 ↗

New method calibrates uncertainty estimates for image classifiers without labeled data.

problem Uncertainty estimates for modern classifiers are unreliable without labeled calibration data.
method Calibrates uncertainty estimates using unlabeled examples for distribution shifts.
result Proposes a method that provides excellent uncertainty estimates under natural distribution shifts.

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.

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.

Geometric approach combines asset returns and investor views for better portfolio optimization.

problem Optimizing portfolios with investor-specific views.
method Generalized Wasserstein barycenter (GWB) to integrate statistical asset returns and investor views.
result The geometric approach offers more flexibility and rewards for correct investor views.

Paper proposes an alternative method to price American options using HJM approach.

problem Price American options efficiently and accurately.
method Utilizes HJM technique to model term structure of volatility for equity markets.
result Proposes a new value function, stopping criteria, and stopping time for American options.

We study inference and learning based on a sparse coding model with `spike-and-slab' prior. As in standard sparse coding, the model used assumes independent latent sources that linearly combine to generate data points. However, instead of using a standard sparse prior such as a Laplace distribution, we study the applic…

2012-11-15abs ↗pdf ↗

We develop a semi-analytic approach to the valuation of auto-callable structures with accrual features subject to barrier conditions. Our approach is based on recent studies of multi-assed binaries, present in the literature. We extend these studies to the case of time-dependent parameters. We compare numerically the s…

2016-08-18abs ↗pdf ↗

Two ML approaches learn local volatility surfaces from option prices, with GP being arbitrage-free.

problem Interpolating European vanilla option prices to create a local volatility surface.
method Gaussian process regression and neural net with arbitrage penalties.
result GP approach is arbitrage-free and yields best out-of-sample calibration error.

This paper critiques the Standardized Measurement Approach (SMA) for operational risk and recommends maintaining Advanced Measurement Approach (AMA).

problem Weaknesses and failures of the Standardized Measurement Approach (SMA) in operational risk.
method Critical review and analysis of SMA and AMA approaches.
result SMA is unstable, insensitive to risk, and implicitly related to systemic risk in the banking sector.

Two approaches extend knowledge distillation to Gaussian Processes, showing relationships to existing methods.

problem Applying knowledge distillation to Gaussian Processes for regression and classification.
method Data-centric and distribution-centric approaches to extend distillation to GPR and GPC.
result Distribution-centric approach for GPC approximately corresponds to data duplication and scaling.

We discuss the relative merits of optimistic and randomized approaches to exploration in reinforcement learning. Optimistic approaches presented in the literature apply an optimistic boost to the value estimate at each state-action pair and select actions that are greedy with respect to the resulting optimistic value f…

2017-06-13abs ↗pdf ↗

Bayesian symbolic regression automates model discovery from data.

problem Learning closed-form mathematical models from data using heuristic methods.
method Probabilistic approach to symbolic regression, connecting to information theory and statistical physics.
result Probabilistic approach provides model plausibility and performance guarantees.

Paper compares neural network approaches to Optimal Transport.

problem Learning Optimal Maps between probability distributions.
method Two categories of approaches: heuristic and math-justified. Novel approach involves dynamic flows and supervised learning.
result Novel approach involving dynamic flows and reductions of Optimal Transport to supervised learning.

New approach interprets Nyström for kernel machines with geometric insight.

problem No comparative study over Nyström-based kernel machine approaches.
method Developed a new approach with geometric interpretation, showing equivalence to existing methods.
result Proposed approach offers insights into approximation errors and accuracy.

Common Representation Learning (CRL), wherein different descriptions (or views) of the data are embedded in a common subspace, is receiving a lot of attention recently. Two popular paradigms here are Canonical Correlation Analysis (CCA) based approaches and Autoencoder (AE) based approaches. CCA based approaches learn …

2015-04-27abs ↗pdf ↗

Paper evaluates CNN-based facial landmark detection methods.

problem Evaluate characteristics and performance of CNN-based facial landmark detection methods.
method Divided into regression and heatmap approaches, investigated using a hybrid loss function and discrimination network.
result Proposed model outperforms other models in all tested datasets.

This paper provides a comprehensive benchmark and taxonomy for certifiably robust DNN defenses.

problem Certifiably robust defenses against adversarial attacks for deep neural networks.
method Taxonomy and benchmark of certifiably robust approaches.
result First comprehensive benchmark of certifiably robust approaches on different datasets.

Unified approach for Bayesian optimal experiment design using stochastic gradients.

problem Designing optimal experiments in high-dimensional settings.
method Stochastic gradient ascent to optimize variational lower bounds on expected information gain.
result Unified approach outperforms existing methods in higher dimensions.