A Sparsity Algorithm with Applications to Corporate Credit Rating

• URL: http://arxiv.org/abs/2107.10306v1
• Date: Wed, 21 Jul 2021 18:47:35 GMT
• Title: A Sparsity Algorithm with Applications to Corporate Credit Rating
• Authors: Dan Wang, Zhi Chen, Ionut Florescu
• Abstract summary: We propose a new "sparsity algorithm" which solves the optimization problem, while also maximizing the sparsity of the counterfactual explanation. We apply the sparsity algorithm to provide a simple suggestion to publicly traded companies in order to improve their credit ratings.
• Score: 11.52337781510312
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In Artificial Intelligence, interpreting the results of a Machine Learning technique often termed as a black box is a difficult task. A counterfactual explanation of a particular "black box" attempts to find the smallest change to the input values that modifies the prediction to a particular output, other than the original one. In this work we formulate the problem of finding a counterfactual explanation as an optimization problem. We propose a new "sparsity algorithm" which solves the optimization problem, while also maximizing the sparsity of the counterfactual explanation. We apply the sparsity algorithm to provide a simple suggestion to publicly traded companies in order to improve their credit ratings. We validate the sparsity algorithm with a synthetically generated dataset and we further apply it to quarterly financial statements from companies in financial, healthcare and IT sectors of the US market. We provide evidence that the counterfactual explanation can capture the nature of the real statement features that changed between the current quarter and the following quarter when ratings improved. The empirical results show that the higher the rating of a company the greater the "effort" required to further improve credit rating.

Related papers

• Improving LLM Reasoning through Scaling Inference Computation with Collaborative Verification [52.095460362197336]
  Large language models (LLMs) struggle with consistent and accurate reasoning. LLMs are trained primarily on correct solutions, reducing their ability to detect and learn from errors. We propose a novel collaborative method integrating Chain-of-Thought (CoT) and Program-of-Thought (PoT) solutions for verification.
  arXiv  Detail & Related papers  (2024-10-05T05:21:48Z)
• Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints [117.8317521974783]
  We consider non-clairvoyant scheduling with online precedence constraints. An algorithm is oblivious to any job dependencies and learns about a job only if all of its predecessors have been completed.
  arXiv  Detail & Related papers  (2023-01-30T13:17:15Z)
• Online Search with Predictions: Pareto-optimal Algorithm and its Applications in Energy Markets [32.50099216716867]
  This paper develops learning-augmented algorithms for energy trading in volatile electricity markets. We incorporate machine-learned predictions to design competitive algorithms for online search problems.
  arXiv  Detail & Related papers  (2022-11-12T04:12:10Z)
• Non-Clairvoyant Scheduling with Predictions Revisited [77.86290991564829]
  In non-clairvoyant scheduling, the task is to find an online strategy for scheduling jobs with a priori unknown processing requirements. We revisit this well-studied problem in a recently popular learning-augmented setting that integrates (untrusted) predictions in algorithm design. We show that these predictions have desired properties, admit a natural error measure as well as algorithms with strong performance guarantees.
  arXiv  Detail & Related papers  (2022-02-21T13:18:11Z)
• Selective Credit Assignment [57.41789233550586]
  We describe a unified view on temporal-difference algorithms for selective credit assignment. We present insights into applying weightings to value-based learning and planning algorithms.
  arXiv  Detail & Related papers  (2022-02-20T00:07:57Z)
• Robustification of Online Graph Exploration Methods [59.50307752165016]
  We study a learning-augmented variant of the classical, notoriously hard online graph exploration problem. We propose an algorithm that naturally integrates predictions into the well-known Nearest Neighbor (NN) algorithm.
  arXiv  Detail & Related papers  (2021-12-10T10:02:31Z)
• DisCERN:Discovering Counterfactual Explanations using Relevance Features from Neighbourhoods [1.9706200133168679]
  DisCERN is an effective strategy to minimise actionable changes necessary to create good counterfactual explanations. We show how widely adopted feature relevance-based explainers can inform DisCERN to identify the minimum subset of "actionable features" Our results demonstrate that DisCERN is an effective strategy to minimise actionable changes necessary to create good counterfactual explanations.
  arXiv  Detail & Related papers  (2021-09-13T09:25:25Z)
• Explaining Credit Risk Scoring through Feature Contribution Alignment with Expert Risk Analysts [1.7778609937758323]
  We focus on companies credit scoring and we benchmark different machine learning models. The aim is to build a model to predict whether a company will experience financial problems in a given time horizon. We bring light by providing an expert-aligned feature relevance score highlighting the disagreement between a credit risk expert and a model feature attribution explanation.
  arXiv  Detail & Related papers  (2021-03-15T12:59:15Z)
• Explainable AI for Interpretable Credit Scoring [0.8379286663107844]
  Credit scoring helps financial experts make better decisions regarding whether or not to accept a loan application. Regulations have added the need for model interpretability to ensure that algorithmic decisions are understandable coherent. We present a credit scoring model that is both accurate and interpretable.
  arXiv  Detail & Related papers  (2020-12-03T18:44:03Z)
• Optimal Robustness-Consistency Trade-offs for Learning-Augmented Online Algorithms [85.97516436641533]
  We study the problem of improving the performance of online algorithms by incorporating machine-learned predictions. The goal is to design algorithms that are both consistent and robust. We provide the first set of non-trivial lower bounds for competitive analysis using machine-learned predictions.
  arXiv  Detail & Related papers  (2020-10-22T04:51:01Z)
• Decisions, Counterfactual Explanations and Strategic Behavior [16.980621769406923]
  We find policies and counterfactual explanations that are optimal in terms of utility in a strategic setting. We show that, given a pre-defined policy, the problem of finding the optimal set of counterfactual explanations is NP-hard. We demonstrate that, by incorporating a matroid constraint into the problem formulation, we can increase the diversity of the optimal set of counterfactual explanations.
  arXiv  Detail & Related papers  (2020-02-11T12:04:41Z)

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.