PulseAugur
实时 07:13:04

新的贝叶斯检索模型BACH 改进了多兴趣推荐

研究人员开发了 BACH,一种新颖的贝叶斯方法,用于多兴趣双塔检索系统。与使用硬路由的现有模型不同,BACH 采用对比损失的软混合头,缓解了训练利用不足的问题,并提供每个用户兴趣重要性的估计。该方法在大规模基准测试(包括 MovieLens-20MTaobaoNetflix)上展示了改进的检索性能,优于单向量和硬路由多兴趣基线。 AI

影响 通过解决多兴趣检索中的局限性,为改进推荐系统引入了一种新颖的方法。

排序理由 该集群包含一篇详细介绍新模型及其在基准测试上性能的研究论文。[lever_c_demoted from research: ic=1 ai=1.0]

在 arXiv cs.IR (Information Retrieval) 阅读 →

AI 生成摘要 · Google Gemini · 来自 2 个来源。 我们如何撰写摘要 →

新的贝叶斯检索模型BACH 改进了多兴趣推荐

报道来源 [2]

  1. arXiv cs.LG TIER_1 English(EN) · Quoc Phong Nguyen, Paul Albert, Long Vuong, Vuong Le, Julien Monteil ·

    BACH: A Bayesian Admixture of Contrastive Heads for Multi-Interest Two-Tower Retrieval

    arXiv:2607.08107v1 Announce Type: cross Abstract: Two-tower retrievers compress each user into a single embedding, limiting their ability to serve diverse interests. Multi-interest models give each user several heads scored by a maximum inner product, but their hard-routing train…

  2. arXiv cs.IR (Information Retrieval) TIER_1 English(EN) · Julien Monteil ·

    BACH: 一种用于多兴趣双塔检索的贝叶斯混合对比头

    Two-tower retrievers compress each user into a single embedding, limiting their ability to serve diverse interests. Multi-interest models give each user several heads scored by a maximum inner product, but their hard-routing training under-utilizes heads (routing collapse) and gi…