A distributed k-nearest-neighbor classifier that pools local predictions by majority vote attains the same minimax-optimal excess risk and instability rates as the oracle full-data kNN classifier.
Multidimensional binary search trees used for associative searching,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
stat.ML 1years
2019 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Rates of Convergence for Large-scale Nearest Neighbor Classification
A distributed k-nearest-neighbor classifier that pools local predictions by majority vote attains the same minimax-optimal excess risk and instability rates as the oracle full-data kNN classifier.