<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
     xmlns:atom="http://www.w3.org/2005/Atom"
     xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>Notes by Mouhssine Rifaki</title>
    <link>https://mouhssine.rifaki.me/notes/</link>
    <atom:link href="https://mouhssine.rifaki.me/feed.xml" rel="self" type="application/rss+xml"/>
    <description>Essays on deep learning theory, reinforcement learning, and mathematical statistics.</description>
    <language>en-us</language>
    <copyright>Copyright 2024-2026 Mouhssine Rifaki</copyright>
    <lastBuildDate>Wed, 22 Apr 2026 12:00:00 +0000</lastBuildDate>
    <pubDate>Wed, 22 Apr 2026 12:00:00 +0000</pubDate>
    <ttl>1440</ttl>
    <item>
      <title>Score matching and diffusion</title>
      <link>https://mouhssine.rifaki.me/notes/diffusion-models/</link>
      <guid isPermaLink="true">https://mouhssine.rifaki.me/notes/diffusion-models/</guid>
      <pubDate>Wed, 22 Apr 2026 12:00:00 +0000</pubDate>
      <dc:creator>Mouhssine Rifaki</dc:creator>
      <description>The DDPM forward chain has a clean dual under score matching, and once the two are placed side by side they are not separate ideas. The score function…</description>
      <category>generative models</category>
      <category>theory</category>
    </item>
    <item>
      <title>Adversarial examples</title>
      <link>https://mouhssine.rifaki.me/notes/adversarial-examples/</link>
      <guid isPermaLink="true">https://mouhssine.rifaki.me/notes/adversarial-examples/</guid>
      <pubDate>Sat, 07 Feb 2026 12:00:00 +0000</pubDate>
      <dc:creator>Mouhssine Rifaki</dc:creator>
      <description>Adversarial examples initially seemed an oddity. Szegedy et al. [1] demonstrated that a minuscule perturbation, meaningless to human eyes, could confidently flip a neural net&#x27;s prediction. My first…</description>
      <category>robustness</category>
      <category>theory</category>
    </item>
    <item>
      <title>Mode connectivity</title>
      <link>https://mouhssine.rifaki.me/notes/mode-connectivity/</link>
      <guid isPermaLink="true">https://mouhssine.rifaki.me/notes/mode-connectivity/</guid>
      <pubDate>Tue, 04 Nov 2025 12:00:00 +0000</pubDate>
      <dc:creator>Mouhssine Rifaki</dc:creator>
      <description>The old picture of the loss surface as many isolated basins, one per initialization, has not held up. Freeman and Bruna [6] suggested early on that low-loss level sets stay connected. Garipov et al. [1]…</description>
      <category>optimization</category>
      <category>generalization</category>
    </item>
    <item>
      <title>The neural tangent kernel</title>
      <link>https://mouhssine.rifaki.me/notes/neural-tangent-kernel/</link>
      <guid isPermaLink="true">https://mouhssine.rifaki.me/notes/neural-tangent-kernel/</guid>
      <pubDate>Sat, 09 Aug 2025 12:00:00 +0000</pubDate>
      <dc:creator>Mouhssine Rifaki</dc:creator>
      <description>The neural tangent kernel was one of the few deep-learning theory ideas that were useful before they became a concept. It doesn&#x27;t solve generalization, but it makes a very stubborn object analyzable.…</description>
      <category>theory</category>
      <category>optimization</category>
    </item>
    <item>
      <title>The implicit-bias program</title>
      <link>https://mouhssine.rifaki.me/notes/implicit-bias/</link>
      <guid isPermaLink="true">https://mouhssine.rifaki.me/notes/implicit-bias/</guid>
      <pubDate>Wed, 14 May 2025 12:00:00 +0000</pubDate>
      <dc:creator>Mouhssine Rifaki</dc:creator>
      <description>Why does training a model without an explicit regularizer, with the loss driven nearly to zero, still produce a solution that generalizes? The classical answer is that the objective has to carry the…</description>
      <category>optimization</category>
      <category>generalization</category>
    </item>
    <item>
      <title>The edge of stability</title>
      <link>https://mouhssine.rifaki.me/notes/edge-of-stability/</link>
      <guid isPermaLink="true">https://mouhssine.rifaki.me/notes/edge-of-stability/</guid>
      <pubDate>Thu, 27 Feb 2025 12:00:00 +0000</pubDate>
      <dc:creator>Mouhssine Rifaki</dc:creator>
      <description>Cohen et al. [1] observed that gradient descent on neural networks spends most of training in a regime where the top Hessian eigenvalue…</description>
      <category>optimization</category>
      <category>theory</category>
    </item>
    <item>
      <title>Kaplan, Chinchilla, and broken laws</title>
      <link>https://mouhssine.rifaki.me/notes/neural-scaling-laws/</link>
      <guid isPermaLink="true">https://mouhssine.rifaki.me/notes/neural-scaling-laws/</guid>
      <pubDate>Mon, 06 Jan 2025 12:00:00 +0000</pubDate>
      <dc:creator>Mouhssine Rifaki</dc:creator>
      <description>That paper shaped how labs designed pre-training experiments for the next two years, and the eventual &quot;Chinchilla&quot; effort grew out of trying to reproduce and extend its recommendations. It also turned out…</description>
      <category>scaling</category>
      <category>generalization</category>
    </item>
    <item>
      <title>Lottery ticket hypothesis</title>
      <link>https://mouhssine.rifaki.me/notes/lottery-tickets/</link>
      <guid isPermaLink="true">https://mouhssine.rifaki.me/notes/lottery-tickets/</guid>
      <pubDate>Sat, 16 Nov 2024 12:00:00 +0000</pubDate>
      <dc:creator>Mouhssine Rifaki</dc:creator>
      <description>The lottery-ticket hypothesis of Frankle and Carbin [1] proposes that a randomly initialized dense network already contains a much sparser subnetwork (the &quot;winning ticket&quot;) which, trained in isolation…</description>
      <category>generalization</category>
      <category>optimization</category>
    </item>
    <item>
      <title>Double descent</title>
      <link>https://mouhssine.rifaki.me/notes/double-descent/</link>
      <guid isPermaLink="true">https://mouhssine.rifaki.me/notes/double-descent/</guid>
      <pubDate>Sun, 25 Aug 2024 12:00:00 +0000</pubDate>
      <dc:creator>Mouhssine Rifaki</dc:creator>
      <description>Nakkiran et al. [2] made the picture concrete by showing that the W-shape appears in three different axes: model size…</description>
      <category>generalization</category>
      <category>scaling</category>
    </item>
    <item>
      <title>Reading Tishby&#x27;s information bottleneck</title>
      <link>https://mouhssine.rifaki.me/notes/information-bottleneck/</link>
      <guid isPermaLink="true">https://mouhssine.rifaki.me/notes/information-bottleneck/</guid>
      <pubDate>Tue, 09 Jul 2024 12:00:00 +0000</pubDate>
      <dc:creator>Mouhssine Rifaki</dc:creator>
      <description>Tishby and Zaslavsky&#x27;s 2015 paper was, until fairly recently, one of the most-cited papers in deep-learning theory. They described training as two distinct phases. In the first, the &quot;fitting&quot; phase, the…</description>
      <category>theory</category>
      <category>generalization</category>
    </item>
    <item>
      <title>On flat minima</title>
      <link>https://mouhssine.rifaki.me/notes/flat-minima/</link>
      <guid isPermaLink="true">https://mouhssine.rifaki.me/notes/flat-minima/</guid>
      <pubDate>Sun, 07 Apr 2024 12:00:00 +0000</pubDate>
      <dc:creator>Mouhssine Rifaki</dc:creator>
      <description>Whether flat minima generalize better than sharp ones has been an open question for about seven years. The debate seems to close every year and reopen a year later. Most readers entering the field…</description>
      <category>optimization</category>
      <category>generalization</category>
    </item>
    <item>
      <title>Four explanations for Grokking</title>
      <link>https://mouhssine.rifaki.me/notes/grokking/</link>
      <guid isPermaLink="true">https://mouhssine.rifaki.me/notes/grokking/</guid>
      <pubDate>Sat, 24 Feb 2024 12:00:00 +0000</pubDate>
      <dc:creator>Mouhssine Rifaki</dc:creator>
      <description>The network has generalized but long after it has already fit the data. The paper is Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets by Power et al. [1]. I came across it maybe a…</description>
      <category>generalization</category>
      <category>optimization</category>
    </item>
  </channel>
</rss>
