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.
1:02:32
Ilya Razenshteyn on 'Optimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors...
0:52:40
Nearest neighbor search for general symmetric norms via embeddings... - Ilya Razenshteyn
0:49:09
Optimal Data-Dependent Hashing for Nearest Neighbor Search
0:59:27
Ilya Razenshteyn. Scalable Nearest Neighbor Search for Optimal Transport
1:09:11
TCS+ talk: Ilya Razenshteyn
1:11:20
MINDS Seminar:Ilya Razenshteyn, May 14, 2020, Scalable Nearest Neighbor Search for Optimal Transport
0:29:23
Beyond Locality Sensitive Hashing; Alexandr Andoni
0:58:06
Ilya Razenshteyn on Random space partitions and optimal transport: beyond metric embeddings
0:48:21
Holder Homeomorphisms and Approximate Nearest Neighbors
0:50:32
Erik Waingarten on Approximate Nearest Neighbors via Non-Linear Spectral Gaps
![[Коллоквиум]: Approximate Nearest](https://i.ytimg.com/vi/Ho3GGIwEnuI/hqdefault.jpg)
0:52:19
[Коллоквиум]: Approximate Nearest Neighbor Search: Beyond Locality-Sensitive Hashing
0:28:20
Beyond Locality-Sensitive Hashing
0:59:31
Lecture 11 | Recent Advances in Algorithms | Ilya Razenshteyn
0:12:00
Scalable Nearest Neighbor Search for Optimal Transport
1:04:53
Lecture 8 | Recent Advances in Algorithms | Ilya Razenshteyn
1:02:15
Lecture 4 | Recent Advances in Algorithms | Ilya Razenshteyn
1:04:51
Nearest Neighbor Methods I
0:02:58
AnnexML: Approximate Nearest Neighbor Search for Extreme Multi-label Classification
0:29:30
Anshumali Shrivastava -- Statistical Estimations from Locality Sensitive Hashing
0:02:02
EmbedJoin: Efficient Edit Similarity Joins via Embeddings
1:01:26
Nearest Neighbor Methods II
0:03:33
FANNG: Fast Approximate Nearest Neighbour Graphs
0:41:44
When Hashes Met Wedges - A Distributed Algorithm for Finding High Similarity Vectors
1:55:15
Разенштейн Илья. О машинном обучении и поиске ближайших соседей (06.05.2020)...
Комментарии