EconBase
← All papers

InClass Nets: Independent Classifier Networks for Nonparametric Estimation of Conditional Independence Mixture Models and Unsupervised Classification

Konstantin T. Matchev, Prasanth Shyamsundar

arXiv 31 Aug 2020 · Statistics — Machine Learning · publishedMachine Learning Science and Technology (2022)

arXiv:2009.00131 · PDF · DOI · OpenAlex · Extracted main text

Abstract

We introduce a new machine-learning-based approach, which we call the Independent Classifier networks (InClass nets) technique, for the nonparameteric estimation of conditional independence mixture models (CIMMs). We approach the estimation of a CIMM as a multi-class classification problem, since dividing the dataset into different categories naturally leads to the estimation of the mixture model. InClass nets consist of multiple independent classifier neural networks (NNs), each of which handles one of the variates of the CIMM. Fitting the CIMM to the data is performed by simultaneously training the individual NNs using suitable cost functions. The ability of NNs to approximate arbitrary functions makes our technique nonparametric. Further leveraging the power of NNs, we allow the conditionally independent variates of the model to be individually high-dimensional, which is the main advantage of our technique over existing non-machine-learning-based approaches. We derive some new results on the nonparametric identifiability of bivariate CIMMs, in the form of a necessary and a (different) sufficient condition for a bivariate CIMM to be identifiable. We provide a public implementation of InClass nets as a Python package called RainDancesVI and validate our InClass nets technique with several worked out examples. Our method also has applications in unsupervised and semi-supervised classification problems.

Citation extraction

72
references
103
in-text mentions
72
distinct cited
1
self-citations
17,057
main-text words

appendix boundary found by appendix_command · 81% of the source is main text. Read the extracted text to check this.

Most heavily cited references

The works this paper leans on most, across its whole bibliography — not restricted to papers in our corpus. Ranked by composite intensity, which combines how often a work is mentioned, how many sections mention it, and how much of that falls in the main text rather than the appendix.

ReferenceIntensityMentionsSectionsMain text
1P. Hall, X.-H. Zhou, https://doi.org/10.1214/aos/1046294462Nonparame… (2003) https://doi.org/10.1214/aos/1046294462 doi:10.1214/aos/10462944620.9098375%
2X. Ji, J. F. Henriques, A. Vedaldi, Invariant information clustering… (2019) pp0.87452100%
3E. S. Allman, C. Matias, J. A. Rhodes, https://projecteuclid.org/euc… (2009) https://doi.org/10.1214/09-AOS689 doi:10.1214/09-AOS6890.81142100%
4P. Hall, A. Neeman, R. Pakyari, R. Elmore, https://doi.org/10.1093/b… (2005) https://doi.org/10.1093/biomet/asm042 doi:10.1093/biomet/asm0420.81142100%
5R. Elmore, P. Hall, A. Neeman, http://www.numdam.org/item/AIF_2005__… (2005) https://doi.org/10.5802/aif.2087 doi:10.5802/aif.20870.64422100%
6H. Kasahara, K. Shimotsu, https://doi.org/10.1111/rssb.12022Nonparam… (2014) https://doi.org/10.1111/rssb.12022 doi:10.1111/rssb.120220.64422100%
7B. Tahmasebi, A. Motahari, M. Maddah-Ali, On the Identifiability of… (2018) http://arxiv.org/abs/1807.05444 arXiv:1807.054440.64422100%
8S. Xiang, W. Yao, G. Yang, https://projecteuclid.org/euclid.ss/15707… (2019) https://doi.org/10.1214/19-STS698 doi:10.1214/19-STS6980.64422100%
9The package is available at0.64422100%
10D. Chauveau, D. R. Hunter, M. Levine, https://doi.org/10.1214/15-SS1… (2015) https://doi.org/10.1214/15-SS108 doi:10.1214/15-SS1080.58531100%

Showing the top 10 of 72 scored citations.