Conformal Certification of Reasoning Trace Prefixes 文章

ArXiv CS.CL2026-05-29NEWSen作者: Matt Y. Cheung, Ashok Veeraraghavan, Hanjie Chen, Guha Balakrishnan

摘要

arXiv:2605.30085v1 Announce Type: cross Abstract: Language model reasoning traces are rarely all-or-nothing; they frequently contain valid intermediate steps before a critical error occurs. Existing uncertainty quantification methods typically certify final answers or entire responses, failing to provide statistical guarantees for the proportion of a sequential trace that can be safely retained. To address this, we introduce CROP (Conformal Reasoning Output Prefixes), a verifier-agnostic calibration procedure for clean-prefix certification. Given any step-level risk proxy, CROP selects a calibrated threshold and returns the longest contiguous prefix whose step risk proxies remain below it, routing the uncertified suffix for downstream review or repair. Assuming exchangeability, CROP rigorously controls the marginal probability that the returned prefix contains an annotated error.

相关事件查看全部 (1)

Conformal Certification of Reasoning Trace Prefixes
2026-05-29PRODUCT_LAUNCH影响: MEDIUM

相关公司

暂无数据

相关人物

暂无数据

相关产品

暂无数据