<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interaction · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2112.01488/</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/2112.01488/feed.xml" rel="self" type="application/rss+xml" /><item><title>ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interaction — mentioned by popidge</title><link>https://news.ycombinator.com/item?id=46135183</link><guid isPermaLink="false">urn:hackerpapers:mention:2112.01488:46135183</guid><pubDate>Wed, 03 Dec 2025 14:55:13 GMT</pubDate><description>&lt;p&gt;Chunking strategy is really difficult and, like you say, so important to RAG. I&amp;#x27;m currently battling with it in a &amp;quot;Podcast archive -&amp;gt; active social trend&amp;quot; clip-finder app I&amp;#x27;m working on. You have to really understand your source material and how it&amp;#x27;s formatted, consider preprocessing, consider when and where semantic breaks happen and how you can deterministically handle that in the specific domain. Adjacency similarity is a must, otherwise you leave perfectly cromulent results on the table because they didn&amp;#x27;t have the right cosine score in a vacuum. There is some early stuff from Apple&amp;#x27;s…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2112.01488/"&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>ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interaction — mentioned by mtbarta3</title><link>https://news.ycombinator.com/item?id=39945474</link><guid isPermaLink="false">urn:hackerpapers:mention:2112.01488:39945474</guid><pubDate>Fri, 05 Apr 2024 18:24:52 GMT</pubDate><description>&lt;p&gt;We&amp;#x27;re building LintDB to productionize late interaction retrieval. If you&amp;#x27;re not familiar with late interaction, here&amp;#x27;s the colBERTv2 paper: https://arxiv.org/pdf/2112.01488.pdf We built LintDB because we had a hard time getting the retrieval performance we wanted in our RAG application. colBERT calculates a document&amp;#x27;s score based on the maximum similarity across multiple vectors per document, and this was more successful for our task. The only problem was that traditional vector databases didn&amp;#x27;t support it. Vespa supports this type of indexing, actually. But the learning curve was high and I…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2112.01488/"&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>ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interaction — HN submission</title><link>https://news.ycombinator.com/item?id=38869223</link><guid isPermaLink="false">urn:hackerpapers:submission:2112.01488:38869223</guid><pubDate>Thu, 04 Jan 2024 16:48:34 GMT</pubDate><description>&lt;p&gt;Show HN: RAGatouille, a simple lib to use&amp;amp;train top retrieval models in RAG apps&lt;/p&gt;&lt;p&gt;Hey HN! If you’re at all interested in LLMs/LLM-apps, you’ve probably heard of RAG: Retrieval-Assisted Generation, i.e. retrieving relevant documents to give to your LLM as context to answer user queries. Today, I’m releasing RAGatouille v0.0.1, whose aim is to make it as easy as can be to improve your RAG pipelines by leveraging state-of-the-art Information Retrieval research. As of right now, there’s quite a big gap between common everyday practice and the IR literature, and a lot of the gap is because there just aren’t good ways to quickly try out and leverage SotA IR techniques.…&lt;/p&gt;&lt;p&gt;15 points; 5 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2112.01488/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.IR</category></item><item><title>ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interaction — mentioned by svcrunch</title><link>https://news.ycombinator.com/item?id=33537561</link><guid isPermaLink="false">urn:hackerpapers:mention:2112.01488:33537561</guid><pubDate>Wed, 09 Nov 2022 20:43:57 GMT</pubDate><description>&lt;p&gt;This is an area that&amp;#x27;s dear to me, I&amp;#x27;m the cofounder of Vectara and have been working with embedding-based semantic search, aka neural search or neural IR, since 2017. To whether Google uses semantic search, the answer is yes, very heavily [1][2]. Not only that, but they have led, and continue to lead, much of the pioneering research in NLP and neural IR for the past decade [3][4][5]. Technical challenges lie along a few primary dimensions. The first has been search quality, because, while early neural systems like Google Talk to Books [5][6] demonstrated the potential of these techniques…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2112.01488/"&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>ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interaction — HN submission</title><link>https://news.ycombinator.com/item?id=29450974</link><guid isPermaLink="false">urn:hackerpapers:submission:2112.01488:29450974</guid><pubDate>Sun, 05 Dec 2021 17:36:32 GMT</pubDate><description>&lt;p&gt;ColBERTv2: Effective and Efﬁcient Retrieval via Lightweight Late Interaction&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2112.01488/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.IR</category></item></channel></rss>
