Unfolded Self-Reconstruction LSH: Towards Machine Unlearning in Approximate Nearest Neighbour Search

Guo, R., Sun, P., Lindgren, E., Geng, Q., Simcha, D., Chern, F., Kumar, S.: Accelerating large-scale inference with anisotropic vector quantization. In: International Conference on Machine Learning (2020), https://arxiv.org/abs/1908.10396

Original

1908

Earlier work this paper cites.

Bentley, J.L.: Multidimensional binary search trees used for associative searching. Communications of the ACM 18

1975

Earlier work this paper cites.

Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the thirtieth annual ACM symposium on Theory of computing. pp. 604–613 (1998)

1998

Earlier work this paper cites.

Gionis, A., Indyk, P., Motwani, R., et al.: Similarity search in high dimensions via hashing. In: Vldb. vol. 99, pp. 518–529 (1999)

1999

Earlier work this paper cites.

Charikar, M.S.: Similarity estimation techniques from rounding algorithms. In: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing. pp. 380–388 (2002)

2002

Earlier work this paper cites.

Lv, Q., Josephson, W., Wang, Z., Charikar, M., Li, K.: Multi-probe lsh: efficient indexing for high-dimensional similarity search. In: Proceedings of the 33rd international conference on Very large data bases. pp. 950–961 (2007)

2007

Earlier work this paper cites.

Tao, Y., Yi, K., Sheng, C., Kalnis, P.: Quality and efficiency in high dimensional nearest neighbor search. In: Proceedings of the 2009 ACM SIGMOD International Conference on Management of data. pp. 563–576 (2009)

2009

Earlier work this paper cites.

Ji, J., Li, J., Yan, S., Zhang, B., Tian, Q.: Super-bit locality-sensitive hashing. Advances in neural information processing systems 25

2012

Earlier work this paper cites.

Thrun, S., Pratt, L.: Learning to learn. Springer Science & Business Media (2012)

2012

Cited alongside, same era.

Ji, J., Yan, S., Li, J., Gao, G., Tian, Q., Zhang, B.: Batch-orthogonal locality-sensitive hashing for angular similarity. IEEE transactions on pattern analysis and machine intelligence 36

2014

Cited alongside, same era.

Wang, J., Shen, H.T., Song, J., Ji, J.: Hashing for similarity search: A survey. arXiv preprint arXiv:1408.2927 (2014)

Original

2014

Cited alongside, same era.

Bernhardsson, E.: Annoy: Approximate nearest neighbors oh yeah (2017), https://github.com/spotify/annoy

2017

Cited alongside, same era.

Voigt, P., Von dem Bussche, A.: The eu general data protection regulation (gdpr). A Practical Guide, 1st Ed., Cham: Springer International Publishing 10

2017

Cited alongside, same era.

of the Privacy Commissioner of Canada, O.: Announcement: Privacy commissioner seeks federal court determination on key issue for canadiansónline reputation, https://www.priv.gc.ca/en/opc-news/news-and-announcements/2018/an˙181010

2018

Later among the works it cites.

Sharma, J., Navlakha, S.: Improving similarity search with high-dimensional locality-sensitive hashing. arXiv preprint arXiv:1812.01844 (2018)

Original

2018

Later among the works it cites.

Johnson, J., Douze, M., Jégou, H.: Billion-scale similarity search with GPUs. IEEE Transactions on Big Data 7

2019

Later among the works it cites.

Aumüller, M., Bernhardsson, E., Faithfull, A.: Ann-benchmarks: A benchmarking tool for approximate nearest neighbor algorithms. Information Systems 87

2020

Later among the works it cites.

Goldman, E.: An introduction to the california consumer privacy act (ccpa). Santa Clara Univ. Legal Studies Research Paper (2020)