Efficient learning of neighbor representations for boundary trees and forests

10/26/2018
by   Tharindu Adikari, et al.
0

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 reduction in training time. We test and compare the algorithms on the well known MNIST handwritten digits dataset and the newer Fashion-MNIST dataset by Xiao et al.(2017).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/09/2022

Cartesian Tree Subsequence Matching

Park et al. [TCS 2020] observed that the similarity between two (numeric...
research
02/06/2023

Spatial Functa: Scaling Functa to ImageNet Classification and Generation

Neural fields, also known as implicit neural representations, have emerg...
research
10/12/2018

Topological Inference of Manifolds with Boundary

Given a set of data points sampled from some underlying space, there are...
research
04/13/2018

Dynamic Low-Stretch Trees via Dynamic Low-Diameter Decompositions

Spanning trees of low average stretch on the non-tree edges, as introduc...
research
01/07/2023

Abstract Huffman Coding and PIFO Tree Embeddings

Algorithms for deriving Huffman codes and the recently developed algorit...
research
01/30/2023

Breadth-First Depth-Next: Optimal Collaborative Exploration of Trees with Low Diameter

We consider the problem of collaborative tree exploration posed by Fraig...
research
12/13/2014

Oriented Edge Forests for Boundary Detection

We present a simple, efficient model for learning boundary detection bas...

Please sign up or login with your details

Forgot password? Click here to reset