Author

Sanjeev Khanna

h-index 1 View on Semantic Scholar

We have 1 of 5 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Jul 2026

Learning Partition Trees for Nearest Neighbor Search

It is proved that without distributional assumptions, finding the optimal balanced halfspace is NP-hard, and an efficient improper learning algorithm is designed that outputs a balanced polynomial threshold function of degree 1 that cuts at most an $O(\sqrt{\alpha+\varepsilon})$ fraction.

Sanjeev Khanna, Ashwin Padaki, Erik Waingarten · arXiv.org · 0 citations