Credit acceptance process strategy case studies - the power of Credit Scoring

Karol Przanowski

Home/Archive/arXiv

arXiv · 1403.6531

Credit acceptance process strategy case studies - the power of Credit Scoring

Karol Przanowski

View original source ↗Read source document ↗Export metadata ↓

Abstract

The paper is aware of the importance of certain figures that are essential to an understanding of Credit Scoring models in credit acceptance process optimization, namely if the power of discrimination measured by Gini value is increased by 5% then the profit of the process can be increased monthly by about 1 500 kPLN (300 kGBP, 500 kUSD, 350 kEUR). Simple business models of credit loans are also presented: acquisition - installment loan (low price) and cross-sell - cash loans (high price). Scoring models are used to optimize process, to become profitable. Various acceptance strategies with different cutoffs are presented, some are profitable and some are not. Moreover, in a time of prosperity some are preferable whilst the inverse is true during a period of high risk or crisis. To optimize the process four models are employed: three risk models, to predict the probability of default and one typical propensity model to predict the probability of response. It is a simple but very important example of the Customer Lifetime Value (CLTV or CLV) model business, where risk and response models are working together to become a profitable process.

Explore related subjects

q-fin.PM q-fin.RM

Keep this discovery

BibTeX RIS

Karol Przanowski. 2014-03-25. Credit acceptance process strategy case studies - the power of Credit Scoring. https://arxiv.org/abs/1403.6531

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

KEEP EXPLORING

Related papers

arXiv2026

Entropic Value-at-Risk parity for tempered stable returns

We develop Entropic Value-at-Risk (EVaR) parity for tempered stable returns. EVaR-based inverse risk parity (IRP) and equal risk contribution (ERC) portfolios are constructed using multivariate normal tempered stable models and independent component analysis with tempered stable components. We derive the corresponding asset-level EVaR and EVaR-deviation contributions and use the latter to separate the fitted location term from EVaR risk contributions. Under Gaussian returns, EVaR-deviation IRP and ERC recover conventional volatility IRP and ERC weights. We evaluate the resulting portfolios in three investment universes. Empirically, EVaR-based ERC portfolios achieve positive Sharpe differences relative to equal weight across the universes.

q-fin.PM↗

arXiv2026

Simple Dynamic Stock/Bond/Gold Portfolios

For more than four decades, the 60/40 stock/bond portfolio has served as a benchmark for delivering reasonable returns without excessive risk. More recently, a 50/30/20 stock/bond/alternative portfolio has been suggested. We use gold as the alternative and as an inflation hedge. In this paper we ask: how much improvement over these benchmark fixed-weight portfolios can be obtained using widely available public data and standard methods from quantitative finance? We restrict ourselves to long-only dynamic portfolios of stocks, bonds, and gold, plus cash, rebalancing monthly, using only publicly available data. We evaluate portfolios on the conventional metrics: return, volatility, Sharpe ratio (computed in excess of the federal funds rate), drawdown, and turnover, in addition to consistency of performance over time, judged by the consistency of the realized annual volatility. Over the 20--year period 2006--2026, using a conservative estimate of trading costs, we show that all risk-adjusted and drawdown metrics are improved using simple volatility control, where we dynamically mix the fixed-weight portfolios with cash so as to target a fixed volatility. This method relies on a simple estimate of portfolio volatility derived from past returns. We also demonstrate that more sophisticated portfolios based on convex optimization---similar to those used in quantitative hedge funds---yield further substantial improvement in return and risk-adjusted return. We consider two such portfolios, one that uses a simple estimate of future returns based on past returns, and one that forecasts future returns based on past returns and just a handful of widely available public economic data. These portfolios also outperform a suite of standard risk-based allocation methods, such as risk parity and minimum variance, evaluated on the same assets and data.

q-fin.PM↗

arXiv2026

An Entropic Factor Model for Robust Portfolio Replication

Portfolio replication, or the construction of a tradable basket of assets to match the risk-return profile of a target benchmark, is fundamentally an ill-posed inverse problem. When restricted to a subset of available assets, classical variance-minimizing models often yield unstable, over-leveraged portfolios highly vulnerable to market shocks. We propose a unified, two-stage methodology rooted in information theory to achieve robust portfolio replication. First, we model the constituent asset returns against target factors, estimating parameters within data-driven empirical bounds via an entropy minimization principle. Second, using the same entropic approach, we determine the optimal weight replication. In both cases we use an entropy function of the Fermi-Dirac type defined directly on sets of constraints of the inverse problem. We validate this Entropic Factor Model (EFM) against standard Ordinary Least Squares (OLS) across five numerical experiments, including standard equity tracking, multi-asset synthesis, and severe stress-test scenarios. Empirical results demonstrate that the EFM consistently outperforms OLS in terms of annualized turnover and net-of-fees returns. Crucially, during the COVID-19 market crash and under severe idiosyncratic data corruption, the entropic framework acts as a probabilistic ``circuit breaker", defensively reducing capital allocation to compromised assets and providing a highly robust, risk-averse solution for generalized portfolio replication.

q-fin.PM↗