<?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 CS Paper Digest — 7 – 13 November 2026 on Sparse Notes</title>
    <link>https://sparsenotes.com/posts/2026/11/papers/</link>
    <description>Recent content in Weekly CS Paper Digest — 7 – 13 November 2026 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, 14 Nov 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://sparsenotes.com/posts/2026/11/papers/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Access Path Selection in a Relational Database Management System (Selinger et al., 1979)</title>
      <link>https://sparsenotes.com/posts/2026/11/papers/access-path-selection-selinger-1979/</link>
      <pubDate>Sat, 14 Nov 2026 00:00:00 +0000</pubDate>
      
      <guid>https://sparsenotes.com/posts/2026/11/papers/access-path-selection-selinger-1979/</guid>
      <description>Seminal paper of the week: the System R optimizer paper that made SQL practical. Pat Selinger and colleagues combined a cost formula, selectivity estimates from catalog statistics, and dynamic programming over join orders with &amp;#39;interesting orders&amp;#39;. Nearly every relational optimizer since has used the same structure.</description>
    </item>
    
    <item>
      <title>Raven: Towards Unified File Management for Data Lakehouse Systems</title>
      <link>https://sparsenotes.com/posts/2026/11/papers/raven-unified-file-management-lakehouse/</link>
      <pubDate>Sat, 14 Nov 2026 00:00:00 +0000</pubDate>
      
      <guid>https://sparsenotes.com/posts/2026/11/papers/raven-unified-file-management-lakehouse/</guid>
      <description>University of Maryland and Dolby put a lakehouse catalog&amp;#39;s transactional metadata (which files are visible, who references them) in Postgres and leave the bulky per-file statistics in Iceberg or Delta Lake. That one split gives cheaper small commits, multi-table snapshot-isolation transactions, and reachability-based garbage collection that won&amp;#39;t delete files a clone or a running job still needs.</description>
    </item>
    
    <item>
      <title>Unbundling Multimodal Vision Encoding</title>
      <link>https://sparsenotes.com/posts/2026/11/papers/unbundling-multimodal-vision-encoding/</link>
      <pubDate>Sat, 14 Nov 2026 00:00:00 +0000</pubDate>
      
      <guid>https://sparsenotes.com/posts/2026/11/papers/unbundling-multimodal-vision-encoding/</guid>
      <description>Meta FAIR and NYU split the vision encoder into three separate design choices (a pretrained prior, dedicated vision parameters, and placement before fusion) and test each one with every model trained from scratch at matched compute. Only the dedicated parameters matter, and they work just as well as vision-only branches inside the first eight layers of the language model.</description>
    </item>
    
    <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>
