kNN-Embed: Locally Smoothed Embedding Mixtures For Multi-interest Candidate Retrieval
Candidate retrieval is the first stage in recommendation systems, where a light-weight system is used to retrieve potentially relevant items for an input user. These candidate items are then ranked and pruned in later stages of recommender systems using a more complex ranking model. As the top of the recommendation funnel, it is important to retrieve a high-recall candidate set to feed into downstream ranking models. A common approach is to leverage approximate nearest neighbor (ANN) search from a single dense query embedding; however, this approach this can yield a low-diversity result set with many near duplicates. As users often have multiple interests, candidate retrieval should ideally return a diverse set of candidates reflective of the user's multiple interests. To this end, we introduce kNN-Embed, a general approach to improving diversity in dense ANN-based retrieval. kNN-Embed represents each user as a smoothed mixture over learned item clusters that represent distinct "interests" of the user. By querying each of a user's mixture component in proportion to their mixture weights, we retrieve a high-diversity set of candidates reflecting elements from each of a user's interests. We experimentally compare kNN-Embed to standard ANN candidate retrieval, and show significant improvements in overall recall and improved diversity across three datasets. Accompanying this work, we open source a large Twitter follow-graph dataset (https://huggingface.co/datasets/Twitter/TwitterFollowGraph), to spur further research in graph-mining and representation learning for recommender systems.
Code (0)
등록된 구현이 없습니다.
Tasks
DiversityGraph MiningRecommendation SystemsRepresentation LearningRetrievalSimilar Papers 제목 키워드 기반
Robust Graph Representation Learning for Local Corruption Recovery
The performance of graph representation learning is affected by the quality of graph input. While existing research usually pursues a globally smoothed graph embedding, we believe the rarely observed anomalies are as wel…
Graph EmbeddingGraph LearningGraph Representation LearningRepresentation LearningAROMMA: Unifying Olfactory Embeddings for Single Molecules and Mixtures
Public olfaction datasets are small and fragmented across single molecules and mixtures, limiting learning of generalizable odor representations. Recent works either learn single-molecule embeddings or address mixtures v…
Knowledge DistillationInstance Smoothed Contrastive Learning for Unsupervised Sentence Embedding
Contrastive learning-based methods, such as unsup-SimCSE, have achieved state-of-the-art (SOTA) performances in learning unsupervised sentence embeddings. However, in previous studies, each embedding used for contrastive…
Contrastive LearningSemantic SimilaritySemantic Textual SimilaritySentence+5Neural Japanese Zero Anaphora Resolution using Smoothed Large-scale Case Frames with Word Embedding
Locally Smoothed Neural Networks
Convolutional Neural Networks (CNN) and the locally connected layer are limited in capturing the importance and relations of different local receptive fields, which are often crucial for tasks such as face verification, …
Face VerificationQuestion AnsweringVisual Question AnsweringVisual Question Answering (VQA)