<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Scaling Embedding Layers in Language Models · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2502.01637/</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.01637/feed.xml" rel="self" type="application/rss+xml" /><item><title>Scaling Embedding Layers in Language Models — mentioned by ankit219</title><link>https://news.ycombinator.com/item?id=44045484</link><guid isPermaLink="false">urn:hackerpapers:mention:2502.01637:44045484</guid><pubDate>Tue, 20 May 2025 20:17:55 GMT</pubDate><description>&lt;p&gt;You can read this for a comprehensive deep dive. https://arxiv.org/pdf/2502.01637 At a very high level, instead of having embeddings at the input layers, this method keeps the embeddings at the layer level. That is every transformer layer would have its own set of learnable embedding vectors that are used to modify the processed hidden states flowing through the network. Mostly, the embeddings are precomputed and stored separately. They are queried at inference time and has very low latency, so you can get comparable performance with half the RAM. (i am not exactly sure how 3n is doing it…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2502.01637/"&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>
