Daniel Zoran, Balaji Lakshminarayanan, Charles Blundell
TL;DR该论文提出了一种称为 differentiable boundary tree 的新方法,它可以学习深度 kNN 表示,以便于构建高效的、易于解释的树。
Abstract
nearest neighbor (kNN) methods have been gaining popularity in recent years
in light of advances in hardware and efficiency of algorithms. There is a
plethora of methods to choose from today, each with their own advantages and
disadvantages. One requirement shared between all kNN based