<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Universal Model Routing for Efficient LLM Inference · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2502.08773/</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/2502.08773/feed.xml" rel="self" type="application/rss+xml" /><item><title>Universal Model Routing for Efficient LLM Inference — mentioned by botirk</title><link>https://news.ycombinator.com/item?id=45403276</link><guid isPermaLink="false">urn:hackerpapers:mention:2502.08773:45403276</guid><pubDate>Sun, 28 Sep 2025 10:33:20 GMT</pubDate><description>&lt;p&gt;We have been experimenting with routing inference across LLMs, and the path has been full of wrong turns. Our first attempt was to just use a large LLM itself to decide routing. It was too costly and the decisions were unreliable. Next we tried training a small fine-tuned LLM as a router. It was cheaper, but the outputs were poor and not trustworthy. Then we wrote heuristics to map prompt types to model IDs. That worked for a while, but it was brittle. Every API change or workload shift broke it. Eventually we shifted to thinking in terms of model criteria instead of hardcoded model IDs. We…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2502.08773/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item></channel></rss>
