Attribution Methods in Asset Pricing: Do They Account for Risk?

• URL: http://arxiv.org/abs/2407.08953v1
• Date: Fri, 12 Jul 2024 03:16:54 GMT
• Title: Attribution Methods in Asset Pricing: Do They Account for Risk?
• Authors: Dangxing Chen, Yuan Gao,
• Abstract summary: We present and study several axioms derived from asset pricing domain knowledge. It is shown that while Shapley value and Integrated Gradients preserve most axioms, neither can satisfy all axioms. Using extensive analytical and empirical examples, we demonstrate how attribution methods can reflect risks and when they should not be used.
• Score: 5.9007954155974645
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Over the past few decades, machine learning models have been extremely successful. As a result of axiomatic attribution methods, feature contributions have been explained more clearly and rigorously. There are, however, few studies that have examined domain knowledge in conjunction with the axioms. In this study, we examine asset pricing in finance, a field closely related to risk management. Consequently, when applying machine learning models, we must ensure that the attribution methods reflect the underlying risks accurately. In this work, we present and study several axioms derived from asset pricing domain knowledge. It is shown that while Shapley value and Integrated Gradients preserve most axioms, neither can satisfy all axioms. Using extensive analytical and empirical examples, we demonstrate how attribution methods can reflect risks and when they should not be used.

Related papers

• Explaining Risks: Axiomatic Risk Attributions for Financial Models [0.0]
  In recent years, machine learning models have achieved great success at the expense of highly complex black-box structures.<n>In high-risk sectors such as finance, risk is just as important as mean predictions.
  arXiv  Detail & Related papers  (2025-06-07T04:15:27Z)
• Mapping AI Benchmark Data to Quantitative Risk Estimates Through Expert Elicitation [0.7889270818022226]
  We show how existing AI benchmarks can be used to facilitate the creation of risk estimates. We describe the results of a pilot study in which experts use information from Cybench, an AI benchmark, to generate probability estimates.
  arXiv  Detail & Related papers  (2025-03-06T10:39:47Z)
• On the Societal Impact of Open Foundation Models [93.67389739906561]
  We focus on open foundation models, defined here as those with broadly available model weights. We identify five distinctive properties of open foundation models that lead to both their benefits and risks.
  arXiv  Detail & Related papers  (2024-02-27T16:49:53Z)
• Inverse Reinforcement Learning with Unknown Reward Model based on Structural Risk Minimization [9.44879308639364]
  Inverse reinforcement learning (IRL) usually assumes the model of the reward function is pre-specified and estimates the parameter only. A simplistic model is less likely to contain the real reward function, while a model with high complexity leads to substantial cost and risks overfitting. This paper addresses this trade-off by introducing the structural risk minimization (SRM) method from statistical learning.
  arXiv  Detail & Related papers  (2023-12-27T13:23:17Z)
• On the Theory of Risk-Aware Agents: Bridging Actor-Critic and Economics [0.7655800373514546]
  Risk-aware Reinforcement Learning algorithms were shown to outperform risk-neutral counterparts in a variety of continuous-action tasks. The theoretical basis for the pessimistic objectives these algorithms employ remains unestablished. We propose Dual Actor-Critic (DAC) as a risk-aware, model-free algorithm that features two distinct actor networks.
  arXiv  Detail & Related papers  (2023-10-30T13:28:06Z)
• TASRA: a Taxonomy and Analysis of Societal-Scale Risks from AI [11.240642213359267]
  Many exhaustive taxonomy are possible, and some are useful -- particularly if they reveal new risks or practical approaches to safety. This paper explores a taxonomy based on accountability: whose actions lead to the risk, are the actors unified, and are they deliberate? We also provide stories to illustrate how the various risk types could each play out, including risks arising from unanticipated interactions of many AI systems, and risks from deliberate misuse.
  arXiv  Detail & Related papers  (2023-06-12T07:55:18Z)
• UQ for Credit Risk Management: A deep evidence regression approach [3.42658286826597]
  We have explored the application of a scalable UQ-aware deep learning technique, Deep Evidence Regression and applied it to predicting Loss Given Default. We contribute to the literature by extending the Deep Evidence Regression methodology to learning target variables generated by a Weibull process. We demonstrate the application of our approach to both simulated and real-world data.
  arXiv  Detail & Related papers  (2023-05-08T18:03:01Z)
• Can Direct Latent Model Learning Solve Linear Quadratic Gaussian Control? [75.14973944905216]
  We study the task of learning state representations from potentially high-dimensional observations. We pursue a direct latent model learning approach, where a dynamic model in some latent state space is learned by predicting quantities directly related to planning.
  arXiv  Detail & Related papers  (2022-12-30T01:42:04Z)
• Causal Imitation Learning with Unobserved Confounders [82.22545916247269]
  We study imitation learning when sensory inputs of the learner and the expert differ. We show that imitation could still be feasible by exploiting quantitative knowledge of the expert trajectories.
  arXiv  Detail & Related papers  (2022-08-12T13:29:53Z)
• Guarantees for Epsilon-Greedy Reinforcement Learning with Function Approximation [69.1524391595912]
  Myopic exploration policies such as epsilon-greedy, softmax, or Gaussian noise fail to explore efficiently in some reinforcement learning tasks. This paper presents a theoretical analysis of such policies and provides the first regret and sample-complexity bounds for reinforcement learning with myopic exploration.
  arXiv  Detail & Related papers  (2022-06-19T14:44:40Z)
• Principled Knowledge Extrapolation with GANs [92.62635018136476]
  We study counterfactual synthesis from a new perspective of knowledge extrapolation. We show that an adversarial game with a closed-form discriminator can be used to address the knowledge extrapolation problem. Our method enjoys both elegant theoretical guarantees and superior performance in many scenarios.
  arXiv  Detail & Related papers  (2022-05-21T08:39:42Z)
• Financial Data Analysis Using Expert Bayesian Framework For Bankruptcy Prediction [0.0]
  We propose another route of generative modeling using Expert Bayesian framework. The biggest advantage of the proposed framework is an explicit inclusion of expert judgment in the modeling process. The proposed approach is well suited for highly regulated or safety critical applications such as in finance or in medical diagnosis.
  arXiv  Detail & Related papers  (2020-10-19T19:09:02Z)
• Latent Bandits Revisited [55.88616813182679]
  A latent bandit problem is one in which the learning agent knows the arm reward distributions conditioned on an unknown discrete latent state. We propose general algorithms for this setting, based on both upper confidence bounds (UCBs) and Thompson sampling. We provide a unified theoretical analysis of our algorithms, which have lower regret than classic bandit policies when the number of latent states is smaller than actions.
  arXiv  Detail & Related papers  (2020-06-15T19:24:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.