ARC's "Outperforming Random Sampling" explained

·LessWrong··

Written as part of a FIG Fellowship under Eleni Angelou's supervision.I've spent some time with ARC's recent blog post, Competing with Random Sampling. I think it contains some interesting ideas. Unfortunately, those ideas are captured in formalisms that might intimidate anyone without the patience for some mathematics.So here's a more intuitive explainer. Special thanks to Wilson Wu for careful reviewing and nitpicks. All errors my own.MotivationI'm interested in this work because it attempts t...

Read full article →

Related Articles

Measuring the sloppiness of code
doppp · Hacker News · 14h ago
Google will buy half the electricity from one of Finland's nuclear power plants
lukaspetersson · Hacker News · 1d ago
HuggingFace: Security.txt
yarapavan · Hacker News · 13h ago
Rune is now open source
ernestrc · Hacker News · 12h ago
The Deathray: A simple way for an untrusted site to freeze a Mac
auberonedu · Hacker News · 1d ago