<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>LLM on Jaehun's Blog</title><link>https://jaehun.me/en/tags/llm/</link><description>Recent content in LLM on Jaehun's Blog</description><generator>Hugo</generator><language>en-US</language><lastBuildDate>Tue, 08 Sep 2026 03:26:23 +0000</lastBuildDate><atom:link href="https://jaehun.me/en/tags/llm/index.xml" rel="self" type="application/rss+xml"/><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>