<?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-10-31 on Sparse Notes</title>
    <link>https://sparsenotes.com/series/weekly-papers-2026-10-31/</link>
    <description>Recent content in weekly-papers-2026-10-31 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, 31 Oct 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://sparsenotes.com/series/weekly-papers-2026-10-31/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>A Theory of Type Polymorphism in Programming (Milner, 1978)</title>
      <link>https://sparsenotes.com/posts/2026/10/papers/milner-theory-of-type-polymorphism-1978/</link>
      <pubDate>Sat, 31 Oct 2026 00:00:00 +0000</pubDate>
      
      <guid>https://sparsenotes.com/posts/2026/10/papers/milner-theory-of-type-polymorphism-1978/</guid>
      <description>Seminal paper of the week: Robin Milner gave ML a type system in which programmers write no type annotations, the compiler infers the most general type for every expression, and well-typed programs provably cannot go wrong. Algorithm W and let-polymorphism are still the core of OCaml, Haskell and F#, and the template for inference in Rust and Swift.</description>
    </item>
    
    <item>
      <title>MetaDB: Putting File-System Structure Back into Distributed Databases</title>
      <link>https://sparsenotes.com/posts/2026/10/papers/metadb-file-system-structure-distributed-database/</link>
      <pubDate>Sat, 31 Oct 2026 00:00:00 +0000</pubDate>
      
      <guid>https://sparsenotes.com/posts/2026/10/papers/metadb-file-system-structure-distributed-database/</guid>
      <description>Baidu&amp;#39;s metadata database for its exabyte-scale object and file storage. Sharding on directory boundaries, asynchronous aggregation of hot parent-directory attributes, and in-memory MVCC with locality-aware compaction give 2.2–4.1× the throughput of their previous TiDB-style database on half the machines, across 1,000&#43; nodes and tens of trillions of records.</description>
    </item>
    
    <item>
      <title>Proving and Improving the Platonic Representation Hypothesis with JEPAs</title>
      <link>https://sparsenotes.com/posts/2026/10/papers/platonic-representation-theorem-jepa/</link>
      <pubDate>Sat, 31 Oct 2026 00:00:00 +0000</pubDate>
      
      <guid>https://sparsenotes.com/posts/2026/10/papers/platonic-representation-theorem-jepa/</guid>
      <description>Balestriero and LeCun prove that JEPAs trained separately on different modalities learn the same representation up to one rotation, provided their positive pairs are two observations of the same scene. Next-token prediction turns out to be a JEPA with bad views, and a 109M-parameter text JEPA aligns with vision encoders better than 72B language models.</description>
    </item>
    
    <item>
      <title>Weekly CS Paper Digest — 24 – 30 October 2026</title>
      <link>https://sparsenotes.com/posts/2026/10/papers/</link>
      <pubDate>Sat, 31 Oct 2026 00:00:00 +0000</pubDate>
      
      <guid>https://sparsenotes.com/posts/2026/10/papers/</guid>
      <description>This week&amp;#39;s picks: Balestriero and LeCun&amp;#39;s proof that JEPAs with the right positive pairs learn the same representation across modalities; Baidu&amp;#39;s MetaDB, the metadata database under its exabyte-scale storage; and Milner&amp;#39;s 1978 type polymorphism paper as the seminal pick.</description>
    </item>
    
  </channel>
</rss>
