<?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>weekly-papers-2026-11-07 on Sparse Notes</title>
    <link>https://sparsenotes.com/series/weekly-papers-2026-11-07/</link>
    <description>Recent content in weekly-papers-2026-11-07 on Sparse Notes</description>
    <image>
      <url>https://sparsenotes.com/images/og-default.png</url>
      <link>https://sparsenotes.com/images/og-default.png</link>
    </image>
    <generator>Hugo -- gohugo.io</generator>
    <lastBuildDate>Sat, 07 Nov 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://sparsenotes.com/series/weekly-papers-2026-11-07/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Eliminating Servers in State Machine Replication</title>
      <link>https://sparsenotes.com/posts/2026/11/papers/eliminating-servers-state-machine-replication/</link>
      <pubDate>Sat, 07 Nov 2026 00:00:00 +0000</pubDate>
      
      <guid>https://sparsenotes.com/posts/2026/11/papers/eliminating-servers-state-machine-replication/</guid>
      <description>UIUC and Wisconsin, with shared-log veteran Mahesh Balakrishnan, push state machine replication one step past disaggregation: the command log and a single materialized copy of state both live on blob storage, and clients cooperate to compact it. Their AirDB key-value store survives every server failure by having no servers, cold-starts 10–45× faster than server-based SMR, and costs about 22× less at low load.</description>
    </item>
    
    <item>
      <title>Hinted Scaling Laws</title>
      <link>https://sparsenotes.com/posts/2026/11/papers/hinted-scaling-laws/</link>
      <pubDate>Sat, 07 Nov 2026 00:00:00 +0000</pubDate>
      
      <guid>https://sparsenotes.com/posts/2026/11/papers/hinted-scaling-laws/</guid>
      <description>Stanford&amp;#39;s fix for downstream scaling laws that break when small models score zero: show the model part of a reference solution, measure how accuracy rises with the hint, and fit one law over scale and hint level. Fit on models up to 10^20 FLOPs, it forecasts a 10^23 FLOP model&amp;#39;s GSM8K score within 3 points, and it cuts median forecast error from 21 points to 4.3.</description>
    </item>
    
    <item>
      <title>Learning Representations by Back-propagating Errors (Rumelhart, Hinton &amp; Williams, 1986)</title>
      <link>https://sparsenotes.com/posts/2026/11/papers/backpropagation-rumelhart-hinton-williams-1986/</link>
      <pubDate>Sat, 07 Nov 2026 00:00:00 +0000</pubDate>
      
      <guid>https://sparsenotes.com/posts/2026/11/papers/backpropagation-rumelhart-hinton-williams-1986/</guid>
      <description>Seminal paper of the week: a four-page Nature letter showed that gradient descent through hidden layers, computed with one forward and one backward pass, makes networks invent their own internal features. The 1986 paper didn&amp;#39;t invent the chain rule or reverse-mode differentiation, but it showed what they could do and set off the field that became deep learning.</description>
    </item>
    
  </channel>
</rss>
