Search arXivSearch

arXiv · 2201.03367

Efficient forecasting and uncertainty quantification for large scale account level Monte Carlo models of debt recovery

Abstract

We consider the problem of forecasting debt recovery from large portfolios of non-performing unsecured consumer loans under management. The state of the art in industry is to use stochastic processes to approximately model payment behaviour of individual customers based on several covariates, including credit scores and payment history. Monte Carlo simulation of these stochastic processes can enable forecasting of the possible returns from portfolios of defaulted debt, and the quantification of uncertainty. Despite the fact that the individual-level models are relatively simple, it is challenging to carry out simulations at the portfolio level because of the very large number of accounts. The accounts are also heterogeneous, with a broad range of values for the collection variances. We aim to solve two main problems: efficient allocation of computational resources in the simulations to estimate the likely collections as precisely as possible, and quantification of the uncertainty in the forecasts. We show that under certain conditions, robust estimators of population-level variance can be constructed by summing over coarse unbiased estimators of the variance of individual accounts. The proposed methods are demonstrated through application to a model which shares key features with those that are used in practice.

Explore related subjects

Keep this discovery

BibTeXRIS

Sam Baynes, Simon Cotter, Paul Russell, Edmund Ryan, Timothy Waite. 2022-01-10. Efficient forecasting and uncertainty quantification for large scale account level Monte Carlo models of debt recovery. https://arxiv.org/abs/2201.03367

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience, where a small ensemble of Earth system forecasts must be used to estimate the covariance matrix associated with the forecast uncertainty. It is common practice to regularize the small-sample covariance by imposing a "localization" structure that enforces a physically realistic correlation length scale, imposing a sparsity constraint, "shrinking" towards a prescribed target, or attenuating small correlations. We propose an alternate technique that regularizes the small-sample covariance by imposing hierarchical rank structure. Compared to regularization methods that assume sparsity such as spatial localization, hierarchical rank structure accommodates a wider range of covariance matrices, roughly corresponding to situations where long-range correlations vary more smoothly than short-range ones. It also results in a data-sparse matrix format that permits highly efficient matrix-vector products. We present theory and algorithms which show how to efficiently estimate a high-dimensional, hierarchically rank structured covariance matrix from limited samples. Through an error analysis and numerical experiments with a variety of model problems, we demonstrate that these techniques are effective at reducing sampling errors, and that in many cases they achieve smaller estimation error than conventional techniques.

stat.CO

Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling

Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, thereby providing automatic local adaptivity to the scale of the target. In practice the exact slice is not known, so general-purpose implementations use an approximate slice that is grown from a starting interval of length $w>0$, with a computational cost that depends on $w$. This work presents an analysis of the average per-iteration number of target density evaluations, as a function of $w$, of hybrid slice sampling with various slice-finding schemes for targets with contiguous slices. The paper uses the results of the analysis to develop automated, slice-adaptive tuning schemes along with suboptimality bounds and asymptotic convergence guarantees. Simulations demonstrate that the tuning schemes reliably yield near-optimal slice-adaptive tuning with essentially no dependence on the initial setting of $w$.

stat.CO