mlsanityData to 14 Oct 2026

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

arXiv 2607.08107 ↗First posted 9 Jul 2026cs.IR cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

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 gives no per-user estimate of how much each interest matters for serving. We present BACH (Bayesian Admixture of Contrastive Heads), which casts multi-interest two-tower retrieval as a per-user mixture over the heads, fit by variational inference. The soft mixture trains every head (mitigating collapse), produces a per-user weighting of the interests that is reused at serving, and admits a shared global-codebook variant with precomputable retrieval. On three large-scale benchmarks, MovieLens-20M, Taobao, and Netflix, BACH improves top-of-ranking retrieval over hard-routing multi-interest and single-vector baselines at every head count; we further find that scoring every candidate by its best head, consistent with serving, outperforms the usual target-routed training, and that BACH improves further still.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 12 of its 27 references that are in the map. First posted on arXiv 9 Jul 2026.

Builds on

12 of 27 references.

References · 12

  1. 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,824
  2. 2016Variational Inference: A Review for Statisticianscited by 1,472
  3. 2018Self-Attentive Sequential Recommendationcited by 1,184
  4. 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,178
  5. 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 849
  6. 2020Prototypical Contrastive Learning of Unsupervised Representationscited by 640
  7. 2017Breaking the Softmax Bottleneck: A High-Rank RNN Language Modelcited by 152
  8. 2019Multi-Interest Network with Dynamic Routing for Recommendation at Tmallcited by 114
  9. 2020Controllable Multi-Interest Framework for Recommendationcited by 93
  10. 2020PinnerSage: Multi-Modal User Embedding Framework for Recommendations at Pinterestcited by 75
  11. 2020The Power Spherical distributioncited by 27
  12. 2023Rethinking Multi-Interest Learning for Candidate Matching in Recommender Systemscited by 11

Built on by

Not cited yet.