49 min
Seminar, Hosted by Simons Institute for the Theory of Computing
Optimal Data-Dependent Hashing for Nearest Neighbor Search
Recording
Abstract
This talk develops optimal hashing methods for approximate nearest-neighbor search by reducing worst-case high-dimensional point sets to random instances. The approach connects the structure of arbitrary datasets with hashing constructions designed for random data. The work is joint with Ilya Razenshteyn.