<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Chain-of-Thought on Jaehun's Blog</title><link>https://jaehun.me/en/tags/chain-of-thought/</link><description>Recent content in Chain-of-Thought on Jaehun's Blog</description><generator>Hugo</generator><language>en-US</language><lastBuildDate>Wed, 09 Sep 2026 13:09:39 +0000</lastBuildDate><atom:link href="https://jaehun.me/en/tags/chain-of-thought/index.xml" rel="self" type="application/rss+xml"/><item><title>Language Models Can Control Their Own Attention</title><link>https://jaehun.me/en/posts/language-models-can-control-their-own-attention/</link><pubDate>Mon, 07 Sep 2026 00:00:00 +0900</pubDate><guid>https://jaehun.me/en/posts/language-models-can-control-their-own-attention/</guid><description>&lt;p&gt;&lt;a&#10; href="https://arxiv.org/abs/2609.02737v1"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="language-models-control-their-own-attention-declarative-attention"&gt;Language Models Control Their Own Attention: Declarative Attention&lt;a href="#language-models-control-their-own-attention-declarative-attention" 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; — Existing sparse attention methods still paid $O(N)$ per decoding step by &lt;em&gt;approximating externally&lt;/em&gt; which tokens matter. This paper flips the direction: it lets the model &lt;strong&gt;&amp;ldquo;declare&amp;rdquo;&lt;/strong&gt; directly, inside Chain-of-Thought (CoT), &lt;strong&gt;where it will look&lt;/strong&gt;. The inference engine parses this declaration like a tool call and skips most KV cache reads. Without any training (zero-shot), Gemma-4-31B cuts decoding attention cost by &lt;strong&gt;52.0%&lt;/strong&gt; with only a &lt;strong&gt;1.27pp&lt;/strong&gt; accuracy drop (source: §1, §5.1).&lt;/p&gt;</description></item><item><title>[Paper Review] Qwen 3 Technical Report</title><link>https://jaehun.me/en/posts/paper-review-qwen-3-technical-report/</link><pubDate>Sat, 26 Jul 2025 00:00:00 +0900</pubDate><guid>https://jaehun.me/en/posts/paper-review-qwen-3-technical-report/</guid><description>&lt;p&gt;&lt;a&#10; href="https://arxiv.org/abs/2505.09388v1"target="_blank"&#10; class="inline-flex items-center gap-1"&#10; &gt;Paper Link&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="qwen-3-the-evolution-of-a-giant-moe-language-model-with-adjustable-reasoning-depth"&gt;Qwen 3: The Evolution of a Giant MoE Language Model with Adjustable Reasoning Depth&lt;a href="#qwen-3-the-evolution-of-a-giant-moe-language-model-with-adjustable-reasoning-depth" 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-in-one-line"&gt;TL;DR (in one line)&lt;a href="#tldr-in-one-line" 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;Qwen 3&lt;/strong&gt; couples a user-controllable &lt;em&gt;Thinking Budget&lt;/em&gt; with a 128-expert MoE backbone, achieving closed-source–level performance and multilingual breadth while activating only &lt;strong&gt;22 B&lt;/strong&gt; parameters out of a &lt;strong&gt;235 B&lt;/strong&gt; total.&lt;/p&gt;</description></item><item><title>DeepSeek-Prover-V2: Advancing Formal Mathematical Reasoning via Reinforcement Learning for Subgoal Decomposition</title><link>https://jaehun.me/en/posts/deepseek-prover-v2-advancing-formal-mathematical-reasoning-via-reinforcement-learning-for-subgoal-decomposition/</link><pubDate>Tue, 08 Jul 2025 00:00:00 +0900</pubDate><guid>https://jaehun.me/en/posts/deepseek-prover-v2-advancing-formal-mathematical-reasoning-via-reinforcement-learning-for-subgoal-decomposition/</guid><description>&lt;p&gt;&lt;a&#10; href="https://arxiv.org/abs/2504.21801v1"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="subgoal-curriculum--cot-consistency-deepseek-prover-v2-reshapes-automated-theorem-proving"&gt;Subgoal Curriculum + CoT Consistency: &lt;strong&gt;DeepSeek-Prover-V2&lt;/strong&gt; Reshapes Automated Theorem Proving&lt;a href="#subgoal-curriculum--cot-consistency-deepseek-prover-v2-reshapes-automated-theorem-proving" 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;&lt;em&gt;DeepSeek-Prover-V2&lt;/em&gt;, built on the principle of &lt;em&gt;&amp;ldquo;breaking a problem into small pieces and then matching them all the way through,&amp;rdquo;&lt;/em&gt; achieves a new SOTA on MiniF2F Pass@32 of &lt;strong&gt;82.4%&lt;/strong&gt; (671B) and &lt;strong&gt;75.6%&lt;/strong&gt; (7B) even in a small 7B model. The key is the combination of &lt;strong&gt;Subgoal-guided Curriculum&lt;/strong&gt; and &lt;strong&gt;Chain-of-Thought-Lean consistency reward (GRPO)&lt;/strong&gt;.&lt;/p&gt;</description></item><item><title>Code I/O: Condensing Reasoning Patterns via Code Input-Output Prediction</title><link>https://jaehun.me/en/posts/code-i/o-condensing-reasoning-patterns-via-code-input-output-prediction/</link><pubDate>Mon, 07 Jul 2025 00:00:00 +0900</pubDate><guid>https://jaehun.me/en/posts/code-i/o-condensing-reasoning-patterns-via-code-input-output-prediction/</guid><description>&lt;p&gt;&lt;a&#10; href="https://arxiv.org/abs/2502.07316v4"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="code-io-from-code-io--natural-language-cot-to-general-purpose-reasoning--lifting-7b-30b-llms-by-2-points-on-average-with-data-design-alone"&gt;CODE I/O: From Code I/O + Natural-Language CoT to General-Purpose Reasoning — Lifting 7B-30B LLMs by +2 Points on Average with Data Design Alone&lt;a href="#code-io-from-code-io--natural-language-cot-to-general-purpose-reasoning--lifting-7b-30b-llms-by-2-points-on-average-with-data-design-alone" 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;&lt;strong&gt;A single data pipeline of &amp;ldquo;code function → input/output prediction + structured Chain-of-Thought (CoT)&amp;rdquo; lets 3.5 M samples deliver larger and more balanced gains (+2.9 points) than 14 M-scale SOTA data.&lt;/strong&gt;&#10;By nailing verifiability, low cost, and diversity at once, &lt;strong&gt;CODE I/O&lt;/strong&gt; empirically demonstrates that &amp;ldquo;data quality &amp;gt; data quantity.&amp;rdquo;&lt;/p&gt;</description></item></channel></rss>