@dair_ai
NEW paper worth reading. Reasoning-data curation is expensive because scoring a trace usually means reading it to the end. This new work from UCLA shows you may not have to. The quality of a reasoning trace is largely decided in its opening tokens, so a short prefix predicts whole-trace quality well enough to rank and filter on. What this means? You can score a million traces without finishing any of them. That turns curation into a cheap early-stopping problem and cuts the cost of building SFT data for reasoning models by a wide margin. Paper: https://t.co/KPKdygwd12 Learn to build effective AI agents in our academy: https://t.co/LRnpZN7L4c