<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A Token is Worth over 1,000 Tokens: Efficient Knowledge Distillation through Low-Rank Clone · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2505.12781/</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/2505.12781/feed.xml" rel="self" type="application/rss+xml" /><item><title>A Token is Worth over 1,000 Tokens: Efficient Knowledge Distillation through Low-Rank Clone — mentioned by namr2000</title><link>https://news.ycombinator.com/item?id=48560093</link><guid isPermaLink="false">urn:hackerpapers:mention:2505.12781:48560093</guid><pubDate>Tue, 16 Jun 2026 18:48:48 GMT</pubDate><description>&lt;p&gt;You don&amp;#x27;t have to train from scratch but you can. Distillation ends up being somewhere in the ballpark of 1000x faster to train [1]. It also comes with the huge advantage of not needing to create RLHF datasets, since you can just copy the behavior of the teacher model. This saves an enormous amount of labeling money at the cost of making the model behave similarly to the teacher. If you are training from scratch, you can look at LLM scaling laws to figure out roughly the compute budget you need to optimally train a model [2]. Based on [2] a 30B model needs something like 2e+23 FLOPS to train…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2505.12781/"&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>
