<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Reinforcement Learning on Jaehun's Blog</title><link>https://jaehun.me/en/tags/reinforcement-learning/</link><description>Recent content in Reinforcement Learning on Jaehun's Blog</description><generator>Hugo</generator><language>en-US</language><lastBuildDate>Thu, 10 Sep 2026 09:30:02 +0900</lastBuildDate><atom:link href="https://jaehun.me/en/tags/reinforcement-learning/index.xml" rel="self" type="application/rss+xml"/><item><title>Miles v0.1: Production-Level Post-Training</title><link>https://jaehun.me/en/posts/miles-v0.1-production-level-post-training/</link><pubDate>Thu, 10 Sep 2026 00:00:00 +0900</pubDate><guid>https://jaehun.me/en/posts/miles-v0.1-production-level-post-training/</guid><description>&lt;p&gt;&lt;a&#10; href="https://arxiv.org/abs/2609.08368v1"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="miles-v01-a-verified-clean-and-scalable-full-stack-system-for-frontier-rl-post-training"&gt;Miles v0.1: A &amp;ldquo;verified, clean, and scalable&amp;rdquo; full-stack system for frontier RL post-training&lt;a href="#miles-v01-a-verified-clean-and-scalable-full-stack-system-for-frontier-rl-post-training" 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;TL;DR&lt;/strong&gt;: Miles is a full-stack RL post-training framework that resolves the &lt;strong&gt;train-rollout mismatch&lt;/strong&gt; at the system level — the mismatch that arises when rollout generation and training run on different engines, kernels, and precisions. It unifies SGLang-based rollout, a Megatron-LM/FSDP trainer, and three weight-synchronization transports (broadcast/P2P/disk-delta), while also guaranteeing token exactness (TITO) and expert-routing replay (R3). As an end-to-end case study, it trains &lt;strong&gt;GLM-5.2 744B-A40B&lt;/strong&gt; on 64 GB300 GPUs with fully asynchronous agentic RL, achieving a &lt;strong&gt;median step time of 263 seconds&lt;/strong&gt; (source: §9.2, Fig. 5).&lt;/p&gt;</description></item><item><title>Online Draft Co-Training for Speculative Decoding in Large-Scale, Long-Context RL Post-Training</title><link>https://jaehun.me/en/posts/online-draft-co-training-for-speculative-decoding-in-large-scale-long-context-rl-post-training/</link><pubDate>Thu, 10 Sep 2026 00:00:00 +0900</pubDate><guid>https://jaehun.me/en/posts/online-draft-co-training-for-speculative-decoding-in-large-scale-long-context-rl-post-training/</guid><description>&lt;p&gt;&lt;a&#10; href="https://arxiv.org/abs/2609.07108v1"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="two-designs-that-make-speculative-decoding-practical-for-large-scale-long-context-rl-post-training"&gt;Two Designs That Make Speculative Decoding Practical for Large-Scale, Long-Context RL Post-Training&lt;a href="#two-designs-that-make-speculative-decoding-practical-for-large-scale-long-context-rl-post-training" 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;TL;DR&lt;/strong&gt; : Rollout generation dominates the wall-clock time of RL post-training. This work accelerates it with speculative decoding, and adds &lt;strong&gt;online draft co-training&lt;/strong&gt; so the draft does not lag behind as the policy evolves. However, existing systems fail to handle the &lt;strong&gt;branch attention&lt;/strong&gt; used by advanced drafts (unsupported by context parallelism) and &lt;strong&gt;target features scattered across stages&lt;/strong&gt; (a pipeline parallelism problem). This paper proposes (1) a CP technique that decomposes branch attention into a causal main-sequence component and a rank-local branch and merges them, and (2) &lt;strong&gt;TapChannel&lt;/strong&gt;, which delivers target features outside the pipeline schedule, achieving &lt;strong&gt;1.16–1.88×&lt;/strong&gt; end-to-end speedup from 8B to 122B (source: §3.3, Tab. 1).&lt;/p&gt;</description></item></channel></rss>