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

Trend · papers per month

143286428571 · Jun 202019922001200920172026
48 results for Expectation consistency loss

This paper rethinks confidence calibration under covariate shifts.

problem Calibration methods struggle with covariate shifts and unstable importance weighting.
method Derives Expectation consistency condition and proposes Expectation consistency loss (ECL).
result ECL loss is compatible with various types of calibration and has the same sample complexity as ECE.

Develops a framework for consistent loss functions with variable transformations.

problem Lack of theoretical understanding of variable transformations in consistent loss functions.
method Formal characterizations of consistency for transformed loss functions in two cases: realization and prediction variables.
result Establishes new identifiable and elicitable functionals for complex predictive tasks.

The authors examine the concept of probability of default for asset-backed loans. In contrast to unsecured loans it is shown that probability of default can be defined as either a measure of the likelihood of the borrower failing to make required payments, or as the likelihood of an insufficiency of collateral value on…

2013-06-28abs ↗pdf ↗

A new tail-shape index based on Value at Risk and Expected Shortfall.

problem Measuring and comparing tail behavior of loss distributions.
method Introducing a new θθ-index based on equal level relationships between Value at Risk and Expected Shortfall.
result The θθ-index provides a level-dependent, scale-free measure of upper tail behavior.

We introduce a novel regression framework which simultaneously models the quantile and the Expected Shortfall (ES) of a response variable given a set of covariates. This regression is based on a strictly consistent loss function for the pair quantile and ES, which allows for M- and Z-estimation of the joint regression …

2017-04-07abs ↗pdf ↗

This work interprets GELU and related activations via a first-order loss function.

problem Understanding and optimizing activation functions in neural networks.
method Complementary interpretation using the Gaussian first-order loss function.
result Calibrated or learned uniform-threshold gates are competitive and often outperform GELU, ReLU, and SiLU/Swish.

Study asset pricing with reference-dependent preferences, finding matching equity premia.

problem Understanding asset pricing under reference-dependent preferences.
method Discrete-time consumption-based capital asset pricing model with reference-dependent preferences.
result Models can generate equity premia matching empirical estimates, showing procyclical price-dividend ratio and countercyclical equity premium.

Study excess risk in statistical inference with transformations.

problem Excess risk in estimating random variables from feature vectors and transformations.
method Characterize lossless transformations, develop test statistics, and information-theoretic bounds.
result Strongly consistent partitioning test statistic for lossless transformations.

Spectral images captured by satellites and radio-telescopes are analyzed to obtain information about geological compositions distributions, distant asters as well as undersea terrain. Spectral images usually contain tens to hundreds of continuous narrow spectral bands and are widely used in various fields. But the vast…

2018-02-07abs ↗pdf ↗

Regression, unlike classification, has lacked a comprehensive and effective approach to deal with cost-sensitive problems by the reuse (and not a re-training) of general regression models. In this paper, a wide variety of cost-sensitive problems in regression (such as bids, asymmetric losses and rejection rules) can be…

2012-11-05abs ↗pdf ↗

A new method approximates expected empirical loss for stochastic deep learning tasks.

problem Determining optimal step sizes for stochastic gradient descent in deep learning.
method Applying one-dimensional function fitting to noisy losses of vertical cross sections to approximate expected empirical loss.
result The method leads to a robust and straightforward optimization method that performs well across datasets and architectures.

Unified surrogate loss framework for multi-label learning with strong consistency guarantees.

problem Improving consistency and accounting for label correlations in multi-label learning.
method Introducing multi-label logistic loss and extending it to comprehensive multi-label comp-sum losses, proving strong consistency guarantees for any multi-label loss.
result Unified surrogate loss framework benefiting from strong consistency guarantees for any multi-label loss.

Loss-calibrated EP improves Bayesian decision-making by focusing on utility-sensitive posterior approximations.

problem Bayesian decision-making under asymmetric utility functions.
method Loss-calibrated expectation propagation (Loss-EP) that tilts the posterior towards higher utility decisions.
result Loss-EP can capture useful information for decision-making under asymmetric penalties.

Investigates conditions for risk or utility functionals to be sensitive to large losses.

problem Conditions for risk or utility functionals to be sensitive to large losses.
method Analyzes sensitivity to large losses for various risk and utility functionals.
result Value at Risk and Expected Shortfall generally fail to be sensitive to large losses, but expected utility functionals and certain adjusted versions are sensitive.

Study of loss functions for learning to defer, proving consistency.

problem Learning to defer in machine learning.
method Introduced a family of surrogate losses parameterized by ΨΨ and proved their consistency.
result Proved realizable HH-consistency and Bayes-consistency of specific surrogate losses.

Loss assigns examples to classes and superclasses in hierarchical data.

problem Learning from hierarchical classification problems with known class hierarchy.
method Introduces a loss function that considers the hierarchy of classes, aiming for consistent classification across different granularities.
result Improves accuracy and reduces coarse errors in classification compared to cross-entropy loss.

The debate of what quantitative risk measure to choose in practice has mainly focused on the dichotomy between Value at Risk (VaR) -- a quantile -- and Expected Shortfall (ES) -- a tail expectation. Range Value at Risk (RVaR) is a natural interpolation between these two prominent risk measures, which constitutes a trad…

2019-02-12abs ↗pdf ↗

Paper tackles regression with cost-based rejection, balancing prediction and rejection costs.

problem Regression with cost-based rejection, balancing prediction and rejection costs in a continuous target space.
method Formulated expected risk, derived Bayes optimal solution, proposed surrogate loss function.
result Bayes optimal solution can be recovered by the proposed surrogate loss function.

AUC (area under ROC curve) is an important evaluation criterion, which has been popularly used in many learning tasks such as class-imbalance learning, cost-sensitive learning, learning to rank, etc. Many learning approaches try to optimize AUC, while owing to the non-convexity and discontinuousness of AUC, almost all …

2012-08-03abs ↗pdf ↗

SEMF predicts prediction intervals for ML models using latent variables.

problem Uncertainty quantification in ML models, especially for diverse data distributions.
method Supervised Expectation-Maximization Framework (SEMF) extending EM algorithm for latent variable modeling.
result SEMF produces narrower prediction intervals with desired coverage probability.

Gaptron algorithm reduces mistakes in online multiclass classification.

problem Online multiclass classification with limited information.
method Randomized first-order algorithm exploiting the gap between zero-one loss and surrogate losses.
result First linear time algorithm with O(KT)O(K\sqrt{T}) expected regret.

The paper introduces risk consistency properties for credit ratings.

problem Promoting prudent investment decisions in credit ratings.
method Introducing and studying risk consistency properties in the framework of Choquet rating criteria.
result Characterization of Choquet risk measures and rating criteria satisfying risk consistency properties.

Under covariate shift, training (source) data and testing (target) data differ in input space distribution, but share the same conditional label distribution. This poses a challenging machine learning task. Robust Bias-Aware (RBA) prediction provides the conditional label distribution that is robust to the worstcase lo…

2017-12-28abs ↗pdf ↗

Dropout, a simple and effective way to train deep neural networks, has led to a number of impressive empirical successes and spawned many recent theoretical investigations. However, the gap between dropout's training and inference phases, introduced due to tractability considerations, has largely remained under-appreci…

2016-09-26abs ↗pdf ↗

Study combines VaR and ES forecasts using MCS to improve risk predictions.

problem Combining VaR and ES forecasts to improve risk predictions under uncertainty.
method Employed Model Confidence Set (MCS) methodology to identify best-performing models and combine their forecasts.
result Proposed combined predictors are robust and pass standard backtests.

Extends conformal prediction for controlling expected risk of monotone loss functions.

problem Controlling expected risk of monotone loss functions.
method Generalizes split conformal prediction with coverage guarantee, extending to distribution shift, quantile risk, multiple, adversarial, and expectations of U-statistics.
result Tight up to an O(1/n)\mathcal{O}(1/n) factor, with worked examples in computer vision and natural language processing.

This paper improves multi-label ranking by reweighting univariate losses, enhancing consistency and performance.

problem Improving multi-label ranking performance while maintaining consistency.
method Systematic study of consistency and generalization error bounds for learning algorithms, proposing a reweighted univariate loss.
result Inconsistent pairwise losses can lead to better performance than consistent univariate losses in practice.

OEUVRE estimates online loss with constant time and memory, outperforming other methods.

problem Accurately estimating expected loss in online learning.
method Recursive evaluation of each sample on current and previous models, using algorithmic stability for updates.
result Consistency, convergence rates, and concentration bounds proved for OEUVRE.

New algorithm identifies best arm in rested bandit setting.

problem Best arm identification in rested bandit with decreasing losses.
method Introduced a novel best arm identification problem and analyzed an arm elimination algorithm.
result Regret vanishes as time horizon increases, with convergence rate depending on expected loss function.

Study on calibration and consistency of adversarial surrogate losses.

problem Designing robust classifiers with theoretical guarantees.
method Extensive analysis of H-calibration and H-consistency of adversarial surrogate losses.
result Some convex loss functions and supremum-based convex losses are not H-calibrated for important hypothesis sets.

Just as semantic hashing can accelerate information retrieval, binary valued embeddings can significantly reduce latency in the retrieval of graphical data. We introduce a simple but effective model for learning such binary vectors for nodes in a graph. By imagining the embeddings as independent coin flips of varying b…

2018-03-25abs ↗pdf ↗

Study on HH-consistency bounds for machine learning surrogates.

problem Estimating target loss error relative to surrogate loss error in machine learning.
method Developed HH-consistency bounds for various surrogates and loss functions.
result Stronger guarantees than existing methods, offering distribution-dependent and -independent bounds.

The paper studies consistency of surrogate loss procedures under constrained classifiers.

problem Consistency of surrogate loss approaches under constrained classifiers without correct specification.
method The paper develops theoretical results and hinge loss based procedures for a constrained classification problem.
result Hinge losses are the only surrogate losses that preserve consistency in second-best scenarios.

In this study we prove the existence of statistical arbitrage opportunities in the Black-Scholes framework by considering trading strategies that consists of borrowing from the risk free rate and taking a long position in the stock until it hits a deterministic barrier level. We derive analytical formulas for the expec…

2014-06-21abs ↗pdf ↗