Fetching the paper…
Reading the bibliography…
We propose a novel dimensionality reduction method for maximum inner product search (MIPS), named CEOs, based on the theory of concomitants of extreme order statistics.
The asymptotic theory of concomitants of order statistics
H. A. David and J. Galambos · 1974
Earlier work this paper cites.
On the rate of convergence of normal extremes
P. Hall · 1979
Earlier work this paper cites.
Extensions of Lipschitz mappings into a Hilbert space
W. B. Johnson and J. Lindenstrauss · 1984
Earlier work this paper cites.
Concomitants of Extreme Order Statistics
H. A. David · 1994
Earlier work this paper cites.
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
M. X. Goemans and D. P. Williamson · 1995
Earlier work this paper cites.
Approximating matrix multiplication for pattern recognition tasks
E. Cohen and D. D. Lewis · 1999
Earlier work this paper cites.
Efficient search for approximate nearest neighbor in high dimensional spaces
E. Kushilevitz, R. Ostrovsky, and Y. Rabani · 2000
Earlier work this paper cites.
Which problems have strongly exponential complexity?
R. Impagliazzo, R. Paturi, and F. Zane · 2001
Earlier work this paper cites.
Introduction to Probability
D. P. Bertsekas and J. N. Tsitsiklis · 2002
Earlier work this paper cites.
Similarity estimation techniques from rounding algorithms
M. Charikar · 2002
Earlier work this paper cites.
Efficient k-nn search on vertically decomposed data
A. P. de Vries, N. Mamoulis, N. Nes, and M. L. Kersten · 2002
Earlier work this paper cites.
An elementary proof of a theorem of johnson and lindenstrauss
S. Dasgupta and A. Gupta · 2003
Earlier work this paper cites.
Optimal aggregation algorithms for middleware
R. Fagin, A. Lotem, and M. Naor · 2003
Earlier work this paper cites.
Amazon.com recommendations: Item-to-item collaborative filtering
G. Linden, B. Smith, and J. York · 2003
Earlier work this paper cites.
The Random Projection Method
S. S. Vempala · 2004
Earlier work this paper cites.
On the optimality of the dimensionality reduction method
A. Andoni, P. Indyk, and M. Pǎtraşcu · 2006
Earlier work this paper cites.
Very sparse random projections
P. Li, T. Hastie, and K. W. Church · 2006
Earlier work this paper cites.
The Netflix prize, 2007
J. Bennett and S. Lanning · 2007
Earlier work this paper cites.
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
A. Andoni and P. Indyk · 2008
Earlier work this paper cites.
Asymptotic Theory of Statistics and Probability
A. DasGupta · 2008
Cited alongside, same era.
Matrix factorization techniques for recommender systems
Y. Koren, R. M. Bell, and C. Volinsky · 2009
Cited alongside, same era.
Yahoo! music recommendations: modeling music ratings with temporal dynamics and item taxonomy
N. Koenigstein, G. Dror, and Y. Koren · 2011
Cited alongside, same era.
Approximate nearest neighbor: Towards removing the curse of dimensionality
S. Har-Peled, P. Indyk, and R. Motwani · 2012
Cited alongside, same era.
Fast, accurate detection of 100, 000 object classes on a single machine
T. L. Dean, M. A. Ruzon, M. Segal, J. Shlens, S. Vijayanarasimhan, and J. Yagnik · 2013
Cited alongside, same era.
Streaming similarity search over one billion tweets using parallel locality-sensitive hashing
N. Sundaram, A. Turmukhametova, N. Satish, T. Mostak, P. Indyk, S. Madden, and P. Dubey · 2013
Structured adaptive and random spinners for fast machine learning computations
M. Bojarski, A. Choromanska, K. Choromanski, F. Fagan, C. Gouy-Pailler, A. Morvan, N. Sakr, T. Sarlós, and J. Atif · 2017
Later among the works it cites.
The unreasonable effectiveness of structured random orthogonal embeddings
K. M. Choromanski, M. Rowland, and A. Weller · 2017
Later among the works it cites.
Billion-scale similarity search with gpus
J. Johnson, M. Douze, and H. Jégou · 2017
Later among the works it cites.
Optimality of the johnson-lindenstrauss lemma
K. G. Larsen and J. Nelson · 2017
Later among the works it cites.
FEXIPRO: fast and exact inner product retrieval in recommender systems
H. Li, T. N. Chan, M. L. Yiu, and N. Mamoulis · 2017
Later among the works it cites.
Scalable and sustainable deep learning via randomized hashing
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Speeding up the Xbox recommender system using a euclidean transformation for inner-product spaces
Y. Bachrach, Y. Finkelstein, R. Gilad-Bachrach, L. Katzir, N. Koenigstein, N. Nice, and U. Paquet · 2014
Cited alongside, same era.
GloVe: global vectors for word representation
J. Pennington, R. Socher, and C. D. Manning · 2014
Cited alongside, same era.
Asymmetric LSH (ALSH) for sublinear time maximum inner product search (MIPS)
A. Shrivastava and P. Li · 2014
Cited alongside, same era.
Finding orthogonal vectors in discrete structures
R. Williams and H. Yu · 2014
Cited alongside, same era.
Context-aware recommender systems
G. Adomavicius and A. Tuzhilin · 2015
Cited alongside, same era.
Practical and optimal LSH for angular distance
A. Andoni, P. Indyk, T. Laarhoven, I. P. Razenshteyn, and L. Schmidt · 2015
Cited alongside, same era.
R. Spring and A. Shrivastava · 2017
Later among the works it cites.
Exact and approximate maximum inner product search with LEMP
C. Teflioudi and R. Gemulla · 2017
Later among the works it cites.
A greedy approach for budgeted maximum inner product search
H. Yu, C. Hsieh, Q. Lei, and I. S. Dhillon · 2017
Later among the works it cites.
Accurate and fast asymmetric locality-sensitive hashing scheme for maximum inner product search
Q. Huang, G. Ma, J. Feng, Q. Fang, and A. K. H. Tung · 2018
Later among the works it cites.
Non-metric similarity graphs for maximum inner product search
S. Morozov and A. Babenko · 2018
Later among the works it cites.
Hardness of approximate nearest neighbor search
A. Rubinstein · 2018
Later among the works it cites.
Norm-ranging LSH for maximum inner product search
X. Yan, J. Li, X. Dai, H. Chen, and J. Cheng · 2018
Later among the works it cites.
Communication complexity of estimating correlations
U. Hadar, J. Liu, Y. Polyanskiy, and O. Shayevitz · 2019
Later among the works it cites.
Distributed estimation of gaussian correlations
U. Hadar and O. Shayevitz · 2019
Later among the works it cites.
Basic tail and concentration bounds
M. J. Wainwright · 2019
Later among the works it cites.
Möbius transformation for fast inner product search on graph
Z. Zhou, S. Tan, Z. Xu, and P. Li · 2019
Later among the works it cites.
Revisiting wedge sampling for budgeted maximum inner product search
S. S. Lorenzen and N. Pham · 2020
Closest in time.
Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs
Y. A. Malkov and D. A. Yashunin · 2020
Closest in time.