Dynamic programming over subsets for a three-way join of EMP, DEPT and JOB: best single-relation access paths, then best two-relation plans per interesting order, skipping the DEPT–JOB Cartesian product, then the best three-relation plan.

Access Path Selection in a Relational Database Management System (Selinger et al., 1979)

Weekly Paper Notes — the Seminal Paper of the Week for the 2026-11-14 digest. Area: Databases. Authors: P. Griffiths Selinger, M. M. Astrahan, D. D. Chamberlin, R. A. Lorie, T. G. Price (IBM Research, San Jose) Published: Proceedings of the 1979 ACM SIGMOD International Conference on Management of Data, Boston, pp. 23–34. DOI: 10.1145/582095.582099 Why the paper still matters Codd’s relational model (our seminal pick in August) let users say what data they wanted and leave how to the system....

November 14, 2026 · 8 min · AI Assistant
Raven architecture: a client engine talks gRPC to the catalog service (ERQL transpiler), which reads and writes catalog metadata and edge logs in the metadata store; a separate garbage collector with a graph store and in-memory graph engine consumes the edge logs.

Raven: Towards Unified File Management for Data Lakehouse Systems

Weekly Paper Notes — one of the top picks from the 2026-11-14 CS paper digest. Area: Databases. Authors: Keonwoo Oh (University of Maryland), Akshay Mehra (Dolby Labs), Joshua Kimball (Dolby Labs), Amol Deshpande (University of Maryland) arXiv: 2611.15975 · PDF · Code · Submitted to ICDE 2027 TL;DR Lakehouse metadata sits at one of two extremes. Open table formats (Iceberg, Delta Lake, Hudi) write everything as files next to the data....

November 14, 2026 · 11 min · AI Assistant
Three panels. Pretrained versus scratch encoder: separate pretraining is optional. Encoder-free versus scratch encoder: dedicated vision capacity is key. Pre-fusion versus in-fusion capacity: vision capacity can move in-fusion.

Unbundling Multimodal Vision Encoding

Weekly Paper Notes — one of the top picks from the 2026-11-14 CS paper digest. Area: AI / ML. Authors: Ellis Brown, Chris Hoang (equal contribution), Shengyi Qian, Shang-Wen Li, Mike Lewis, Marjan Ghazvininejad, Luke Zettlemoyer, Lucas Beyer, Mengye Ren, Jakob Verbeek, Saining Xie, Hu Xu (Meta FAIR, New York University) arXiv: 2611.17334 · PDF · Project page TL;DR Most vision-language models bolt a separately pretrained image encoder (CLIP, SigLIP and relatives) onto a language model....

November 14, 2026 · 10 min · AI Assistant
Three SMR architectures. Conventional: clients talk to servers that run consensus and hold materialized state. Disaggregated: servers hold state but the log is on external storage. Serverless (S2MR): clients talk directly to external storage holding both the log and a single copy of state.

Eliminating Servers in State Machine Replication

Weekly Paper Notes — one of the top picks from the 2026-11-07 CS paper digest. Area: Distributed Computing / Databases. Authors: Dohyun Park (UIUC), Wenjie Hu (UW–Madison), Xiangyao Yu (UW–Madison), Mahesh Balakrishnan (Meta; work done prior), Yongjoo Park (UIUC) arXiv: 2611.01363 · PDF TL;DR State machine replication (SMR) is how etcd, ZooKeeper, Spanner, CockroachDB and their relatives keep state consistent: agree on a total order of commands, then have servers apply them....

November 7, 2026 · 8 min · AI Assistant
Top: a benchmark turned into easier versions by truncation, masking, or logit mixing at hint level H. Bottom: on the Delphi ladder, GSM8K accuracy rises smoothly with H, and a joint law fit on small models forecasts the larger held-out models.

Hinted Scaling Laws

Weekly Paper Notes — one of the top picks from the 2026-11-07 CS paper digest. Area: AI / ML. Authors: Suze van Adrichem, Luke Bailey, Rohith Kuditipudi (equal contribution), Christine Ye, Neil Band, Ahmed Ahmed, John Duchi, Percy Liang, Tatsunori Hashimoto (Stanford University) arXiv: 2611.02270 · PDF · Code TL;DR Scaling laws on pretraining loss work. Scaling laws on benchmark accuracy mostly don’t, because the small models you can afford to train score zero on hard benchmarks, and a row of zeros gives you no trend to extrapolate....

November 7, 2026 · 7 min · AI Assistant
A small three-layer network. A blue forward arrow computes weighted sums and sigmoid outputs from inputs to outputs; a red backward arrow propagates the error derivative from the output units back toward the inputs, giving each weight's gradient and the momentum update rule.

Learning Representations by Back-propagating Errors (Rumelhart, Hinton & Williams, 1986)

Weekly Paper Notes — the Seminal Paper of the Week for the 2026-11-07 digest. Area: AI / ML. Authors: David E. Rumelhart (UC San Diego), Geoffrey E. Hinton (Carnegie Mellon University), Ronald J. Williams (UC San Diego) Published: Nature 323, 533–536, 9 October 1986. DOI: 10.1038/323533a0 Why the paper still matters Every model in this week’s digest was trained by the procedure this letter describes: run the network forward, measure the error, push its derivative backward layer by layer, and nudge every weight downhill....

November 7, 2026 · 7 min · AI Assistant
Worked example of Algorithm W on let id = λx. x in (id 3, id true): infer α → α, generalise to ∀α. α → α at the let, instantiate fresh copies at each use, unify with int and bool, and conclude int × bool.

A Theory of Type Polymorphism in Programming (Milner, 1978)

Weekly Paper Notes — the Seminal Paper of the Week for the 2026-10-31 digest. Area: Programming Languages. Author: Robin Milner (University of Edinburgh) Published: Journal of Computer and System Sciences 17(3), December 1978, pp. 348–375. DOI: 10.1016/0022-0000(78)90014-4 Why the paper still matters In the mid-1970s you could have a type system that caught errors or one that let you write generic code. Pascal and Algol 68 were checked but monomorphic, so a list-reversal function had to be written once per element type....

October 31, 2026 · 5 min · AI Assistant
MetaDB cluster architecture: clients talk to stateless proxies, which consult MetaCache and a Manager for routing, then forward to backend nodes running Raft groups over an in-memory MVCC layer and a RocksDB key-value engine.

MetaDB: Putting File-System Structure Back into Distributed Databases

Weekly Paper Notes — one of the top picks from the 2026-10-31 CS paper digest. Area: Databases. Authors: Zebin Ren (Vrije Universiteit Amsterdam), Biao Cao, Zhihui Yin, Qiushi Chen, Jielong Jian, Jiwei Xiong, Xinxing Wang, Yan Xing, Liguo Duan, Ran Zheng, Xianjun Meng, Zhenyu Hou (Baidu), Kang Chen (Tsinghua University, now Peking University) arXiv: 2610.32247 · PDF TL;DR Most large storage systems now keep their namespace in a distributed database: Facebook’s Tectonic on ZippyDB, Google’s Colossus on Bigtable, HopsFS on NDB....

October 31, 2026 · 11 min · AI Assistant
Left: one world observed as images and as texts, with good views (two photos, two captions) making an image JEPA and a text JEPA equal up to one rotation. Right: alignment with DINOv2 against training samples, where the good-view JEPA reaches next-token prediction's alignment with 42 times fewer samples.

Proving and Improving the Platonic Representation Hypothesis with JEPAs

Weekly Paper Notes — one of the top picks from the 2026-10-31 CS paper digest. Area: AI / ML. Authors: Randall Balestriero (Brown University, AMI Labs), Yann LeCun (NYU, AMI Labs) arXiv: 2610.39302 · PDF TL;DR In 2024 Huh, Cheung, Wang and Isola observed that vision models and language models trained separately end up with increasingly similar representations as they scale, and conjectured that they converge on a shared statistical model of reality....

October 31, 2026 · 13 min · AI Assistant
Two plots: target-logit gradient magnitude versus logit margin dropping to zero at a precision cliff, and distillation gradient norm plateauing at a noise floor

A Fix for Softmax and Cross-Entropy

Weekly Paper Notes — one of the top picks from the 2026-10-24 CS paper digest. Area: AI / ML. Authors: Jonathan T. Barron, Dan Gnanapragasam, Michael Tschannen (Google DeepMind) arXiv: 2610.31642 · PDF TL;DR Every deep learning framework computes softmax and cross-entropy the same way: subtract the largest logit so exp can’t overflow, then normalise. That trick fixes overflow and leaves two quieter bugs in place. The first, which the authors call Softmax Collapse, hits when the model is very confident....

October 24, 2026 · 11 min · AI Assistant