<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Revisiting Neural Retrieval on Accelerators · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2306.04039/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2306.04039/feed.xml" rel="self" type="application/rss+xml" /><item><title>Revisiting Neural Retrieval on Accelerators — mentioned by lunarmony</title><link>https://news.ycombinator.com/item?id=45099503</link><guid isPermaLink="false">urn:hackerpapers:mention:2306.04039:45099503</guid><pubDate>Tue, 02 Sep 2025 05:43:59 GMT</pubDate><description>&lt;p&gt;Mixture of Logits was actually already deployed on 100M scale+ datasets at Meta and at LinkedIn (https://arxiv.org/abs/2306.04039 https://arxiv.org/abs/2407.13218 etc.). The crucial departure from traditional embedding/multi-embedding approaches is in learning a query-/item- dependent gating function, which enables MoL to become a universal high-rank approximator (assuming we care about recall@1) even when the input embeddings are low rank.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2306.04039/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
