Hacker Newsnew | past | comments | ask | show | jobs | submitlogin
How Do Large Language Monkeys Get Their Power (Laws)? (arxiv.org)
2 points by RSchaeffer 7 months ago | hide | past | favorite | 1 comment


Best of N was shown to exhibit power (polynomial) law scaling (left), but maths suggest one should expect exponential scaling (center). We show how to resolve this "paradox", then use our insights to design methods for predicting inference-scaling capabilities that can be more sample efficient!




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: