How good is good? Probabilistic benchmarks and nanofinance+
Benchmarks are standards that allow to identify opportunities for improvement among comparable units. This study suggests a 2-step methodology for calculating probabilistic benchmarks in noisy data sets: (i) double-hyperbolic undersampling filters the noise of key performance indicators (KPIs), and (ii) a relevance vector machine estimates probabilistic benchmarks with denoised KPIs. The usefulness of the methods is illustrated with an application to a database of nano-finance+. The results indicate that-in the case of nano-finance groups-a higher discrimination power is obtained with variables that capture the macro-economic environment of the country where a group operates. Also, the estimates show that groups operating in rural regions have different probabilistic benchmarks, compared to groups in urban and peri-urban areas.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Generalizing the Role of Determinization in Probabilistic Planning
The stochastic shortest path problem (SSP) is a highly expressive model for probabilistic planning. The computational hardness of SSPs has sparked interest in determinization-based planners that can quickly solve large p…
Calibration of Deep Probabilistic Models with Decoupled Bayesian Neural Networks
Deep Neural Networks (DNNs) have achieved state-of-the-art accuracy performance in many tasks. However, recent works have pointed out that the outputs provided by these models are not well-calibrated, seriously limiting …
image-classificationImage ClassificationGoodness-of-Fit of Attributed Probabilistic Graph Generative Models
Probabilistic generative models of graphs are important tools that enable representation and sampling. Many recent works have created probabilistic models of graphs that are capable of representing not only entity intera…
DISK: Learning local features with policy gradient
Local feature frameworks are difficult to learn in an end-to-end fashion, due to the discreteness inherent to the selection and matching of sparse keypoints. We introduce DISK (DIScrete Keypoints), a novel method that ov…
Image Matchingreinforcement-learningReinforcement Learning (RL)On the Robustness of Kernel Goodness-of-Fit Tests
Goodness-of-fit testing is often criticized for its lack of practical relevance: since ``all models are wrong'', the null hypothesis that the data conform to our model is ultimately always rejected as sample size grows. …
parameter estimation