filmov
tv
Ilya Razenshteyn on 'Optimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors'
Показать описание
I will show a new data structure for the Approximate Nearest Neighbor problem for Euclidean and Hamming distances, which has the following benefits:
* It achieves a smooth time-space trade-off, with two extremes being *near-linear* space and *sub-polynomial* query time.
* It unifies, simplifies, and improves upon all previous data structures for the problem.
* It is optimal in an appropriate restricted model.
* It achieves a smooth time-space trade-off, with two extremes being *near-linear* space and *sub-polynomial* query time.
* It unifies, simplifies, and improves upon all previous data structures for the problem.
* It is optimal in an appropriate restricted model.
Ilya Razenshteyn on 'Optimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors...
Nearest neighbor search for general symmetric norms via embeddings... - Ilya Razenshteyn
Optimal Data-Dependent Hashing for Nearest Neighbor Search
Ilya Razenshteyn. Scalable Nearest Neighbor Search for Optimal Transport
TCS+ talk: Ilya Razenshteyn
MINDS Seminar:Ilya Razenshteyn, May 14, 2020, Scalable Nearest Neighbor Search for Optimal Transport
Beyond Locality Sensitive Hashing; Alexandr Andoni
Ilya Razenshteyn on Random space partitions and optimal transport: beyond metric embeddings
Holder Homeomorphisms and Approximate Nearest Neighbors
Erik Waingarten on Approximate Nearest Neighbors via Non-Linear Spectral Gaps
[Коллоквиум]: Approximate Nearest Neighbor Search: Beyond Locality-Sensitive Hashing
Beyond Locality-Sensitive Hashing
Lecture 11 | Recent Advances in Algorithms | Ilya Razenshteyn
Scalable Nearest Neighbor Search for Optimal Transport
Lecture 8 | Recent Advances in Algorithms | Ilya Razenshteyn
Lecture 4 | Recent Advances in Algorithms | Ilya Razenshteyn
Nearest Neighbor Methods I
AnnexML: Approximate Nearest Neighbor Search for Extreme Multi-label Classification
Anshumali Shrivastava -- Statistical Estimations from Locality Sensitive Hashing
EmbedJoin: Efficient Edit Similarity Joins via Embeddings
Nearest Neighbor Methods II
FANNG: Fast Approximate Nearest Neighbour Graphs
When Hashes Met Wedges - A Distributed Algorithm for Finding High Similarity Vectors
Разенштейн Илья. О машинном обучении и поиске ближайших соседей (06.05.2020)...
Комментарии