<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>On the Theoretical Limitations of Embedding-Based Retrieval · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2508.21038/</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/2508.21038/feed.xml" rel="self" type="application/rss+xml" /><item><title>On the Theoretical Limitations of Embedding-Based Retrieval — mentioned by kingstnap</title><link>https://news.ycombinator.com/item?id=45698420</link><guid isPermaLink="false">urn:hackerpapers:mention:2508.21038:45698420</guid><pubDate>Fri, 24 Oct 2025 19:48:46 GMT</pubDate><description>&lt;p&gt;There are many many problems with attention. The softmax has issues regarding attention sinks [1]. The softmax also causes sharpness problems [2]. In general this decision boundary being Euclidean dot products isn&amp;#x27;t actually optimal for everything, there are many classes of problem where you want polyhedral cones [3]. Positional embedding are also janky af and so is rope tbh, I think Cannon layers are a more promising alternative for horizontal alignment [4]. I still think there is plenty of room to improve these things. But a lot of focus right now is unfortunately being spent on…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2508.21038/"&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>On the Theoretical Limitations of Embedding-Based Retrieval — mentioned by ignobletruth</title><link>https://news.ycombinator.com/item?id=45262290</link><guid isPermaLink="false">urn:hackerpapers:mention:2508.21038:45262290</guid><pubDate>Tue, 16 Sep 2025 13:52:35 GMT</pubDate><description>&lt;p&gt;Question for you experts here. This article uses theory to imply a high bound for semantic capacity in a a vector space. However, this recent article (https://arxiv.org/pdf/2508.21038) empirically characterizes the semantic capacity of embedding vectors, finding inadequate capacity for some use cases. These two articles seem at odds. Can anyone help put these two findings in context and explain their seeming contradictions?&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2508.21038/"&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>On the Theoretical Limitations of Embedding-Based Retrieval — mentioned by kgeist</title><link>https://news.ycombinator.com/item?id=45226753</link><guid isPermaLink="false">urn:hackerpapers:mention:2508.21038:45226753</guid><pubDate>Fri, 12 Sep 2025 21:05:03 GMT</pubDate><description>&lt;p&gt;There was recently this paper: https://arxiv.org/abs/2508.21038 They show that with 4096-dimensional vectors, accuracy starts to fail at 250 mln documents (fundamental limits of embedding models). For 512-dim, it&amp;#x27;s just 500k. Is 1 bln vectors practical?&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2508.21038/"&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>On the Theoretical Limitations of Embedding-Based Retrieval — mentioned by gmueckl</title><link>https://news.ycombinator.com/item?id=45119667</link><guid isPermaLink="false">urn:hackerpapers:mention:2508.21038:45119667</guid><pubDate>Wed, 03 Sep 2025 19:40:43 GMT</pubDate><description>&lt;p&gt;Why not link the paper on arxiv? https://arxiv.org/abs/2508.21038&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2508.21038/"&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>On the Theoretical Limitations of Embedding-Based Retrieval — HN submission</title><link>https://news.ycombinator.com/item?id=45119397</link><guid isPermaLink="false">urn:hackerpapers:submission:2508.21038:45119397</guid><pubDate>Wed, 03 Sep 2025 19:09:29 GMT</pubDate><description>&lt;p&gt;The Theoretical Limitations of Embedding-Based Retrieval&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;36 points; 3 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2508.21038/"&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>On the Theoretical Limitations of Embedding-Based Retrieval — HN submission</title><link>https://news.ycombinator.com/item?id=45080035</link><guid isPermaLink="false">urn:hackerpapers:submission:2508.21038:45080035</guid><pubDate>Sun, 31 Aug 2025 03:10:51 GMT</pubDate><description>&lt;p&gt;The Theoretical Limitations of Embedding-Based Retrieval&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2508.21038/"&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>On the Theoretical Limitations of Embedding-Based Retrieval — HN submission</title><link>https://news.ycombinator.com/item?id=45068986</link><guid isPermaLink="false">urn:hackerpapers:submission:2508.21038:45068986</guid><pubDate>Fri, 29 Aug 2025 20:25:34 GMT</pubDate><description>&lt;p&gt;The Theoretical Limitations of Embedding-Based Retrieval&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;151 points; 38 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2508.21038/"&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>
