<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Retrieval with Learned Similarities · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2407.15462/</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/2407.15462/feed.xml" rel="self" type="application/rss+xml" /><item><title>Retrieval with Learned Similarities — mentioned by lunarmony</title><link>https://news.ycombinator.com/item?id=45071794</link><guid isPermaLink="false">urn:hackerpapers:mention:2407.15462:45071794</guid><pubDate>Sat, 30 Aug 2025 03:54:38 GMT</pubDate><description>&lt;p&gt;Researchers have discussed limitations of vector-based retrieval from a rank perspective in various forms for a few years. It&amp;#x27;s further been shown that better alternative exists; some low-rank approaches can theoretically approximate arbitrary high-rank distribution while permitting MIPS-level efficient inference (see e.g., Retrieval with Learned Similarities, https://arxiv.org/abs/2407.15462). Such solutions are already being used in production at Meta and at LinkedIn.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2407.15462/"&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>
