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

52104155207 · Jun 202019922001200920172026
48 results for risk attribution

Study examines how machine learning attribution methods reflect risk in finance.

problem Ensuring machine learning attribution methods accurately reflect underlying risks in finance.
method Examined Shapley value and Integrated Gradients, and derived axioms from asset pricing domain knowledge.
result Neither Shapley value nor Integrated Gradients can satisfy all axioms for reflecting risks accurately.

Paper proposes embedding models to capture semantic similarities of categorical attributes in financial bonds.

problem Challenges in finding similar bonds due to overshadowing of categorical non-financial attributes.
method Embedding models to capture semantic similarities of categorical attributes.
result Improves risk modeling and curve construction via sparse-issuer augmentation.

The paper optimizes stock portfolios with constraints based on performance attribution.

problem Optimizing stock portfolios with performance attribution constraints.
method Minimizes expected tail loss, constrains asset allocation and selection effect, tests on Dow Jones stocks.
result Imposing constraints on asset allocation and selection effect improves portfolio performance.

New fairness criterion for risk-sensitive decisions in regulated industries.

problem Ensuring equitable outcomes in risk-sensitive decision-making.
method Marginal fairness for generalized distortion risk measures, two-step decision-making process.
result Ensures fairness in decision-making under risk measures, regardless of protected attributes.

Estimates conversion probabilities from click sequences with privacy constraints.

problem Training models in advertising with limited direct click-conversion links.
method Formalizes learning from attribution sets, constructs unbiased estimator, applies Empirical Risk Minimization.
result Empirical Risk Minimization achieves generalization guarantees and robustness against prior errors.

LLMs can help explain credit risk models but not autonomously.

problem Leveraging LLMs for post-hoc explainability in credit risk models.
method Comparison of LLM outputs with SHAP and coefficient-based attributions on three LMs.
result LLMs reliably preserve feature-importance rankings but poorly align with autonomous explanations.

Maximum drawdown, the largest cumulative loss from peak to trough, is one of the most widely used indicators of risk in the fund management industry, but one of the least developed in the context of measures of risk. We formalize drawdown risk as Conditional Expected Drawdown (CED), which is the tail mean of maximum dr…

2014-04-29abs ↗pdf ↗

By building on a recently introduced genetic-inspired attribute-based conceptual framework for safety risk analysis, we propose a novel methodology to compute construction univariate and bivariate construction safety risk at a situational level. Our fully data-driven approach provides construction practitioners and aca…

2016-09-26abs ↗pdf ↗

TRACE analyzes risk changes in models trained on shifted data.

problem Understanding performance changes when a model trained on shifted data is used.
method TRACE framework decomposes risk change into four factors: generalization gaps, model change penalty, and covariate shift penalty.
result TRACE provides a diagnostic tool to understand and quantify risk changes due to covariate shift.

Study shows OAT decomposition generates unexplained profit and loss, while SU decompositions depend on risk factor order.

problem Understanding profit and loss attribution in financial markets.
method Used financial market data from 2003 to 2022 to compare OAT, SU, and ASU decompositions.
result SU decompositions are sensitive to risk factor order and cannot identify all relevant risk factors.

Personalized models using group attributes reduce performance, study finds.

problem Reducing performance of models using group attributes like race or gender.
method Formal conditions and collective preference guarantees to ensure fair use.
result Models personalized with group attributes reduce performance at a group level.

New method explains time series classification by assessing causal effects.

problem Understanding machine learning model decisions in time series classification.
method Model-agnostic causal attribution method using diffusion models.
result Causal attributions differ from associational ones, highlighting risks.

Efficiently learns halfspaces with malicious noise, near-optimal label complexity.

problem Learning ss-sparse halfspaces under malicious label noise.
method Active learning algorithm with instance reweighting and empirical risk minimization.
result Near-optimal label complexity of O(slog4d/ε)O(s \log^4 d / ε) and noise tolerance Ω(ε)Ω(ε).

Much work aims to explain a model's prediction on a static input. We consider explanations in a temporal setting where a stateful dynamical model produces a sequence of risk estimates given an input at each time step. When the estimated risk increases, the goal of the explanation is to attribute the increase to a few r…

2019-07-10abs ↗pdf ↗

A new CVaR test reduces group performance disparity detection complexity.

problem Detecting performance disparities across multiple sensitive groups in ML models.
method Conditional Value-at-Risk (CVaR) testing to reduce sample complexity.
result Sample complexity reduced exponentially to be at most the square root of the number of groups.

The paper tackles attributing forecast gaps in complex model suites.

problem Attributing forecast gaps to individual component models in complex model suites.
method Formalized walk analysis, adapted LMDI and Shapley value approaches.
result Developed efficient formulas for gap attribution in practical portfolio-scale examples.

Study finds cryptoasset markets inefficient due to capital reallocation frictions.

problem Inefficiency in cryptoasset markets due to capital reallocation frictions.
method Examined investments with dominant and secondary risk factors, derived equilibrium restrictions, and tested empirically.
result Empirical results strongly reject necessary equilibrium restrictions, indicating market inefficiency.

Machine learning algorithms are increasingly involved in sensitive decision-making process with adversarial implications on individuals. This paper presents mdfa, an approach that identifies the characteristics of the victims of a classifier's discrimination. We measure discrimination as a violation of multi-differenti…

2019-03-18abs ↗pdf ↗

Study finds stocks with higher cyber risk scores outperform others, indicating a market-wide cyber risk premium.

problem Identifying and quantifying firms' cyber risks and their impact on stock performance.
method Machine learning algorithm to analyze disclosures and a dedicated cyber corpus.
result High cyber risk stocks significantly outperform others, indicating a market-wide cyber risk premium.

Unified framework analyzes privacy risks from gradients in distributed learning.

problem Analyzing inference privacy risks from gradients in machine learning.
method Unified game-based framework for various attacks, including attribute, property, distributional, and user disclosures.
result Demonstrates inefficacy of data aggregation for privacy against inference attacks.

Signed Evidence Flow (SEF) combines fitted prediction with signed feature attributions to measure evidence conflict and stability.

problem Modern data analysis lacks mechanisms to show the clarity, conflict, or stability of evidence behind predictions.
method Signed Evidence Flow (SEF) combines fitted prediction with signed feature attributions.
result SEF measures conflict and stability, and shows that conflict can improve loss prediction beyond confidence.

We consider a priori generalization bounds developed in terms of cross-validation estimates and the stability of learners. In particular, we first derive an exponential Efron-Stein type tail inequality for the concentration of a general function of n independent random variables. Next, under some reasonable notion of s…

2017-06-19abs ↗pdf ↗

Reduces risk of model inversion by reducing sensitive feature influence.

problem Model inversion attacks reveal sensitive individual data from trained models.
method Privacy-guided training to reduce sensitive feature influence in tree-based models.
result Training models to reduce sensitive feature influence reduces the risk of inference attacks.

Medical imaging models may encode demographic attributes without violating fairness, depending on the approach.

problem Discrimination in medical imaging models due to encoding demographic attributes.
method Examined marginal and class-conditional representation invariance, traditional fairness notions, and counterfactual fairness.
result Demographically invariant models may not necessarily be fair, and encoding demographic attributes can be advantageous.

In this paper, we introduce the rich classes of conditional distortion (CoD) risk measures and distortion risk contribution (ΔΔCoD) measures as measures of systemic risk and analyze their properties and representations. The classes include the well-known conditional Value-at-Risk, conditional Expected Shortfall, and r…

2019-01-15abs ↗pdf ↗

Study uses synthetic data to estimate credit risk for underbanked consumers in Istanbul.

problem Estimating credit risk for underbanked consumers lacking formal credit records.
method Created synthetic dataset, used retrieval augmented generation, trained CatBoost, LightGBM, and XGBoost models.
result Alternative financial data improves credit risk estimation, raising AUC by 13%.

Credit Suisse First Boston (CSFB) launched in 1997 the model CreditRisk+ which aims at calculating the loss distribution of a credit portfolio on the basis of a methodology from actuarial mathematics. Knowing the loss distribution, it is possible to determine quantile-based values-at-risk (VaRs) for the portfolio. An o…

2001-12-04abs ↗pdf ↗

Financial institutions have to allocate so-called "economic capital" in order to guarantee solvency to their clients and counter parties. Mathematically speaking, any methodology of allocating capital is a "risk measure", i.e. a function mapping random variables to the real numbers. Nowadays "value-at-risk", which is d…

2002-03-27abs ↗pdf ↗

We decompose the squared price-of-risk premium into three components: intervention-stable premium, confounding wedge, and information loss.

problem Decomposing the squared price-of-risk premium into its components
method Identifying an order-three obstruction to aggregation across portfolios
result The decomposition is estimable and detectable with a permutation-calibrated screen

In this paper we analyze a budgeted learning setting, in which the learner can only choose and observe a small subset of the attributes of each training example. We develop efficient algorithms for ridge and lasso linear regression, which utilize the geometry of the data by a novel data-dependent sampling scheme. When …

2014-10-23abs ↗pdf ↗

Model predicts default risk based on company's financial forecasts and credit conditions.

problem Estimating the risk of a company defaulting on its financial obligations.
method Developed an equilibrium model linking interest rates to corporate performance and credit supply.
result Estimates idiosyncratic default risk and provides forward-looking probability of default (PD).

Algorithm optimizes a single attribute in multi-armed bandits with constraints.

problem Optimizing a single attribute under multiple constraints in multi-armed bandits.
method Successive Rejects framework, information theoretic lower bound.
result Upper bound on probability of error decays exponentially with budget, nearly optimal in certain cases.

RKHS-SHAP uses Shapley values for kernel methods to provide feature attributions.

problem Feature attribution for kernel methods is often heuristic and not individualised.
method RKHS-SHAP uses Shapley values from coalition game theory to compute feature attributions for kernel machines efficiently.
result RKHS-SHAP can compute both Interventional and Observational Shapley values.