<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Machine Learning on Jaehun's Blog</title><link>https://jaehun.me/en/tags/machine-learning/</link><description>Recent content in Machine Learning on Jaehun's Blog</description><generator>Hugo</generator><language>en-US</language><lastBuildDate>Tue, 08 Sep 2026 13:42:29 +0000</lastBuildDate><atom:link href="https://jaehun.me/en/tags/machine-learning/index.xml" rel="self" type="application/rss+xml"/><item><title>[Paper Review] NVIDIA Nemotron 3: Efficient and Open Intelligence</title><link>https://jaehun.me/en/posts/paper-review-nvidia-nemotron-3-efficient-and-open-intelligence/</link><pubDate>Tue, 16 Dec 2025 00:00:00 +0900</pubDate><guid>https://jaehun.me/en/posts/paper-review-nvidia-nemotron-3-efficient-and-open-intelligence/</guid><description>&lt;p&gt;&lt;a&#10; href="https://research.nvidia.com/labs/nemotron/files/NVIDIA-Nemotron-3-White-Paper.pdf"target="_blank"&#10; class="inline-flex items-center gap-1"&#10; &gt;Paper&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="nvidia-nemotron-3-pushing-the-accuracythroughput-frontier-with-a-hybrid-mambatransformer-moe"&gt;NVIDIA Nemotron 3: Pushing the &amp;ldquo;Accuracy/Throughput&amp;rdquo; Frontier with a Hybrid Mamba–Transformer MoE&lt;a href="#nvidia-nemotron-3-pushing-the-accuracythroughput-frontier-with-a-hybrid-mambatransformer-moe" class="heading-anchor" aria-label="Link to this section"&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;Nemotron 3&lt;/strong&gt; combines an MoE hybrid Mamba–Transformer, &lt;strong&gt;LatentMoE&lt;/strong&gt;, &lt;strong&gt;MTP&lt;/strong&gt;, &lt;strong&gt;NVFP4&lt;/strong&gt; training, and &lt;strong&gt;multi-environment RL&lt;/strong&gt; to push up &amp;ldquo;accuracy-to-inference-throughput,&amp;rdquo; presenting &lt;strong&gt;contexts up to 1M tokens&lt;/strong&gt; and &lt;strong&gt;3.3× relative throughput&lt;/strong&gt; as its core message (source: §Intro/§2.2/§2.3/§2.4/§2.5/§2.6/Fig.2).&lt;/p&gt;</description></item><item><title>[Paper Review] Radial Attention: O(n log n) Sparse Attention with Energy Decay for Long Video Generation</title><link>https://jaehun.me/en/posts/paper-review-radial-attention-on-log-n-sparse-attention-with-energy-decay-for-long-video-generation/</link><pubDate>Mon, 15 Dec 2025 00:00:00 +0900</pubDate><guid>https://jaehun.me/en/posts/paper-review-radial-attention-on-log-n-sparse-attention-with-energy-decay-for-long-video-generation/</guid><description>&lt;p&gt;&lt;a&#10; href="https://arxiv.org/abs/2506.19852v1"target="_blank"&#10; class="inline-flex items-center gap-1"&#10; &gt;Paper&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="radial-attention-on-log-n-sparse-attention-with-energy-decay--generating-long-videos-cheaply"&gt;Radial Attention: O(n log n) Sparse Attention with Energy Decay — Generating &amp;ldquo;Long Videos&amp;rdquo; Cheaply&lt;a href="#radial-attention-on-log-n-sparse-attention-with-energy-decay--generating-long-videos-cheaply" class="heading-anchor" aria-label="Link to this section"&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="one-line-summary-tldr"&gt;One-Line Summary (TL;DR)&lt;a href="#one-line-summary-tldr" class="heading-anchor" aria-label="Link to this section"&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;Based on the observation that post-softmax attention energy decays &lt;strong&gt;exponentially&lt;/strong&gt; with distance (in time/space), the authors design a &lt;strong&gt;static mask&lt;/strong&gt; that decays compute density in the same way, substantially cutting the training/inference cost of long-video generation. (source: §4.1–§4.2, Eq.3–Eq.4)&lt;/p&gt;</description></item><item><title>[Paper Review] Pretraining Large Language Models with NVFP4</title><link>https://jaehun.me/en/posts/paper-review-pretraining-large-language-models-with-nvfp4/</link><pubDate>Thu, 09 Oct 2025 00:00:00 +0900</pubDate><guid>https://jaehun.me/en/posts/paper-review-pretraining-large-language-models-with-nvfp4/</guid><description>&lt;p&gt;&lt;a&#10; href="https://arxiv.org/abs/2509.25149v1"target="_blank"&#10; class="inline-flex items-center gap-1"&#10; &gt;Paper&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="nvfp4-4-bit-pretraining-made-practical-12b-up-to-10t-tokens-effectively-on-par-with-fp8"&gt;NVFP4 4-bit Pretraining, Made Practical: 12B up to 10T Tokens, Effectively On Par with FP8&lt;a href="#nvfp4-4-bit-pretraining-made-practical-12b-up-to-10t-tokens-effectively-on-par-with-fp8" class="heading-anchor" aria-label="Link to this section"&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="#tldr" class="heading-anchor" aria-label="Link to this section"&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;Pretraining a 12B hybrid Mamba-Transformer on &lt;strong&gt;10T tokens&lt;/strong&gt; at &lt;strong&gt;NVFP4 (4-bit)&lt;/strong&gt; closely tracks &lt;strong&gt;FP8&lt;/strong&gt;, with a &lt;strong&gt;loss gap of &amp;lt;1% in the stable regime&lt;/strong&gt; and &lt;strong&gt;~1.5% in the final phase&lt;/strong&gt;, while downstream performance is also mostly on par (some math and multilingual tasks +0.9–+3.7pp). Matching &lt;strong&gt;MXFP4&amp;rsquo;s loss&lt;/strong&gt; requires &lt;strong&gt;+36% more tokens&lt;/strong&gt; (1.36T vs 1.0T), confirming &lt;strong&gt;NVFP4&amp;rsquo;s token-efficiency advantage&lt;/strong&gt;. (source: Fig.2, Tab.2, Fig.6)&lt;/p&gt;</description></item><item><title>[Paper Review] Inference-Time Hyper-Scaling with KV Cache Compression</title><link>https://jaehun.me/en/posts/paper-review-inference-time-hyper-scaling-with-kv-cache-compression/</link><pubDate>Tue, 29 Jul 2025 00:00:00 +0900</pubDate><guid>https://jaehun.me/en/posts/paper-review-inference-time-hyper-scaling-with-kv-cache-compression/</guid><description>&lt;p&gt;&lt;a&#10; href="https://arxiv.org/abs/2506.05345v1"target="_blank"&#10; class="inline-flex items-center gap-1"&#10; &gt;Link to Paper&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="dynamic-memory-sparsification-dms-making-llm-hyper-scaling-a-reality-with-8-kv-cache-compression"&gt;Dynamic Memory Sparsification (DMS): Making LLM Hyper-Scaling a Reality with 8× KV Cache Compression&lt;a href="#dynamic-memory-sparsification-dms-making-llm-hyper-scaling-a-reality-with-8-kv-cache-compression" class="heading-anchor" aria-label="Link to this section"&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="one-line-summary-tldr"&gt;One-Line Summary (TL;DR)&lt;a href="#one-line-summary-tldr" class="heading-anchor" aria-label="Link to this section"&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;DMS&lt;/strong&gt;, combining a lightweight re-fitting of just &lt;code&gt;1K&lt;/code&gt; steps with a &lt;strong&gt;delayed eviction strategy&lt;/strong&gt;, achieves up to &lt;strong&gt;8×&lt;/strong&gt; KV cache compression while paradoxically boosting performance, such as a &lt;strong&gt;+9.1 pt&lt;/strong&gt; gain on AIME 24 for Qwen-R1 32B. This allows for generating &lt;strong&gt;longer and more&lt;/strong&gt; tokens in real-time within the same compute and memory budget.&lt;/p&gt;</description></item></channel></rss>