<?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-06-06 on Sparse Notes</title>
    <link>https://sparsenotes.com/series/weekly-papers-2026-06-06/</link>
    <description>Recent content in weekly-papers-2026-06-06 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, 06 Jun 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://sparsenotes.com/series/weekly-papers-2026-06-06/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Dynamo: Amazon&#39;s Highly Available Key-value Store (2007)</title>
      <link>https://sparsenotes.com/posts/2026/06/papers/2026-06-06-dynamo-amazon-key-value-store/</link>
      <pubDate>Sat, 06 Jun 2026 00:00:00 +0000</pubDate>
      
      <guid>https://sparsenotes.com/posts/2026/06/papers/2026-06-06-dynamo-amazon-key-value-store/</guid>
      <description>DeCandia et al.&amp;#39;s SOSP 2007 paper introduced a system that traded strong consistency for availability under partition — and codified the design vocabulary (consistent hashing, vector clocks, sloppy quorums, hinted handoff, read repair) that almost every modern NoSQL store still uses.</description>
    </item>
    
    <item>
      <title>Pretraining Recurrent Networks without Recurrence</title>
      <link>https://sparsenotes.com/posts/2026/06/papers/2026-06-06-smt-rnn-without-recurrence/</link>
      <pubDate>Sat, 06 Jun 2026 00:00:00 +0000</pubDate>
      
      <guid>https://sparsenotes.com/posts/2026/06/papers/2026-06-06-smt-rnn-without-recurrence/</guid>
      <description>Supervised Memory Training (SMT) sidesteps BPTT by reducing RNN training to one-step memory-transition labels supplied by a Transformer-based predictive-state encoder — recovering O(1) gradient paths and time-parallel training.</description>
    </item>
    
    <item>
      <title>Weekly CS Paper Digest — May 31 – Jun 6, 2026</title>
      <link>https://sparsenotes.com/posts/2026/06/papers/</link>
      <pubDate>Sat, 06 Jun 2026 00:00:00 +0000</pubDate>
      
      <guid>https://sparsenotes.com/posts/2026/06/papers/</guid>
      <description>Three blog-length entries from this week&amp;#39;s CS paper digest: the Dynamo paper as Seminal pick, plus top picks on training nonlinear RNNs without BPTT and on cross-layer sparse attention for long-context LLMs.</description>
    </item>
    
    <item>
      <title>You Only Index Once: Cross-Layer Sparse Attention with Shared Routing</title>
      <link>https://sparsenotes.com/posts/2026/06/papers/2026-06-06-clsa-cross-layer-sparse-attention/</link>
      <pubDate>Sat, 06 Jun 2026 00:00:00 +0000</pubDate>
      
      <guid>https://sparsenotes.com/posts/2026/06/papers/2026-06-06-clsa-cross-layer-sparse-attention/</guid>
      <description>CLSA shares the top-k routing index across cross-decoder layers in a YOCO-style KV-sharing architecture, amortizing token-sparse routing cost to deliver 7.6× decoding and 17.1× throughput at 128K context.</description>
    </item>
    
  </channel>
</rss>
