<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Model Compression on Nalar</title>
    <link>https://nalar.dev/tags/model-compression/</link>
    <description>Recent content in Model Compression on Nalar</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Mon, 07 Sep 2026 00:00:00 +0700</lastBuildDate>
    <atom:link href="https://nalar.dev/tags/model-compression/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Compress Neural Network Layers with Low-Rank Factorization</title>
      <link>https://nalar.dev/compress-neural-network-layers-with-low-rank-factorization/</link>
      <pubDate>Mon, 07 Sep 2026 00:00:00 +0700</pubDate>
      <guid>https://nalar.dev/compress-neural-network-layers-with-low-rank-factorization/</guid>
      <description>&lt;p&gt;Large neural networks spend much of their memory and computation multiplying activations by weight matrices. Some of those matrices contain more independent structure than the model actually needs for a particular deployment. If so, we can approximate one large matrix with two smaller matrices and reduce the number of stored parameters and multiply-add operations.&lt;/p&gt;&#xA;&lt;p&gt;This technique is called &lt;strong&gt;low-rank factorization&lt;/strong&gt;. The central idea is simple, but using it well requires more than choosing a smaller number. Compression changes the weights, approximation error can accumulate through a network, and fewer arithmetic operations do not guarantee lower wall-clock latency on every device.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
