TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Beat GPT-4o at Python by searching with 100 dumb LLaMAs

4 点作者 thundergolfer9 个月前

1 comment

charles_irl9 个月前
One of the authors, Charles, here. I wrote this up because 1) I&#x27;ve been following work on sampling&#x2F;inference-time compute scaling and the &quot;Large Language Monkeys&quot; paper (<a href="https:&#x2F;&#x2F;arxiv.org&#x2F;abs&#x2F;2407.21787" rel="nofollow">https:&#x2F;&#x2F;arxiv.org&#x2F;abs&#x2F;2407.21787</a>) results looked promising and 2) our reproduction was effortless and immediate, which has not been my experience with most research.<p>Happy to answer questions!