<?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>SwiGLU on Cognaptus</title>
    <link>https://cognaptus.com/tags/swiglu/</link>
    <description>Recent content in SwiGLU on Cognaptus</description>
    <generator>Hugo -- 0.145.0</generator>
    <language>en-us</language>
    <lastBuildDate>Sat, 22 Aug 2026 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://cognaptus.com/tags/swiglu/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Approximate the Ranking, Not the Answer: Prox’s Two-Stage Bet on Sparse LLM Inference</title>
      <link>https://cognaptus.com/blog/2026-08-22-approximate-the-ranking-not-the-answer-proxs-twostage-bet-on-sparse-llm-inference/</link>
      <pubDate>Sat, 22 Aug 2026 00:00:00 +0000</pubDate>
      <guid>https://cognaptus.com/blog/2026-08-22-approximate-the-ranking-not-the-answer-proxs-twostage-bet-on-sparse-llm-inference/</guid>
      <description>Prox shows that sparse LLM inference can use cheap approximation to decide what deserves exact computation, rather than approximating the final values themselves.</description>
    </item>
  </channel>
</rss>
