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

1122 · Sep 202019922001200920172026
26 results for risk-consistent

Paper connects risk consistency to L_p consistency for broader loss functions.

problem Establishing risk consistency for a wider class of loss functions.
method Analyzes the connection between risk consistency and L_p-consistency for various loss functions.
result Shifted loss functions do not reduce assumptions as much as other results.

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.

Paper proposes a new method for WDRO with local perturbations, achieving better accuracy.

problem Wasserstein distributionally robust optimization's theoretical understanding needs improvement.
method Develops a new approximation theorem and risk consistency results for WDRO.
result The proposed method achieves significantly higher accuracy on noisy datasets.

We axiomatically introduce risk-consistent conditional systemic risk measures defined on multidimensional risks. This class consists of those conditional systemic risk measures which can be decomposed into a state-wise conditional aggregation and a univariate conditional risk measure. Our studies extend known results f…

2016-09-26abs ↗pdf ↗

The literature on statistical learning for time series assumes the asymptotic independence or ``mixing' of the data-generating process. These mixing assumptions are never tested, nor are there methods for estimating mixing rates from data. We give an estimator for the ββ-mixing rate based on a single stationary sample…

2011-03-04abs ↗pdf ↗

The lasso and related sparsity inducing algorithms have been the target of substantial theoretical and applied research. Correspondingly, many results are known about their behavior for a fixed or optimally chosen tuning parameter specified up to unknown constants. In practice, however, this oracle tuning parameter is …

2013-08-04abs ↗pdf ↗

Develops PLL methods that are provably consistent and compatible with any deep network.

problem Lack of theoretical understanding and consistency in partial-label learning methods.
method Proposes a generation model for candidate label sets and develops two PLL methods that are risk- and classifier-consistent.
result Two novel PLL methods are guaranteed to be provably consistent.

We develop a unified approach for classification and regression support vector machines for data subject to right censoring. We provide finite sample bounds on the generalization error of the algorithm, prove risk consistency for a wide class of probability measures, and study the associated learning rates. We apply th…

2012-02-23abs ↗pdf ↗

Huber regression assessed for robustness in statistical learning.

problem Understanding Huber regression in nonparametric statistical learning.
method Assessment from statistical learning perspective, focusing on risk consistency, adaptive tuning, and convergence rates.
result Huber regression can be asymptotically mean regression calibrated under (1+ε)(1+ε)-moment conditions, justifying its robustness.

We study the problem of treatment effect estimation in randomized experiments with high-dimensional covariate information, and show that essentially any risk-consistent regression adjustment can be used to obtain efficient estimates of the average treatment effect. Our results considerably extend the range of settings …

2016-07-22abs ↗pdf ↗

A new XVA strategy rooted in balance sheet perspective improves equity process for bank shareholders.

problem Counterparty risk valuation adjustments (XVAs) in financial derivatives.
method Develops a cost-of-capital XVA strategy in a balance sheet perspective, solving explicitly in static setup and dynamically in trade context.
result Ensures a submartingale equity process corresponding to a target hurdle rate on capital at risk.

Develops an online federated learning framework for classification.

problem Handling streaming data from multiple clients while ensuring data privacy and efficiency.
method Leverages generalized distance-weighted discriminant technique and Majorization-Minimization principle.
result Achieves high classification accuracy, significant computational efficiency, and data security enhancements.

CDOT optimizes transport between domains preserving both feature and geometric structure.

problem Optimizing transport between heterogeneous domains with preserved feature and geometric structure.
method CDOT uses operator-based regularization to align distance structures, proving pseudometric properties.
result CDOT improves robustness to local geometric variations and is provably convex.

The paper calculates MES bounds for systemic risk contributions under uncertain dependence.

problem Measuring systemic risk contributions of financial firms under uncertainty in dependence structure.
method Derives worst-case and best-case bounds for MES under known individual firm risks and partial dependence information.
result Improved MES bounds derived for various types of dependence models.

This paper investigates the efficacy of a regularized multi-task learning (MTL) framework based on SVM (M-SVM) to answer whether MTL always provides reliable results and how MTL outperforms independent learning. We first find that M-SVM is Bayes risk consistent in the limit of large sample size. This implies that despi…

2018-05-31abs ↗pdf ↗

Proposes a method to classify binary data from multiple unlabeled datasets.

problem High annotation costs in training classifiers from weakly supervised data.
method Introduces surrogate set classification (SSC) to predict data origin from multiple unlabeled datasets, then uses this to train a binary classifier.
result Demonstrates superior performance compared to existing methods.

New method for PU learning with instance-dependent propensity scores.

problem Learning from positive and unlabeled data with instance-dependent labeling.
method Empirical risk minimization of joint risk function, alternating optimization of posterior probability and propensity score.
result The method achieves comparable or better performance than state-of-the-art methods.