The TruEnd-procedure: Treating trailing zero-valued balances in credit data
A novel procedure is presented for finding the true but latent endpoints within the repayment histories of individual loans. The monthly observations beyond these true endpoints are false, largely due to operational failures that delay account closure, thereby corrupting some loans. Detecting these false observations is difficult at scale since each affected loan history might have a different sequence of trailing zero (or very small) month-end balances. Identifying these trailing balances requires an exact definition of a "small balance", which our method informs. We demonstrate this procedure and isolate the ideal small-balance definition using South African residential mortgages. Evidently, corrupted loans are remarkably prevalent and have excess histories that are surprisingly long, which ruin the timing of risk events and compromise any subsequent time-to-event model, e.g., survival analysis. Having discarded these excess histories, we demonstrably improve the accuracy of both the predicted timing and severity of risk events, without materially impacting the portfolio. The resulting estimates of credit losses are lower and less biased, which augurs well for raising accurate credit impairments under IFRS 9. Our work therefore addresses a pernicious data error, which highlights the pivotal role of data preparation in producing credible forecasts of credit risk.
Code (0)
등록된 구현이 없습니다.
Tasks
Survival AnalysisSimilar Papers 제목 키워드 기반
SurReal: Complex-Valued Learning as Principled Transformations on a Scaling and Rotation Manifold
Complex-valued data is ubiquitous in signal and image processing applications, and complex-valued representations in deep learning have appealing theoretical properties. While these aspects have long been recognized, com…
Deep LearningOptimal Trading with a Trailing Stop
Trailing stop is a popular stop-loss trading strategy by which the investor will sell the asset once its price experiences a pre-specified percentage drawdown. In this paper, we study the problem of timing buy and then s…
Imagined-Trailing-Whitespace-Agnostic Levenshtein Distance For Plaintext Table Detection
The standard algorithm for Levenshtein distance, treats trailing whitespace the same as any other letter or symbol. However, when humans compare 2 strings, we implicitly assume that both strings are padded by infinite tr…
Table DetectionRuntime Analysis of Evolutionary Diversity Optimization on the Multi-objective (LeadingOnes, TrailingZeros) Problem
The diversity optimization is the class of optimization problems, in which we aim at finding a diverse set of good solutions. One of the frequently used approaches to solve such problems is to use evolutionary algorithms…
DiversityEvolutionary AlgorithmsComplex Fully Convolutional Neural Networks for MR Image Reconstruction
Undersampling the k-space data is widely adopted for acceleration of Magnetic Resonance Imaging (MRI). Current deep learning based approaches for supervised learning of MRI image reconstruction employ real-valued operati…
Image Reconstruction