factual

Paging problem: worst-case online bounds far from laptop performance

Moitra says that the best-known online algorithms for cache paging have tight worst-case bounds that are far from the best offline strategy, yet real laptops achieve very few cache misses, which shows the gap between worst-case theory and realistic request sequences.

factualpending

Speaker

Ankur Moitra

Evidence Quote

“that just doesn't compete with what your laptop is able to do right now”

Source

Lex Fridman Podcast #503 - AI Crisis in Math— Lex Fridman Podcast
Created: 11/17/2026, 6:25:32 AM

Your notes

Loading notes...