Random Forests for Adaptive Nearest Neighbor Estimation of Information-Theoretic Quantities

Abstract

Information-theoretic quantities, such as conditional entropy and mutual information, are critical data summaries for quantifying uncertainty. Current widely used approaches for computing such quantities rely on nearest neighbor methods and exhibit both strong performance and theoretical guarantees in certain simple scenarios. However, existing approaches fail in high-dimensional settings and when different features are measured on different scales.We propose decision forest-based adaptive nearest neighbor estimators and show that they are able to effectively estimate posterior probabilities, conditional entropies, and mutual information even in the aforementioned settings.We provide an extensive study of efficacy for classification and posterior probability estimation, and prove certain forest-based approaches to be consistent estimators of the true posteriors and derived information-theoretic quantities under certain assumptions. In a real-world connectome application, we quantify the uncertainty about neuron type given various cellular features in the Drosophila larva mushroom body, a key challenge for modern neuroscience.

References in corpus (11)

• Scikit-learn: Machine Learning in Python
• Estimating Mutual Information
• On Calibration of Modern Neural Networks
• OpenML: networked science in machine learning
• Narrowing the Gap: Random Forests In Theory and In Practice
• Entropy and mutual information in models of deep neural networks
• Estimating Mutual Information for Discrete-Continuous Mixtures
• Discovering and Deciphering Relationships Across Disparate Data Modalities
• Semiparametric spectral modeling of the Drosophila connectome
• OpenML-Python: an extensible Python API for OpenML
• Sparse Projection Oblique Randomer Forests