Галерея 3503589

Галерея 3503589

Sign in

Register

Fast neural ranking on bipartite graph indices
Published: 01 December 2021 Publication History
Proceedings of the VLDB Endowment Volume 15, Issue 4
Lawrence Cayton. 2008. Fast nearest neighbor retrieval for bregman divergences. In Proceedings of the Twenty-Fifth International Conference on Machine learning (ICML). Helsinki, Finland, 112--119. Google Scholar Digital Library Wei-Cheng Chang, Felix X Yu, Yin-Wen Chang, Yiming Yang, and Sanjiv Kumar. 2020. Pre-training Tasks for Embedding-based Large-scale Retrieval. In Proceedings of the 8th International Conference on Learning Representations (ICLR). Addis Ababa. Google Scholar Moses S. Charikar. 2002. Similarity estimation techniques from rounding algorithms. In Proceedings on 34th Annual ACM Symposium on Theory of Computing (STOC). Montreal, Canada, 380--388. Google Scholar Digital Library Danqi Chen, Adam Fisch, Jason Weston, and Antoine Bordes. 2017. Reading Wikipedia to Answer Open-Domain Questions. In Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (ACL). Vancouver, Canada, 1870--1879. Google Scholar Cross Ref Paul Covington, Jay Adams, and Emre Sargin. 2016. Deep Neural Networks for YouTube Recommendations. In Proceedings of the 10th ACM Conference on Recommender Systems (RecSys). Boston, MA, 191--198. Google Scholar Digital Library Ryan R Curtin and Parikshit Ram. 2014. Dual-tree fast exact max-kernel search. Statistical Analysis and Data Mining: The ASA Data Science Journal 7, 4 (2014), 229--253. Google Scholar Digital Library Ryan R Curtin, Parikshit Ram, and Alexander G Gray. 2013. Fast exact max-kernel search. In Proceedings of the 13th SIAM International Conference on Data Mining (SDM). Austin, TX, 1--9. Google Scholar Cross Ref Mostafa Dehghani, Hamed Zamani, Aliaksei Severyn, Jaap Kamps, and W. Bruce Croft. 2017. Neural Ranking Models with Weak Supervision. In Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR). Shinjuku, Tokyo, 65--74. Google Scholar Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. 2019. BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding. In Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT). Minneapolis, MN, 4171--4186. Google Scholar Cong Fu, Chao Xiang, Changxu Wang, and Deng Cai. 2019. Fast approximate nearest neighbor search with the navigating spreading-out graph. Proceedings of the VLDB Endowment 12, 5 (2019), 461--474. Google Scholar Digital Library Tiezheng Ge, Kaiming He, Qifa Ke, and Jian Sun. 2013. Optimized Product Quantization for Approximate Nearest Neighbor Search. In Proceedings of the 2013 IEEE Conference on Computer Vision and Pattern Recognition (CVPR). Portland, OR, 2946--2953. Google Scholar Digital Library Aristides Gionis, Piotr Indyk, and Rajeev Motwani. 1999. Similarity Search in High Dimensions via Hashing. In Proceedings of 25th International Conference on Very Large Data Bases (VLDB). Edinburgh, Scotland, UK, 518--529. Google Scholar Digital Library Michel X. Goemans and David P. Williamson. 1995. Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming. J. ACM 42, 6 (1995), 1115--1145. Google Scholar Digital Library Huifeng Guo, Ruiming Tang, Yunming Ye, Zhenguo Li, and Xiuqiang He. 2017. DeepFM: A Factorization-Machine based Neural Network for CTR Prediction. In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence (IJCAI). Melbourne, Australia, 1725--1731. Google Scholar Cross Ref Jiafeng Guo, Yixing Fan, Qingyao Ai, and W. Bruce Croft. 2016. A Deep Relevance Matching Model for Ad-hoc Retrieval. In Proceedings of the 25th ACM International Conference on Information and Knowledge Management (CIKM). Indianapolis, IN, 55--64. Google Scholar Jiafeng Guo, Yixing Fan, Liang Pang, Liu Yang, Qingyao Ai, Hamed Zamani, Chen Wu, W. Bruce Croft, and Xueqi Cheng. 2020. A Deep Look into neural ranking models for information retrieval. Inf. Process. Manag. 57, 6 (2020), 102067. Google Scholar Cross Ref Kiana Hajebi, Yasin Abbasi-Yadkori, Hossein Shahbazi, and Hong Zhang. 2011. Fast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI). Barcelona, CA, 1312--1317. Google Scholar Xiangnan He, Lizi Liao, Hanwang Zhang, Liqiang Nie, Xia Hu, and Tat-Seng Chua. 2017. Neural collaborative filtering. In Proceedings of the 26th International Conference on World Wide Web (WWW). Perth, Australia, 173--182. Google Scholar Digital Library Geoffrey Hinton, Oriol Vinyals, and Jeff Dean. 2015. Distilling the knowledge in a neural network. arXiv preprint arXiv:1503.02531 (2015). Google Scholar Piotr Indyk and Rajeev Motwani. 1998. Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. In Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing (STOC). Dallas, TX, 604--613. Google Scholar Digital Library Sergey Ioffe. 2010. Improved Consistent Sampling, Weighted Minhash and L1 Sketching. In Proceedings of the 10th IEEE International Conference on Data Mining (ICDM). Sydney, Australia, 246--255. Google Scholar Digital Library Masajiro Iwasaki. 2016. Pruned Bi-directed K-nearest Neighbor Graph for Proximity Search. In Proceedings of the 9th International Conference on Similarity Search and Applications (SISAP) , Vol. 9939. Tokyo, Japan, 20--33. Google Scholar Cross Ref Masajiro Iwasaki and Daisuke Miyazaki. 2018. Optimization of indexing based on k-nearest neighbor graph for proximity search in high-dimensional data. arXiv preprint arXiv:1810.07355 (2018). Google Scholar Hervé Jégou, Matthijs Douze, and Cordelia Schmid. 2008. Hamming Embedding and Weak Geometric Consistency for Large Scale Image Search. In Proceedings of the 10th European Conference on Computer Vision (ECCV), Part I. Marseille, France, 304--317. Google Scholar Digital Library Hervé Jégou, Matthijs Douze, and Cordelia Schmid. 2011. Product Quantization for Nearest Neighbor Search. IEEE Trans. Pattern Anal. Mach. Intell. 33, 1 (2011), 117--128. Google Scholar Digital Library Jyun-Yu Jiang, Patrick H. Chen, Cho-Jui Hsieh, and Wei Wang. 2020. Clustering and Constructing User Coresets to Accelerate Large-scale Top-K Recommender Systems. In Proceedings of the Web Conference (WWW). Taipei, 2177--2187. Google Scholar Digital Library Jeff Johnson, Matthijs Douze, and Hervé Jégou. 2021. Billion-Scale Similarity Search with GPUs. IEEE Trans. Big Data 7, 3 (2021), 535--547. Google Scholar Cross Ref Ping Li. 2017. Linearized GMM Kernels and Normalized Random Fourier Features. In Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD). Halifax, Canada, 315--324. Google Scholar Digital Library Ping Li, Xiaoyun Li, Gennady Samorodnitsky, and Weijie Zhao. 2021. Consistent Sampling Through Extremal Process. In Proceedings of the Web Conference (WWW). Virtual Event / Ljubljana, Slovenia, 1317--1327. Google Scholar Digital Library Ping Li, Michael Mitzenmacher, and Anshumali Shrivastava. 2014. Coding for Random Projections. In Proceedings of the 31th International Conference on Machine Learning (ICML). Beijing, China, 676--684. Google Scholar Xiaoyun Li and Ping Li. 2021. One-Sketch-for-All: Non-linear Random Features from Compressed Linear Measurements. In Proceedings of the 24th International Conference on Artificial Intelligence and Statistics (AISTATS). Virtual Event, 2647--2655. Google Scholar Zhengdong Lu and Hang Li. 2013. A Deep Architecture for Matching ShortTexts. In Advances in Neural Information Processing Systems (NIPS). Lake Tahoe, NV, 1367--1375. Google Scholar Yury A. Malkov and Dmitry A. Yashunin. 2020. Efficient and Robust Approximate Nearest Neighbor Search Using Hierarchical Navigable Small World Graphs. IEEE Trans. Pattern Anal. Mach. Intell. 42, 4 (2020), 824--836. Google Scholar Digital Library Mark Manasse, Frank McSherry, and Kunal Talwar. 2010. Consistent Weighted Sampling. Technical Report MSR-TR-2010-73. Microsoft Research. Google Scholar Bhaskar Mitra and Nick Craswell. 2018. An introduction to neural information retrieval. Foundations and Trends ® in Information Retrieval (2018). Google Scholar Digital Library Stanislav Morozov and Artem Babenko. 2018. Non-metric Similarity Graphs for Maximum Inner Product Search. In Advances in Neural Information Processing Systems (NeurIPS). Montreal, Canada, 4726--4735. Google Scholar Ali Rahimi and Benjamin Recht. 2007. Random Features for Large-Scale Kernel Machines. In Advances in Neural Information Processing Systems (NIPS). Vancouver, Canada, 1177--1184. Google Scholar Anand Rajaraman and Jeffrey David Ullman. 2011. Mining of massive datasets. Cambridge University Press. Google Scholar Digital Library Aliaksei Severyn and Alessandro Moschitti. 2015. Learning to Rank Short Text Pairs with Convolutional Deep Neural Networks. In Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR). Santiago, Chile, 373--382. Google Scholar Digital Library Anshumali Shrivastava and Ping Li. 2012. Fast Near Neighbor Search in High-Dimensional Binary Data. In Proceedings of European Conference on Machine Learning and Knowledge Discovery in Databases (ECML-PKDD). Bristol, UK, 474--489. Google Scholar Digital Library Shulong Tan, Zhaozhuo Xu, Weijie Zhao, Hongliang Fei, Zhixin Zhou, and Ping Li. 2021. Norm Adjusted Proximity Graph for Fast Inner Product Retrieval. In Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD). Virtual Event, Singapore, 1552--1560. Google Scholar Digital Library Shulong Tan, Zhixin Zhou, Zhaozhuo Xu, and Ping Li. 2020. Fast item ranking under neural network based measures. In Proceedings of the 13th International Conference on Web Search and Data Mining (WSDM). 591--599. Google Scholar Digital Library Jiaxi Tang and Ke Wang. 2018. Ranking Distillation: Learning Compact Ranking Models With High Performance for Recommender System. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (KDD). London, UK, 2289--2298. Google Scholar Digital Library Yi Tay, Luu Anh Tuan, and Siu Cheung Hui. 2018. Latent Relational Metric Learning via Memory-based Attention for Collaborative Ranking. In Proceedings of the 2018 World Wide Web Conference on World Wide Web (WWW). Lyon, France, 729--739. Google Scholar Digital Library Xiang Wu, Ruiqi Guo, Ananda Theertha Suresh, Sanjiv Kumar, Daniel N. Holtmann-Rice, David Simcha, and Felix X. Yu. 2017. Multiscale Quantization for Fast Similarity Search. In Advances in Neural Information Processing Systems (NIPS). Long Beach, CA, 5745--5755. Google Scholar Yubao Wu, Ruoming Jin, and Xiang Zhang. 2014. Fast and unified local search for random walk based k-nearest-neighbor query in large graphs. In Proceedings of the International Conference on Management of Data (SIGMOD). Snowbird, UT, 1139--1150. Google Scholar Digital Library Chenyan Xiong, Zhuyun Dai, Jamie Callan, Zhiyuan Liu, and Russell Power. 2017. End-to-end neural ad-hoc ranking with kernel pooling. In Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR). Shinjuku, Tokyo, 55--64. Google Scholar Digital Library Ying Zhang, Tao Xiang, Timothy M. Hospedales, and Huchuan Lu. 2018. Deep Mutual Learning. In Proceedings of the 2018 IEEE Conference on Computer Vision and Pattern Recognition (CVPR). Salt Lake City, UT, 4320--4328. Google Scholar Cross Ref Weijie Zhao, Shulong Tan, and Ping Li. 2020. SONG: Approximate Nearest Neighbor Search on GPU. In Proceedings of the 36th IEEE International Conference on Data Engineering (ICDE). Dallas, TX, 1033--1044. Google Scholar Cross Ref Zhixin Zhou, Shulong Tan, Zhaozhuo Xu, and Ping Li. 2019. Möbius Transformation for Fast Inner Product Search on Graph. In Advances in Neural Information Processing Systems (NeurIPS). Vancouver, Canada, 8216--8227. Google Scholar
Browse All Return Change zoom level
Close modal New Citation Alert added!

Connect

Contact
Facebook
Twitter
Linkedin

Feedback
Bug Report

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2023 ACM, Inc.
If you 'd like us to contact you regarding your feedback, please provide your contact details here.
Neural network based ranking has been widely adopted owing to its powerful capacity in modeling complex relationships (e.g., users and items, questions and answers). Online neural network ranking, i.e., the so called fast neural ranking, is considered a challenging task because neural network measures are in general non-convex and asymmetric. Traditional approximate near neighbor (ANN) search which typically focuses on metric ranking measures, is not applicable to these complex measures. To tackle this challenge, in this paper, we propose to construct BipartitE Graph INdices (BEGIN) for fast neural ranking. BEGIN contains two types of nodes: base/searching objects and sampled queries. The edges connecting these types of nodes are constructed via the neural network ranking measure. The proposed algorithm is a natural extension from traditional search on graph methods and is more suitable for fast neural ranking. Experiments demonstrate the effectiveness and efficiency of the proposed method.
Check if you have access through your login credentials or your institution to get full access on this article.
View this article in digital edition.
https://dl.acm.org/doi/10.14778/3503585.3503589
This alert has been successfully added and will be sent to:
You will be notified whenever a record that you have chosen has been cited.
To manage your alert preferences, click on the button below.
We use cookies to ensure that we give you the best experience on our website.

Дал в рот и кончил на лицо снегурочке
Очень стройная и красивая Franziska Facella трахнула себя в ванной бутылкой
Две обнаженные японки

Галерея 3503589

Report Page