Signals 4 · free daily AI digest

Cheap to Draw, Expensive to Trust: Certifying Test-Time Scaling Curves

Paper recorded by Signals 4 on 2026-09-30 in cs.LG. Abstract reproduced from arXiv; link to the original below.

Published 2026-09-30 on arXiv · recorded by Signals 4 on 2026-10-01

Category: cs.LG · 机器学习 · first seen 2026-10-01

Abstract

Sampling several answers and keeping the one a verifier scores highest is one of the simplest ways to buy accuracy at test time. Its effect is reported as a scaling curve: accuracy against the number $k$ of sampled answers. The curve is cheap to draw and expensive to trust. A budget read off it is chosen after looking at every point, so only a band that covers all budgets at once protects the choi

Read on arXiv →

#15 most recent of 349 cs.LG papers we have recorded · ↑ newer: Near-Linear Accuracy Bounds for Moreau--Yosida Unadjusted Langevin Sam · ↓ older: Breakdown of Local Denoising as Semantic Speciation
Cite this page: Cheap to Draw, Expensive to Trust: Certifying Test-Time Scaling Curves: the #15 most recent of 349 cs.LG papers we have recorded (as of 2026-09-30). Source: Signals 4 (Signals API) — https://data.jiangzhang.ca/signals4/t/papers/cheap-to-draw-expensive-to-trust-certifying-test-time-scaling-curves.html
Free to quote with attribution to “Signals 4 (Signals API)”. Machine-readable: papers.json
Related: More cs.LG papers · arXiv signals · All papers · Today in AI
Get 4 AI signals a day by email — free.
Subscribe free → See all plans →
Get 4 AI signals a day by email — free
All models · All repos · By company · Daily editions