<?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>DEV Community: Alex Chen</title>
    <description>The latest articles on DEV Community by Alex Chen (@alexrchen).</description>
    <link>https://dev.to/alexrchen</link>
    <image>
      <url>https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.us-east-2.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F3994911%2F704b5100-cf3a-4408-92c7-7d8476aceda6.jpg</url>
      <title>DEV Community: Alex Chen</title>
      <link>https://dev.to/alexrchen</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/alexrchen"/>
    <language>en</language>
    <item>
      <title>SM-2 Is Not Enough: Where Classic Spaced Repetition Breaks Down</title>
      <dc:creator>Alex Chen</dc:creator>
      <pubDate>Fri, 24 Jul 2026 19:21:26 +0000</pubDate>
      <link>https://dev.to/alexrchen/sm-2-is-not-enough-where-classic-spaced-repetition-breaks-down-4hdd</link>
      <guid>https://dev.to/alexrchen/sm-2-is-not-enough-where-classic-spaced-repetition-breaks-down-4hdd</guid>
      <description>&lt;p&gt;SM-2 — the algorithm behind Anki and most spaced repetition tools — was published in 1987 and is remarkably durable. It is also wrong in specific, predictable ways that matter once your deck grows.&lt;/p&gt;

&lt;h2&gt;
  
  
  What SM-2 does
&lt;/h2&gt;

&lt;p&gt;Each card carries an ease factor, starting at 2.5. Grade a review 0-5; on success the interval multiplies by ease, on failure it resets:&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight python"&gt;&lt;code&gt;&lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="n"&gt;quality&lt;/span&gt; &lt;span class="o"&gt;&amp;gt;=&lt;/span&gt; &lt;span class="mi"&gt;3&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
    &lt;span class="n"&gt;interval&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt; &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="n"&gt;reps&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt; &lt;span class="k"&gt;else&lt;/span&gt; &lt;span class="mi"&gt;6&lt;/span&gt; &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="n"&gt;reps&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt; &lt;span class="k"&gt;else&lt;/span&gt; &lt;span class="nf"&gt;round&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;interval&lt;/span&gt; &lt;span class="o"&gt;*&lt;/span&gt; &lt;span class="n"&gt;ease&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
    &lt;span class="n"&gt;reps&lt;/span&gt; &lt;span class="o"&gt;+=&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt;
&lt;span class="k"&gt;else&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
    &lt;span class="n"&gt;reps&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;interval&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt;

&lt;span class="n"&gt;ease&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nf"&gt;max&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="mf"&gt;1.3&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;ease&lt;/span&gt; &lt;span class="o"&gt;+&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="mf"&gt;0.1&lt;/span&gt; &lt;span class="o"&gt;-&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="mi"&gt;5&lt;/span&gt;&lt;span class="o"&gt;-&lt;/span&gt;&lt;span class="n"&gt;quality&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="o"&gt;*&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="mf"&gt;0.08&lt;/span&gt; &lt;span class="o"&gt;+&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="mi"&gt;5&lt;/span&gt;&lt;span class="o"&gt;-&lt;/span&gt;&lt;span class="n"&gt;quality&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="o"&gt;*&lt;/span&gt; &lt;span class="mf"&gt;0.02&lt;/span&gt;&lt;span class="p"&gt;)))&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;Simple, no training data, works offline. Genuinely good engineering for 1987.&lt;/p&gt;

&lt;h2&gt;
  
  
  Failure 1: ease hell
&lt;/h2&gt;

&lt;p&gt;Every lapse decrements ease and it recovers slowly. A card you failed a few times early gets pinned near the 1.3 floor — permanently reviewed at short intervals even after you have learned it perfectly.&lt;/p&gt;

&lt;p&gt;The algorithm has no way to say "this card was hard &lt;em&gt;then&lt;/em&gt;, it is easy &lt;em&gt;now&lt;/em&gt;." Ease is a one-way ratchet in practice.&lt;/p&gt;

&lt;h2&gt;
  
  
  Failure 2: binary-ish grading carries too much weight
&lt;/h2&gt;

&lt;p&gt;The 0-5 scale collapses in practice to "got it / did not." But &lt;em&gt;how&lt;/em&gt; you recalled it matters — instant recall and dredging it up after eight seconds are very different memory states that produce identical grades.&lt;/p&gt;

&lt;p&gt;Response latency is a strong signal and SM-2 ignores it entirely.&lt;/p&gt;

&lt;h2&gt;
  
  
  Failure 3: cards are treated as independent
&lt;/h2&gt;

&lt;p&gt;They are not. Learning "kanji A" helps with "compound containing A." Confusable pairs interfere with each other. SM-2 schedules every card in isolation, so interference-prone cards get scheduled adjacently by chance, which is the worst possible arrangement.&lt;/p&gt;

&lt;h2&gt;
  
  
  Failure 4: no forgetting curve per user
&lt;/h2&gt;

&lt;p&gt;SM-2 assumes one exponential decay shape. Real retention varies by person, by material type, and by time of day. A fixed curve over-schedules some users and under-schedules others, and neither group can tell.&lt;/p&gt;

&lt;h2&gt;
  
  
  What modern approaches change
&lt;/h2&gt;

&lt;p&gt;FSRS models memory with three variables — difficulty, stability, retrievability — and fits parameters to &lt;em&gt;your&lt;/em&gt; review history. Concretely that means:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;Difficulty is not a one-way ratchet&lt;/li&gt;
&lt;li&gt;You can target an explicit retention rate (say 0.9) rather than accepting whatever falls out&lt;/li&gt;
&lt;li&gt;Latency and grade both inform the update&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;The cost is that it needs review history to fit, so cold-start is worse. Reasonable compromise: SM-2 defaults until you have a few hundred reviews, then refit.&lt;/p&gt;

&lt;p&gt;I work on this at &lt;a href="https://smartrecallai.com" rel="noopener noreferrer"&gt;SmartRecall&lt;/a&gt; — AI-generated cards with scheduling that does not pin everything to the ease floor.&lt;/p&gt;

&lt;h2&gt;
  
  
  Caveat
&lt;/h2&gt;

&lt;p&gt;For small decks with few lapses, SM-2 is fine and the added complexity buys nothing. These failures compound with deck size and time — they are invisible at 200 cards and painful at 5000.&lt;/p&gt;

</description>
      <category>algorithms</category>
      <category>python</category>
      <category>learning</category>
      <category>opensource</category>
    </item>
  </channel>
</rss>
