
  <rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
    <channel>
      <title>Chaos and Order</title>
      <link>https://www.youngju.dev/blog</link>
      <description>천천히 올바르게. AI Researcher &amp; DevOps Engineer Youngju&#39;s blog. GPU/CUDA, LLM, MLOps, Kubernetes AI workloads, and data engineering — plus mindset essays on confidence, routines, health, and sport psychology.</description>
      <language>ko</language>
      <managingEditor>fjvbn2003@gmail.com (Youngju Kim)</managingEditor>
      <webMaster>fjvbn2003@gmail.com (Youngju Kim)</webMaster>
      <lastBuildDate>Sun, 09 Aug 2026 00:00:00 GMT</lastBuildDate>
      <atom:link href="https://www.youngju.dev/tags/open-models/feed.xml" rel="self" type="application/rss+xml"/>
      
  <item>
    <guid>https://www.youngju.dev/blog/llm/2026-08-09-small-model-narrow-task-breakeven.en</guid>
    <title>The Claim of 100x Cheaper Is True Only When the Task Was Narrowed — Verification and Break-Even</title>
    <link>https://www.youngju.dev/blog/llm/2026-08-09-small-model-narrow-task-breakeven.en</link>
    <description>A case study published in August 2026 reports that a 4-billion-parameter-class open model, post-trained with reinforcement learning, matched frontier models on a retrieval task while cutting per-request cost by an order of magnitude. Rather than relaying that claim, this post verifies it. It separates the numbers that can actually be confirmed in the original from the numbers that cannot, lays out the conditions under which the result holds only for a narrow task, and includes code you can run yourself to compute the break-even point where post-training beats routing.</description>
    <pubDate>Sun, 09 Aug 2026 00:00:00 GMT</pubDate>
    <author>fjvbn2003@gmail.com (Youngju Kim)</author>
    <category>llm</category><category>cost</category><category>fine-tuning</category><category>retrieval</category><category>open-models</category>
  </item>

  <item>
    <guid>https://www.youngju.dev/blog/llm/2026-08-09-small-model-narrow-task-breakeven.ja</guid>
    <title>100倍安いという主張は課題を狭めたときにだけ真です — 検証と損益分岐</title>
    <link>https://www.youngju.dev/blog/llm/2026-08-09-small-model-narrow-task-breakeven.ja</link>
    <description>2026年8月に公開されたある事例記事は、40億パラメータ級のオープンモデルを強化学習で後学習し、検索課題でフロンティアモデルと肩を並べながらリクエストあたりのコストを桁単位で下げたと述べます。この記事はその主張を紹介するのではなく検証します。原文で実際に確認できる数字と確認できない数字を区別し、狭い課題でだけ成立する条件が何かを整理し、後学習がルーティングより有利になる損益分岐を自分で計算できるコードを付けました。</description>
    <pubDate>Sun, 09 Aug 2026 00:00:00 GMT</pubDate>
    <author>fjvbn2003@gmail.com (Youngju Kim)</author>
    <category>llm</category><category>cost</category><category>fine-tuning</category><category>retrieval</category><category>open-models</category>
  </item>

  <item>
    <guid>https://www.youngju.dev/blog/llm/2026-08-09-small-model-narrow-task-breakeven</guid>
    <title>100배 싸다는 주장은 과제를 좁혔을 때만 참입니다 — 검증과 손익분기</title>
    <link>https://www.youngju.dev/blog/llm/2026-08-09-small-model-narrow-task-breakeven</link>
    <description>2026년 8월에 공개된 한 사례 글은 40억 파라미터급 오픈 모델을 강화학습으로 후학습해 검색 과제에서 프론티어 모델과 맞먹으면서 요청당 비용은 자릿수 단위로 낮췄다고 밝힙니다. 이 글은 그 주장을 소개하는 대신 검증합니다. 원문에서 실제로 확인되는 숫자와 확인되지 않는 숫자를 구분하고, 좁은 과제에서만 성립하는 조건이 무엇인지 정리하며, 후학습이 라우팅보다 유리해지는 손익분기를 직접 계산할 수 있는 코드를 붙였습니다.</description>
    <pubDate>Sun, 09 Aug 2026 00:00:00 GMT</pubDate>
    <author>fjvbn2003@gmail.com (Youngju Kim)</author>
    <category>llm</category><category>cost</category><category>fine-tuning</category><category>retrieval</category><category>open-models</category>
  </item>

  <item>
    <guid>https://www.youngju.dev/blog/llm/2026-08-09-small-model-narrow-task-breakeven.zh</guid>
    <title>「便宜 100 倍」这个主张，只有在任务被收窄时才成立 —— 验证与盈亏平衡</title>
    <link>https://www.youngju.dev/blog/llm/2026-08-09-small-model-narrow-task-breakeven.zh</link>
    <description>2026 年 8 月公开的一篇案例文章称，他们把一个 40 亿参数级的开源模型用强化学习做了后训练，在检索任务上与前沿模型打平，而单次请求成本降了一个数量级。本文不是转述这个主张，而是去验证它：区分原文里真正能确认的数字与确认不了的数字，梳理这套做法只在窄任务上成立的条件，并附上一段可以自己算「后训练何时优于路由」盈亏平衡点的代码。</description>
    <pubDate>Sun, 09 Aug 2026 00:00:00 GMT</pubDate>
    <author>fjvbn2003@gmail.com (Youngju Kim)</author>
    <category>llm</category><category>cost</category><category>fine-tuning</category><category>retrieval</category><category>open-models</category>
  </item>

    </channel>
  </rss>
