English

Fisher consistency for prior probability shift

Machine Learning 2019-07-23 v2 Machine Learning Computation

Abstract

We introduce Fisher consistency in the sense of unbiasedness as a desirable property for estimators of class prior probabilities. Lack of Fisher consistency could be used as a criterion to dismiss estimators that are unlikely to deliver precise estimates in test datasets under prior probability and more general dataset shift. The usefulness of this unbiasedness concept is demonstrated with three examples of classifiers used for quantification: Adjusted Classify & Count, EM-algorithm and CDE-Iterate. We find that Adjusted Classify & Count and EM-algorithm are Fisher consistent. A counter-example shows that CDE-Iterate is not Fisher consistent and, therefore, cannot be trusted to deliver reliable estimates of class probabilities.

Keywords

Cite

@article{arxiv.1701.05512,
  title  = {Fisher consistency for prior probability shift},
  author = {Dirk Tasche},
  journal= {arXiv preprint arXiv:1701.05512},
  year   = {2019}
}

Comments

28 pages, 2 figures, 8 tables, introduction extended

R2 v1 2026-06-22T17:54:24.892Z