<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Out-of-Domain Semantics to the Rescue! Zero-Shot Hybrid Retrieval Models · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2201.10582/</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/2201.10582/feed.xml" rel="self" type="application/rss+xml" /><item><title>Out-of-Domain Semantics to the Rescue! Zero-Shot Hybrid Retrieval Models — mentioned by CShorten</title><link>https://news.ycombinator.com/item?id=35057115</link><guid isPermaLink="false">urn:hackerpapers:mention:2201.10582:35057115</guid><pubDate>Tue, 07 Mar 2023 16:18:18 GMT</pubDate><description>&lt;p&gt;1. Please expand on how you are defining full text search distinctly from sparse search to continue the discussion. My understanding is that full-text search is built on inverted indexing which is the intended meaning behind &amp;quot;sparse&amp;quot; search -- whether that be BM25 sparse or SPLADE sparse or exact keyword / phrase matching, my understanding is that it is the same underlying index algorithm with distinctions in scoring for BM25 / SPLADE. 2. The original argument references &amp;quot;combined system&amp;quot; in the sense of Hybrid Search (BM25 + Dense Vector Search). I don&amp;#x27;t think this is a fair comparison…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2201.10582/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.IR</category></item><item><title>Out-of-Domain Semantics to the Rescue! Zero-Shot Hybrid Retrieval Models — mentioned by trengrj</title><link>https://news.ycombinator.com/item?id=35054487</link><guid isPermaLink="false">urn:hackerpapers:mention:2201.10582:35054487</guid><pubDate>Tue, 07 Mar 2023 12:15:16 GMT</pubDate><description>&lt;p&gt;I work at Weaviate, a few comments on why we implemented hybrid search [1]. - Using two separate systems for traditional BM25 and vector search and keeping them in-sync is pretty difficult from an operations perspective. A combined system is much easier to manage and will have better end-to-end latency. - For combining scores, a linear combination like this article suggests is not recommended and instead rank fusion https://rodgerbenham.github.io/bc17-adcs.pdf (where you care what each method ranks first rather than the absolute score) is used. - The point of adding both search methods is for…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2201.10582/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.IR</category></item></channel></rss>
