<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[reranker 是不是生产 RAG 必选？]]></title><description><![CDATA[<p dir="auto">我们 top_5 经常有相关但不够准的块。加 reranker 能解决吗，还是又一层复杂度？</p>
]]></description><link>https://localaihub.com/topic/56/reranker-是不是生产-rag-必选</link><generator>RSS for Node</generator><lastBuildDate>Wed, 03 Jun 2026 19:20:07 GMT</lastBuildDate><atom:link href="https://localaihub.com/topic/56.rss" rel="self" type="application/rss+xml"/><pubDate>Sat, 02 May 2026 16:37:00 GMT</pubDate><ttl>60</ttl><item><title><![CDATA[Reply to reranker 是不是生产 RAG 必选？ on Sun, 03 May 2026 13:10:00 GMT]]></title><description><![CDATA[<p dir="auto">记得看失败类型。reranker 变好的是排序，不是权限、解析、切块这些问题。</p>
]]></description><link>https://localaihub.com/post/123</link><guid isPermaLink="true">https://localaihub.com/post/123</guid><dc:creator><![CDATA[林小北]]></dc:creator><pubDate>Sun, 03 May 2026 13:10:00 GMT</pubDate></item><item><title><![CDATA[Reply to reranker 是不是生产 RAG 必选？ on Sun, 03 May 2026 11:20:00 GMT]]></title><description><![CDATA[<p dir="auto">我先做 A/B：无 rerank、rerank 全量、只对低置信问题 rerank。</p>
]]></description><link>https://localaihub.com/post/122</link><guid isPermaLink="true">https://localaihub.com/post/122</guid><dc:creator><![CDATA[小傅]]></dc:creator><pubDate>Sun, 03 May 2026 11:20:00 GMT</pubDate></item><item><title><![CDATA[Reply to reranker 是不是生产 RAG 必选？ on Sun, 03 May 2026 09:08:00 GMT]]></title><description><![CDATA[<p dir="auto">Cohere 有 rerank API，注意数据出境和成本。内部制度文档别随便外发。</p>
]]></description><link>https://localaihub.com/post/121</link><guid isPermaLink="true">https://localaihub.com/post/121</guid><dc:creator><![CDATA[Grace]]></dc:creator><pubDate>Sun, 03 May 2026 09:08:00 GMT</pubDate></item><item><title><![CDATA[Reply to reranker 是不是生产 RAG 必选？ on Sun, 03 May 2026 08:27:00 GMT]]></title><description><![CDATA[<p dir="auto">有没有线上 API 方案？不想自己部署。</p>
]]></description><link>https://localaihub.com/post/120</link><guid isPermaLink="true">https://localaihub.com/post/120</guid><dc:creator><![CDATA[qwer_asdf]]></dc:creator><pubDate>Sun, 03 May 2026 08:27:00 GMT</pubDate></item><item><title><![CDATA[Reply to reranker 是不是生产 RAG 必选？ on Sun, 03 May 2026 08:19:00 GMT]]></title><description><![CDATA[<p dir="auto">这 700ms 有时候值得。企业 RAG 里，错引比慢一点更难接受。</p>
]]></description><link>https://localaihub.com/post/119</link><guid isPermaLink="true">https://localaihub.com/post/119</guid><dc:creator><![CDATA[小路灯]]></dc:creator><pubDate>Sun, 03 May 2026 08:19:00 GMT</pubDate></item><item><title><![CDATA[Reply to reranker 是不是生产 RAG 必选？ on Sun, 03 May 2026 05:28:00 GMT]]></title><description><![CDATA[<p dir="auto">我们加 reranker 后引用更稳，但答案没变聪明。老板一开始不理解，说怎么多花 700ms 只为了引用顺序。</p>
]]></description><link>https://localaihub.com/post/118</link><guid isPermaLink="true">https://localaihub.com/post/118</guid><dc:creator><![CDATA[米饭]]></dc:creator><pubDate>Sun, 03 May 2026 05:28:00 GMT</pubDate></item><item><title><![CDATA[Reply to reranker 是不是生产 RAG 必选？ on Sun, 03 May 2026 04:17:00 GMT]]></title><description><![CDATA[<p dir="auto">rerank 前最好去重。同一页相邻块全进候选，reranker 也浪费。</p>
]]></description><link>https://localaihub.com/post/117</link><guid isPermaLink="true">https://localaihub.com/post/117</guid><dc:creator><![CDATA[阿航]]></dc:creator><pubDate>Sun, 03 May 2026 04:17:00 GMT</pubDate></item><item><title><![CDATA[Reply to reranker 是不是生产 RAG 必选？ on Sun, 03 May 2026 02:11:00 GMT]]></title><description><![CDATA[<p dir="auto">可以按意图开关。导航类、明确标题类不 rerank；制度解释、冲突证据类 rerank。</p>
]]></description><link>https://localaihub.com/post/116</link><guid isPermaLink="true">https://localaihub.com/post/116</guid><dc:creator><![CDATA[nora]]></dc:creator><pubDate>Sun, 03 May 2026 02:11:00 GMT</pubDate></item><item><title><![CDATA[Reply to reranker 是不是生产 RAG 必选？ on Sun, 03 May 2026 01:47:00 GMT]]></title><description><![CDATA[<p dir="auto">我们 bge-reranker-v2-m3 本地跑，CPU 直接慢到用户怀疑网页卡死。后来只给高风险问题开。</p>
]]></description><link>https://localaihub.com/post/115</link><guid isPermaLink="true">https://localaihub.com/post/115</guid><dc:creator><![CDATA[小潘同学]]></dc:creator><pubDate>Sun, 03 May 2026 01:47:00 GMT</pubDate></item><item><title><![CDATA[Reply to reranker 是不是生产 RAG 必选？ on Sat, 02 May 2026 22:55:00 GMT]]></title><description><![CDATA[<p dir="auto">因为它通常要看 query 和每个候选 chunk 的交互，不是只算一次向量距离。</p>
]]></description><link>https://localaihub.com/post/114</link><guid isPermaLink="true">https://localaihub.com/post/114</guid><dc:creator><![CDATA[MingK]]></dc:creator><pubDate>Sat, 02 May 2026 22:55:00 GMT</pubDate></item><item><title><![CDATA[Reply to reranker 是不是生产 RAG 必选？ on Sat, 02 May 2026 21:42:00 GMT]]></title><description><![CDATA[<p dir="auto">我以为 reranker 就是重新排序，为什么会变慢很多？</p>
]]></description><link>https://localaihub.com/post/113</link><guid isPermaLink="true">https://localaihub.com/post/113</guid><dc:creator><![CDATA[小树]]></dc:creator><pubDate>Sat, 02 May 2026 21:42:00 GMT</pubDate></item><item><title><![CDATA[Reply to reranker 是不是生产 RAG 必选？ on Sat, 02 May 2026 21:11:00 GMT]]></title><description><![CDATA[<p dir="auto">reranker 不是修复垃圾召回的。前 30 里没有答案，rerank 也变不出来。</p>
]]></description><link>https://localaihub.com/post/112</link><guid isPermaLink="true">https://localaihub.com/post/112</guid><dc:creator><![CDATA[林小北]]></dc:creator><pubDate>Sat, 02 May 2026 21:11:00 GMT</pubDate></item><item><title><![CDATA[Reply to reranker 是不是生产 RAG 必选？ on Sat, 02 May 2026 21:00:00 GMT]]></title><description><![CDATA[<p dir="auto">先别上来就全链路 rerank。可以 top_30 召回，rerank 到 top_5，再看延迟。</p>
]]></description><link>https://localaihub.com/post/111</link><guid isPermaLink="true">https://localaihub.com/post/111</guid><dc:creator><![CDATA[小严]]></dc:creator><pubDate>Sat, 02 May 2026 21:00:00 GMT</pubDate></item><item><title><![CDATA[Reply to reranker 是不是生产 RAG 必选？ on Sat, 02 May 2026 19:26:00 GMT]]></title><description><![CDATA[<p dir="auto">能解决一部分，尤其是问题短、文档块多、相似标题很多的时候。</p>
]]></description><link>https://localaihub.com/post/110</link><guid isPermaLink="true">https://localaihub.com/post/110</guid><dc:creator><![CDATA[Grace]]></dc:creator><pubDate>Sat, 02 May 2026 19:26:00 GMT</pubDate></item></channel></rss>