<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>Algorithm-Modelization on Cognaptus</title>
    <link>https://cognaptus.com/tags/algorithm-modelization/</link>
    <description>Recent content in Algorithm-Modelization on Cognaptus</description>
    <generator>Hugo -- 0.145.0</generator>
    <language>en-us</language>
    <lastBuildDate>Fri, 20 Nov 2026 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://cognaptus.com/tags/algorithm-modelization/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>When an Optimizer Outgrows Its Teachers</title>
      <link>https://cognaptus.com/blog/2026-11-20-when-an-optimizer-outgrows-its-teachers/</link>
      <pubDate>Fri, 20 Nov 2026 00:00:00 +0000</pubDate>
      <guid>https://cognaptus.com/blog/2026-11-20-when-an-optimizer-outgrows-its-teachers/</guid>
      <description>A2M shows how learning from historical optimization runs, followed by performance-driven refinement, can produce a stronger search policy than its source algorithms.</description>
    </item>
  </channel>
</rss>
