paper-with-me

Papers

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

2019-06-30 · Ronan Perry, Ronak Mehta, Richard Guo, Eva Yezerets, Jesús Arroyo, Mike Powell, Hayden Helm, Cencheng Shen, Joshua T. Vogelstein

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.

📄 PDF Abstract BibTeX arXiv:1907.00325

Code (1)

neurodata/uncertainty-forest 공식 구현

Similar Papers 제목 키워드 기반

K-nearest Neighbor Search by Random Projection Forests

2018-12-31 · Donghui Yan, Yingjie Wang, Jin Wang, Honggang Wang 외

K-nearest neighbor (kNN) search has wide applications in many areas, including data mining, machine learning, statistics and many applied domains. Inspired by the success of ensemble methods and the flexibility of tree-b…

Nearest Neighbor and Kernel Survival Analysis: Nonasymptotic Error Bounds and Strong Consistency Rates

2019-05-13 · George H. Chen

We establish the first nonasymptotic error bounds for Kaplan-Meier-based nearest neighbor and kernel survival probability estimators where feature vectors reside in metric spaces. Our bounds imply rates of strong consist…

Survival Analysis

When do random forests fail?

2018-12-01 · NeurIPS 2018 12 · Cheng Tang, Damien Garreau, Ulrike Von Luxburg

Random forests are learning algorithms that build large collections of random trees and make predictions by averaging the individual tree predictions. In this paper, we consider various tree constructions and examine how…

Estimation and Inference of Heterogeneous Treatment Effects using Random Forests

2015-10-14 · Stefan Wager, Susan Athey

Many scientific and engineering challenges -- ranging from personalized medicine to customized marketing recommendations -- require an understanding of treatment effect heterogeneity. In this paper, we develop a non-para…

Marketingvalid

Multivariate Gaussian Approximation for Random Forest via Region-based Stabilization

2024-03-15 · Zhaoyang Shi, Chinmoy Bhattacharjee, Krishnakumar Balasubramanian, Wolfgang Polonik

We derive Gaussian approximation bounds for $k$-Potential Nearest Neighbor ($k$-PNN) based random forest predictions based on a set of training points given by a Poisson process under fairly mild regularity assumptions o…