Papers

Stanford 提出 hinted scaling laws,可用极低算力预测基准成绩

Why we picked it

斯坦福团队把基准题加提示变简单,再反推模型真实成绩,算力省了 5600 倍还能预测 GSM8K,做评测和选型的人可以看看这套方法。

Stanford AI Lab 的 Suze van Adrichem 等人提出 hinted scaling laws 方法,用于预测模型在基准测试上的准确率。做法是把一个基准改造成一系列加入提示(hint)的更简单版本,再联合建模模型规模 C 与提示等级 H 两个变量。结果显示,仅用 5600 倍更少的计算量,就能把 GSM8K 无提示(H=0)时的准确率预测到 3 个百分点以内。该工作由 Luke Bailey 与 rckpudi 共同主导。

Original · Stanford AI Lab

Hinted scaling laws allow you to make better benchmark accuracy forecasts! Suze van Adrichem @suze_va Can we forecast benchmark accuracy from models that score zero? We (co-leads @LukeBailey181 @rckpudi ) turn a benchmark into a series of easier hinted versions. Jointly modeling scale C and hint level H enables forecasting GSM8K acc (H=0) within 3 pts from 5600x less compute 🧵 🔗 View Quoted Tweet 💬 1 🔄 1 ❤️ 3 👀 1029 📊 2 ⚡