<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>DeepSeek on Jaehun's Blog</title><link>https://jaehun.me/en/tags/deepseek/</link><description>Recent content in DeepSeek 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/deepseek/index.xml" rel="self" type="application/rss+xml"/><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>Inference-Time Scaling for Generalist Reward Modeling</title><link>https://jaehun.me/en/posts/inference-time-scaling-for-generalist-reward-modeling/</link><pubDate>Tue, 08 Jul 2025 00:00:00 +0900</pubDate><guid>https://jaehun.me/en/posts/inference-time-scaling-for-generalist-reward-modeling/</guid><description>&lt;p&gt;&lt;a&#10; href="https://arxiv.org/abs/2504.02495v2"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="inference-time-scaling-how-deepseek-grm-surpassed-giant-models"&gt;Inference-Time Scaling: How DeepSeek-GRM Surpassed Giant Models&lt;a href="#inference-time-scaling-how-deepseek-grm-surpassed-giant-models" 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;&amp;ldquo;27B model × 32 samples&amp;rdquo;&lt;/strong&gt;—With only a Generative Reward Model (GRM) and k-Vote summation, it records &lt;strong&gt;72.8% overall accuracy&lt;/strong&gt;, higher than GPT-4o and Nemotron-340B, presenting &lt;em&gt;inference compute instead of model size&lt;/em&gt; as a new scaling axis.&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><item><title>Native Sparse Attention: Hardware-Aligned and Natively Trainable Sparse Attention</title><link>https://jaehun.me/en/posts/native-sparse-attention-hardware-aligned-and-natively-trainable-sparse-attention/</link><pubDate>Mon, 07 Jul 2025 00:00:00 +0900</pubDate><guid>https://jaehun.me/en/posts/native-sparse-attention-hardware-aligned-and-natively-trainable-sparse-attention/</guid><description>&lt;p&gt;&lt;a&#10; href="https://arxiv.org/abs/2502.11089v2"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="native-sparse-attention-nsa--11-faster-even-at-64k-tokens-accuracy-intact"&gt;Native Sparse Attention (NSA) — 11× faster even at 64k tokens, accuracy intact&lt;a href="#native-sparse-attention-nsa--11-faster-even-at-64k-tokens-accuracy-intact" 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;NSA combines a three-branch sparse attention — “compress → select → slide” — with a GQA/MQA-friendly kernel to make decoding 11.6× faster and training up to 9× faster at 64k context, while improving average performance over Full Attention.&lt;/strong&gt;&lt;/p&gt;</description></item><item><title>Janus-Pro: Unified Multimodal Understanding and Generation with Data and Model Scaling</title><link>https://jaehun.me/en/posts/janus-pro-unifiedmultimodalunderstanding-and-generation-with-data-and-model-scaling/</link><pubDate>Sun, 06 Jul 2025 00:00:00 +0900</pubDate><guid>https://jaehun.me/en/posts/janus-pro-unifiedmultimodalunderstanding-and-generation-with-data-and-model-scaling/</guid><description>&lt;p&gt;&lt;a&#10; href="https://arxiv.org/abs/2501.17811v1"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="janus-pro-7b-dual-encoder-multimodal-llm-that-outsmarts-bigger-models"&gt;&lt;strong&gt;Janus-Pro 7B: Dual-Encoder Multimodal LLM That Outsmarts Bigger Models&lt;/strong&gt;&lt;a href="#janus-pro-7b-dual-encoder-multimodal-llm-that-outsmarts-bigger-models" 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;By &lt;em&gt;fully separating the SigLIP understanding encoder from the VQ generation encoder&lt;/em&gt; and attaching them to a &lt;strong&gt;7 B-parameter LLM&lt;/strong&gt; with a &amp;lsquo;Dual-Encoder + Adapter&amp;rsquo; design, it becomes the first case to &lt;strong&gt;beat a 13 B unified model (TokenFlow-XL) on both understanding and generation at the same time&lt;/strong&gt;. – &lt;strong&gt;MMBench 79.2 (+10.3 pt) / GenEval 0.80 (+45 %)&lt;/strong&gt;&lt;/p&gt;</description></item><item><title>DeepSeek-V3 Technical Report</title><link>https://jaehun.me/en/posts/deepseek-v3-technical-report/</link><pubDate>Sat, 05 Jul 2025 00:00:00 +0900</pubDate><guid>https://jaehun.me/en/posts/deepseek-v3-technical-report/</guid><description>&lt;p&gt;&lt;a&#10; href="https://arxiv.org/abs/2412.19437v2"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="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;DeepSeek-V3 is an open-source SOTA that combines &lt;code&gt;Aux-loss-free Load-Balancing Bias&lt;/code&gt;, FP8 mixed-precision training, and Multi-Token Prediction in a 671B-parameter MoE LLM to reach parity with (or surpass) a dense 405B model at less than half the GPU time and cost.&lt;/strong&gt;&lt;/p&gt;</description></item></channel></rss>