EquivaMap:利用 LLM 自动进行优化公式的等价性检查
EquivaMap: Leveraging LLMs for Automatic Equivalence Checking of Optimization Formulations
AI总结:
本文提出 Quasi-Karp 等价准则与 EquivaMap 框架,利用 LLM 发现变量映射并验证可行性和最优性,同时构建 EquivaFormulation 数据集,显著提升优化公式等价识别效果。
摘要:
组合优化中的一个基本问题是识别等价的公式。尽管对自动化等价性检查的需求不断增长——例如由优化副驾驶根据自然语言描述生成问题公式所推动——但当前方法依赖于简单的启发式规则,无法可靠地检查公式等价性。受 Karp 归约启发,本文提出 Quasi-Karp 等价性,这是一种根据两个优化公式的决策变量之间是否存在映射来判断二者何时等价的形式化准则。我们提出 EquivaMap 框架,利用大语言模型自动发现此类映射,以实现可扩展且可靠的等价性检查;该框架包含一个验证阶段,可在无需额外调用求解器的情况下确保映射后的解保持可行性和最优性。为评估该方法,我们构建了 EquivaFormulation,这是首个开源的等价优化公式数据集,通过对现有公式施加添加松弛变量或有效不等式等变换生成。实验表明,EquivaMap 显著优于现有方法,在正确识别公式等价性方面取得实质性提升。
英文摘要:
A fundamental problem in combinatorial optimization is identifying equivalent formulations. Despite the growing need for automated equivalence checks -- driven, for example, by optimization copilots, which generate problem formulations from natural language descriptions -- current approaches rely on simple heuristics that fail to reliably check formulation equivalence. Inspired by Karp reductions, in this work we introduce Quasi-Karp equivalence, a formal criterion for determining when two optimization formulations are equivalent based on the existence of a mapping between their decision variables. We propose EquivaMap, a framework that leverages large language models to automatically discover such mappings for scalable, reliable equivalence checking, with a verification stage that ensures mapped solutions preserve feasibility and optimality without additional solver calls. To evaluate our approach, we construct EquivaFormulation, the first open-source dataset of equivalent optimization formulations, generated by applying transformations such as adding slack variables or valid inequalities to existing formulations. Empirically, EquivaMap significantly outperforms existing methods, achieving substantial improvements in correctly identifying formulation equivalence.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。