Cache-Augmented Inbatch Importance Resampling for Training Recommender Retriever
Jin Chen, Defu Lian, Yucheng Li, Baoyun Wang, Kai Zheng, Enhong Chen
Abstract
Recommender retrievers aim to rapidly retrieve a fraction of items from the entire item corpus when a user query requests, with the representative two-tower model trained with the log softmax loss. For efficiently training recommender retrievers on modern hardwares, inbatch sampling, where the items in the mini-batch are shared as negatives to estimate the softmax function, has attained growing interest. However, existing inbatch sampling based strategies just correct the sampling bias of inbatch items with item frequency, being unable to distinguish the user queries within the mini-batch and still incurring significant bias from the softmax. In this paper, we propose a Cache-Augmented Inbatch Importance Resampling ( χ IR) for training recommender retrievers, which not only offers different negatives to user queries with inbatch items, but also adaptively achieves a more accurate estimation of the softmax distribution. Specifically, χ IR resamples items for the given mini-batch training pairs based on certain probabilities, where a cache with more frequently sampled items is adopted to augment the candidate item set, with the purpose of reusing the historical informative samples. χ IR enables to sample query-dependent negatives based on inbatch items and to capture dynamic changes of model training, which leads to a better approximation of the softmax and further contributes to better convergence. Finally, we conduct experiments to validate the superior performance of the proposed χ IR compared with competitive approaches. Preprint. Under review.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 2fec1a67-8c43-4b80-b65b-7d17ed519eafCited by top-tier papers4
- Empowering Collaborative Filtering with Principled Adversarial Contrastive LossAn Zhang, Leheng Sheng, Zhibo Cai, Xiang Wang et al.NeurIPS 2023 · 56 citations
- CONVERT: Contrastive Graph Clustering with Reliable AugmentationXihong Yang, Cheng Tan, Yue Liu, Ke Liang et al.ACM MM 2023 · 56 citations
- Online Distillation-enhanced Multi-modal Transformer for Sequential RecommendationWei Ji, Xiangyan Liu, An Zhang, Yinwei Wei et al.ACM MM 2023 · 32 citations
- Preference Diffusion for RecommendationShuo Liu, An Zhang, Guoqing Hu, Hong Qian et al.ICLR 2025
Builds on5
- Accelerating Large-Scale Inference with Anisotropic Vector QuantizationRuiqi Guo, Philip Sun, Erik Lindgren, Quan Geng et al.ICML 2020 · 539 citations
- Simplify and Robustify Negative Sampling for Implicit Collaborative FilteringJingtao Ding, Yuhan Quan, Quanming Yao, Yong Li et al.NeurIPS 2020 · 131 citations
- Personalized Ranking with Importance SamplingDefu Lian, Qi Liu, Enhong ChenWWW 2020 · 98 citations
- Sampling-Decomposable Generative Adversarial RecommenderBinbin Jin, Defu Lian, Zheng Liu, Qi Liu et al.NeurIPS 2020 · 53 citations
- Efficient Training of Retrieval Models using Negative CacheErik Lindgren, Sashank J. Reddi, Ruiqi Guo, Sanjiv KumarNeurIPS 2021 · 30 citations
Related papers
- Learning Recommenders for Implicit Feedback with Importance ResamplingJin Chen, Defu Lian, Binbin Jin, Kai Zheng et al.WWW 2022 · 39 citations
- Cooperative Retriever and Ranker in Deep RecommendersXu Huang, Defu Lian, Jin Chen, Zheng Liu et al.WWW 2023 · 17 citations
- A Fresh Take on Stale Embeddings: Improving Dense Retriever Training with Corrector NetworksNicholas Monath, Will Sussman Grathwohl, Michael Boratko, Rob Fergus et al.ICML 2024 · 1 citation
- A Gradient Accumulation Method for Dense Retriever under Memory ConstraintJaehee Kim, Yukyung Lee, Pilsung KangNeurIPS 2024 · 10 citations
- Improving the Accuracy of Dense Retrieval on the Quantized Indexes via Gradient Optimization of the Target EmbeddingsCong Tan, Yongqi Shao, Hong Huo, Tao FangAAAI 2026
