arXiv:2607.20474cs.AI2026-07被引 1

用简化验证提升自然语言转优化模型的准确性

VeriSimpl: Robust Optimization Modeling from Natural Language using Simplification-based Verification

论文配图:VeriSimpl: Robust Optimization Modeling from Natural Language using Simplification-based Verification
图 1 · 摘自论文原文
  • 通过简化问题生成诊断查询,让大模型可局部推理正确性
  • 在多个基准上准确率显著优于现有方法
  • 适合需要高可靠性的优化建模场景

自然语言接口能显著提升优化建模的可访问性与易用性。近年来的大语言模型(LLM)在将文本问题描述自动转化为可执行求解器形式方面展现出潜力。然而,现有方法的关键挑战在于:即使推导出的公式能正常运行,也未必正确实现目标任务。我们提出 VeriSimpl,一种基于简化验证的求解器级大模型框架,用于鲁棒的自然语言到优化建模。其核心思想是利用求解器生成关于候选公式的简化诊断查询,使大模型能在固定全局上下文中局部推理公式的正确性。我们设计了针对约束和决策变量的不同维度的简化策略。在多个优化基准上的评估表明,该方法在准确性上持续优于现有方法,并提供了一种新颖的高精度自我验证信号。

原文摘要 · Abstract (English)

Natural language interfaces can greatly benefit the accessibility and usability of optimization modeling, and recent advances in large language models (LLMs) show promise in automatically translating textual problem descriptions into executable solver formulations. However, a key challenge for existing approaches is to ensure that the inferred formulation correctly implements the intended task, even if it may execute without errors. We introduce VeriSimpl, a solver LLM framework for robust natural-language-to-optimization formalization. Our approach is based on the idea of simplification-based verification, where the optimization solver is leveraged to generate simplified diagnostic queries about a candidate formulation to allow the LLM to tractably reason about the correctness of the formulation with respect to the task description. We present such simplification strategies along different dimensions with respect to problem constraints and decision variables, which allow the LLM to reason locally under fixed global contexts. Evaluations on a range of optimization benchmarks show how our approach provides consistent improvements in accuracy over existing methods, while also providing a novel high-precision self-verification signal.

优化建模大模型验证

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