pith. sign in

HELOC Applicant Risk Performance Evaluation by Topological Hierarchical Decomposition

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it
abstract

Strong regulations in the financial industry mean that any decisions based on machine learning need to be explained. This precludes the use of powerful supervised techniques such as neural networks. In this study we propose a new unsupervised and semi-supervised technique known as the topological hierarchical decomposition (THD). This process breaks a dataset down into ever smaller groups, where groups are associated with a simplicial complex that approximate the underlying topology of a dataset. We apply THD to the FICO machine learning challenge dataset, consisting of anonymized home equity loan applications using the MAPPER algorithm to build simplicial complexes. We identify different groups of individuals unable to pay back loans, and illustrate how the distribution of feature values in a simplicial complex can be used to explain the decision to grant or deny a loan by extracting illustrative explanations from two THDs on the dataset.

fields

cs.LG 2

years

2026 1 2024 1

verdicts

UNVERDICTED 2

clear filters

representative citing papers

Linear Strategic Classification with Endogenous Improvements

cs.LG · 2026-05-31 · unverdicted · novelty 7.0

Formalizes improvement-aware strategic classification for linear classifiers under single-index models, proves the strategic-optimal classifier is a parallel shift of the Bayes boundary, and supplies PAC guarantees with a plug-in algorithm evaluated on datasets.

citing papers explorer

Showing 2 of 2 citing papers after filters.

  • Linear Strategic Classification with Endogenous Improvements cs.LG · 2026-05-31 · unverdicted · none · ref 9 · internal anchor

    Formalizes improvement-aware strategic classification for linear classifiers under single-index models, proves the strategic-optimal classifier is a parallel shift of the Bayes boundary, and supplies PAC guarantees with a plug-in algorithm evaluated on datasets.

  • GLANCE: Global Actions in a Nutshell for Counterfactual Explainability cs.LG · 2024-05-29 · unverdicted · none · ref 4 · internal anchor

    GLANCE is a new agglomerative algorithm that jointly clusters in feature and counterfactual-action spaces to produce few, low-cost, high-coverage global recourse actions.