<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>2609.01343 on Jaehun's Blog</title><link>https://jaehun.me/tags/2609.01343/</link><description>Recent content in 2609.01343 on Jaehun's Blog</description><generator>Hugo</generator><language>ko-kr</language><lastBuildDate>Mon, 07 Sep 2026 14:31:22 +0000</lastBuildDate><atom:link href="https://jaehun.me/tags/2609.01343/index.xml" rel="self" type="application/rss+xml"/><item><title>SMELT: Scaling Laws for Compute-Matched MoE Looped Transformers</title><link>https://jaehun.me/posts/smelt-scaling-laws-for-compute-matched-moe-looped-transformers/</link><pubDate>Mon, 07 Sep 2026 00:00:00 +0900</pubDate><guid>https://jaehun.me/posts/smelt-scaling-laws-for-compute-matched-moe-looped-transformers/</guid><description>&lt;p&gt;&lt;a&#10; href="https://arxiv.org/abs/2609.01343"target="_blank"&#10; class="inline-flex items-center gap-1"&#10; &gt;논문 링크&lt;svg class="h-3 w-3 flex-shrink-0" id="external-link" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"&gt;&lt;path fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" d="M15 3h6v6m-11 5L21 3m-3 10v6a2 2 0 0 1-2 2H5a2 2 0 0 1-2-2V8a2 2 0 0 1 2-2h6"/&gt;&lt;/svg&gt;&#10; &lt;/a&gt;&lt;/p&gt;&#10;&lt;h2 id="smelt-계산량을-맞춘-moe-루프-트랜스포머의-스케일링-법칙"&gt;SMELT: 계산량을 맞춘 MoE 루프 트랜스포머의 스케일링 법칙&lt;a href="#smelt-%ea%b3%84%ec%82%b0%eb%9f%89%ec%9d%84-%eb%a7%9e%ec%b6%98-moe-%eb%a3%a8%ed%94%84-%ed%8a%b8%eb%9e%9c%ec%8a%a4%ed%8f%ac%eb%a8%b8%ec%9d%98-%ec%8a%a4%ec%bc%80%ec%9d%bc%eb%a7%81-%eb%b2%95%ec%b9%99" class="heading-anchor" aria-label="이 섹션에 대한 링크"&gt;&lt;svg class="h-4 w-4" aria-hidden="true" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"&gt;&lt;g fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2"&gt;&lt;path d="M10 13a5 5 0 0 0 7.54.54l3-3a5 5 0 0 0-7.07-7.07l-1.72 1.71"/&gt;&lt;path d="M14 11a5 5 0 0 0-7.54-.54l-3 3a5 5 0 0 0 7.07 7.07l1.71-1.71"/&gt;&lt;/g&gt;&lt;/svg&gt;&lt;/a&gt;&lt;/h2&gt;&lt;h2 id="한-줄-요약-tldr"&gt;한 줄 요약 (TL;DR)&lt;a href="#%ed%95%9c-%ec%a4%84-%ec%9a%94%ec%95%bd-tldr" class="heading-anchor" aria-label="이 섹션에 대한 링크"&gt;&lt;svg class="h-4 w-4" aria-hidden="true" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"&gt;&lt;g fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2"&gt;&lt;path d="M10 13a5 5 0 0 0 7.54.54l3-3a5 5 0 0 0-7.07-7.07l-1.72 1.71"/&gt;&lt;path d="M14 11a5 5 0 0 0-7.54-.54l-3 3a5 5 0 0 0 7.07 7.07l1.71-1.71"/&gt;&lt;/g&gt;&lt;/svg&gt;&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;루프 트랜스포머는 레이어 블록을 반복 실행해 깊이를 늘리지만, 기존 연구는 대부분 &lt;strong&gt;파라미터 수만 고정&lt;/strong&gt;한 채 FLOPs를 늘려 &amp;ldquo;공짜 점수&amp;quot;를 얻고 있었다. SMELT는 &lt;strong&gt;per-token FLOPs·총 파라미터·KV 캐시&lt;/strong&gt; 세 예산을 동시에 맞추고도 루핑이 순수한 아키텍처 이득임을 증명한다(근거: §1). 그 결과 compute-optimal 프론티어에서 &lt;strong&gt;6.8~18.0%의 학습 FLOPs&lt;/strong&gt;를 절약하고, 이 이득은 검증 손실이 예측하는 것보다 다운스트림에서 더 크게 나타난다(근거: §4.3, §5.1).&lt;/p&gt;</description></item></channel></rss>