Fetching the paper…
Reading the bibliography…
We consider the problem of designing locality sensitive hashes (LSH) for inner product similarity, and of the power of asymmetric hashes in this context.
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
Goemans, M. X. and Williamson, D. P. (1995) · 1995
Earlier work this paper cites.
Approximate nearest neighbors: towards removing the curse of dimensionality
Indyk, P. and Motwani, R. (1998) · 1998
Earlier work this paper cites.
Similarity search in high dimensions via hashing
Gionis, A., Indyk, P., and Motwani, R. (1999) · 1999
Earlier work this paper cites.
Similarity estimation techniques from rounding algorithms
Charikar, M. S. (2002) · 2002
Earlier work this paper cites.
Estimating the optimal margins of embeddings in euclidean half spaces
Forster, J., Schmitt, N., Simon, H., and Suttorp, T. (2003) · 2003
Earlier work this paper cites.
Locality-sensitive hashing scheme based on p-stable distributions
Datar, M., Immorlica, N., Indyk, P., and Mirrokni, S. V. (2004) · 2004
Earlier work this paper cites.
Maximum margin matrix factorization
Srebro, N., Rennie, J., and Jaakkola, T. (2005) · 2005
Earlier work this paper cites.
Rank, trace-norm and max-norm
Srebro, N. and Shraibman, A. (2005) · 2005
Cited alongside, same era.
Training linear SVMs in linear time
Joachims, T. (2006) · 2006
Cited alongside, same era.
Active learning for large multi-class problems
Jain, P., , and Kapoor, A. (2009) · 2009
Cited alongside, same era.
Cutting-plane training of structural SVMs
Joachims, T., Finley, T., and Yu, C.-N. J. (2009) · 2009
Cited alongside, same era.
Matrix factorization techniques for recommender systems
Koren, Y., Bell, R., and Volinsky., C. (2009) · 2009
Cited alongside, same era.
Performance of recommender algorithms on top-n recommendation tasks
Cremonesi, P., Koren, Y., and Turrin, R. (2010) · 2010
Cited alongside, same era.
Maximum inner-product search using cone trees
Ram, P. and Gray, A. G. (2012) · 2012
Later among the works it cites.
Fast exact max-kernel search
Curtin, R. R., Ram, P., and Gray, A. G. (2013) · 2013
Later among the works it cites.
Fast, accurate detection of 100,000 object classes on a single machine
Dean, T., Ruzon, M., Segal, M., Shlens, J., Vijayanarasimhan, S., and Yagnik, J. (2013) · 2013
Later among the works it cites.
The power of asymmetry in binary hashing
Neyshabur, B., Yadollahpour, P., Makarychev, Y., Salakhutdinov, R., and Srebro, N. (2013) · 2013
Later among the works it cites.
Speeding up the Xbox recommender system using a euclidean transformation for inner-product spaces
Bachrach, Y., Finkelstein, Y., Gilad-Bachrach, R., Katzir, L., Koenigstein, N., Nice, N., and Paquet, U. (2014) · 2014
Closest in time.
Clustering, hamming embedding, generalized LSH and the max norm
Neyshabur, B., Makarychev, Y., and Srebro, N. (2014) · 2014
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Koenigstein, N., Ram, P., and Shavitt, Y. (2012) · 2012
Cited alongside, same era.
Asymmetric LSH (ALSH) for sublinear time maximum inner product search (MIPS)
Shrivastava, A. and Li, P. (2014a)
Cited in the paper.
Improved asymmetric locality sensitive hashing (ALSH) for maximum inner product search (MIPS)
Shrivastava, A. and Li, P. (2014b)
Cited in the paper.
Closest in time.
Asymmetric minwise hashing for indexing binary inner products and set containment
Shrivastava, A. and Li, P. (2015) · 2015
Closest in time.