<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Resources for Brewing BEIR: Reproducible Reference Models and an Official Leaderboard · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2306.07471/</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.07471/feed.xml" rel="self" type="application/rss+xml" /><item><title>Resources for Brewing BEIR: Reproducible Reference Models and an Official Leaderboard — mentioned by dmezzetti</title><link>https://news.ycombinator.com/item?id=37391901</link><guid isPermaLink="false">urn:hackerpapers:mention:2306.07471:37391901</guid><pubDate>Tue, 05 Sep 2023 14:13:11 GMT</pubDate><description>&lt;p&gt;It would be good to have a BM25 baseline entry on this leaderboard: https://huggingface.co/spaces/mteb/leaderboard And I&amp;#x27;m sure you&amp;#x27;re aware of the BEIR paper: https://arxiv.org/abs/2306.07471. Elastic references that in this blogpost: https://www.elastic.co/blog/improving-information-retrieval-... I agree that BM25 retrieval + vector re-ranking can work. But vector search does bring results to the table that vanilla BM25 can&amp;#x27;t, even with a large retrieval window. So I do think there is a place for both with the usual &amp;quot;it depends on your data/requirements&amp;quot; caveat.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2306.07471/"&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>
