arXiv:2607.04562cs.AIcs.NE2026-07被引 1

通过门控机制防止大模型推理出错,让错误提前暴露而非传播。

Heaviside Continuity of Rolling Coefficients for Eliminating Epistemic Entropy in Large Language Models

  • 用赫维赛德门控的滚动系数框架,仅当验证通过才推进推理步骤。
  • 在强模型上将错误完成率从4-7%降至0%,且延迟不增加。
  • 适合需要高可靠性的自动编程、复杂推理等生产级应用。

大语言模型生成流畅但可能错误的内容。与人类不同,模型在产生错误时缺乏提示信号,自回归解码无法在状态转移前验证中间推理。我们提出赫维赛德连续滚动系数(HCRC),一种以验证为核心的执行框架,将推理重构成由赫维赛德门控的谓词触发状态转换。HCRC结合模型置信度与并行工作器提供的独立验证信号,仅当预设正确性谓词满足时才允许执行推进。该机制阻止无效中间状态传播,有效降低认知熵,且无需修改底层模型。我们在四个供应商的十三个模型上评估了软件工程与推理任务。对能力强的模型,门控将错误完成率(FCR)从4–7%降至0%,同时保持低延迟,部分场景甚至更快;对较弱模型,则将错误输出转为诚实终止,避免下游状态污染。除基准测试外,HCRC已作为代理编码环境的生产控制平面运行数月,支持文件修改授权、验证驱动的进度报告和内存压缩。结果表明,通过严谨的执行控制,可实现可靠推理,而不必依赖模型规模提升。

原文摘要 · Abstract (English)

Large language models (LLMs) generate fluent outputs that can be wrong. Unlike humans, who often exhibit cues when providing false information, LLMs produce errors that are difficult to detect because autoregressive decoding provides no mechanism for verifying intermediate reasoning before state progression. We introduce Heaviside Continuity of Rolling Coefficients (HCRC), a verification-first execution framework that reformulates inference as predicate-gated state transitions governed by a Heaviside Gate. HCRC combines model confidence with independent verification signals from a parallel worker architecture, allowing execution to advance only when predefined correctness predicates are satisfied. This prevents invalid intermediate states from propagating, reducing epistemic entropy without modifying the underlying model. We evaluate HCRC on software-engineering and reasoning tasks across thirteen proposers from four providers. On capable proposers, the gate reduces the false-completion rate (FCR) from 4--7% to 0% while remaining latency-competitive and, in some settings, faster than the unwrapped model. On weaker proposers, it converts false completions into honest halts instead of corrupting downstream state. Beyond benchmarking, HCRC has operated for months as the production control plane of an agentic coding environment, authorizing file mutations, verification-driven progress reporting, and memory compaction. These results establish HCRC as a general framework for verification-driven LLM execution, showing that reliable reasoning can be achieved through principled execution control rather than model scale alone.

大模型推理验证机制可靠性

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。