Efficient Learning Of Neighbor Representations For Boundary Trees And Forests

Abstract

We introduce a semiparametric approach to neighbor-based classification. We build off the recently proposed Boundary Trees algorithm by Mathy et al.(2015) which enables fast neighbor-based classification, regression and retrieval in large datasets. While boundary trees use an Euclidean measure of similarity, the Differentiable Boundary Tree algorithm by Zoran et al.(2017) was introduced to learn low-dimensional representations of complex input data, on which semantic similarity can be calculated to train boundary trees. As is pointed out by its authors, the differentiable boundary tree approach contains a few limitations that prevents it from scaling to large datasets. In this paper, we introduce Differentiable Boundary Sets, an algorithm that overcomes the computational issues of the differentiable boundary tree scheme and also improves its classification accuracy and data representability. Our algorithm is efficiently implementable with existing tools and offers a significant reducti

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyadikari2018efficient

Related papers

• Learning Deep Nearest Neighbor Representations Using Differentiable Boundary Trees (2017)0.00
• On High-dimensional Modifications Of The Nearest Neighbor Classifier (2024)0.00
• Representation Learning By Reconstructing Neighborhoods (2018)0.00
• Explaining The Success Of Nearest Neighbor Methods In Prediction (2025)18.63
• A Multilabel Classification Framework For Approximate Nearest Neighbor Search (2019)0.00
• Self-balancing, Memory Efficient, Dynamic Metric Space Data Maintenance, For Rapid Multi-kernel Estimation (2025)0.00
• Distance Based Image Classification: A Solution To Generative Classification's Conundrum? (2022)5.24
• Softstep: Learning Sparse Similarity Powers Deep Neighbor-based Regression (2025)0.00