9 citations · 13 across the 2 of their papers we have counts for
3 papers
cs.LG2019★ 9 cited
Towards Similarity Graphs Constructed by Deep Reinforcement Learning
Dmitry Baranchuk, Artem Babenko
Similarity graphs are an active research direction for the nearest neighbor search (NNS) problem. New algorithms for similarity graph construction are continuously being proposed a…
cs.LG2019★ 4 cited
Learning to Route in Similarity Graphs
Dmitry Baranchuk, Dmitry Persiyanov, Anton Sinitsin +1
Recently similarity graphs became the leading paradigm for efficient nearest neighbor search, outperforming traditional tree-based and LSH-based methods. Similarity graphs perform…
cs.CV2018
Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors
Dmitry Baranchuk, Artem Babenko, Yury Malkov
This work addresses the problem of billion-scale nearest neighbor search. The state-of-the-art retrieval systems for billion-scale databases are currently based on the inverted mul…