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

US bans differential privacy in Census data
nl · Hacker News · 2h ago
Arch Linux Now Believes Malware Incident Under Control: More Than 1,500 Packages
qwertox · Hacker News · 4h ago
Twenty One Zero-Days in FFmpeg
redbell · Hacker News · 18h ago
CRISPR tech selectively shreds cancer cells, including "undruggable" cancers
gmays · Hacker News · 1d ago
Kimi K2.7-Code: open-source coding model with better token efficiency
nekofneko · Hacker News · 1d ago