arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.02188cs.AI
收藏

在组合与约束世界中的推理:在自然语言组合优化上对LLM的基准测试

Reasoning in a Combinatorial and Constrained World: Benchmarking LLMs on Natural-Language Combinatorial Optimization

Eindhoven University of Technology(埃因霍温理工大学);Brandenburg University of Technology(勃兰登堡工业大学);Nanyang Technological University(南洋理工大学);Delft University of Technology(代尔夫特理工大学);Southeast University(东南大学)

Xia Jiang, Jing Chen, Cong Zhang, Jie Gao, Chengpeng Hu, Chenhao Zhang, Yaoxin Wu, Yingqian Zhang

AI总结:

本文提出NLCO基准测试,评估LLM在组合优化中的推理能力,涵盖43个问题,通过四层分类体系进行细粒度评估,发现随着问题规模增大,LLM的性能下降,尤其是在图结构问题和瓶颈目标上表现较差。

摘要:

尽管大型语言模型(LLM)在数学和逻辑推理方面表现出色,但其处理组合优化(CO)的能力仍待探索。为此,我们引入了NLCO,一个自然语言组合优化基准,用于评估LLM在端到端的组合优化推理中的表现:给定一个用语言描述的决策场景,模型必须输出离散解,而无需编写代码或调用外部求解器。NLCO涵盖43个组合优化问题,并通过变量类型、约束家族、全局模式和目标类别四层分类体系进行组织,实现细粒度评估。我们提供了求解器注释的解决方案,并通过可行性、解的最优性和推理效率全面评估LLM。实验表明,高性能模型在小型实例上表现出良好的可行性与解质量,但随着实例规模增大,性能下降,即使使用更多token进行推理。我们还观察到在分类体系中的系统性影响:基于集合的任务相对容易,而图结构问题和瓶颈目标则导致更频繁的失败。

英文摘要:

While large language models (LLMs) have shown strong performance in math and logic reasoning, their ability to handle combinatorial optimization (CO) -- searching high-dimensional solution spaces under hard constraints -- remains underexplored. To bridge the gap, we introduce NLCO, a \textbf{N}atural \textbf{L}anguage \textbf{C}ombinatorial \textbf{O}ptimization benchmark that evaluates LLMs on end-to-end CO reasoning: given a language-described decision-making scenario, the model must output a discrete solution without writing code or calling external solvers. NLCO covers 43 CO problems and is organized using a four-layer taxonomy of variable types, constraint families, global patterns, and objective classes, enabling fine-grained evaluation. We provide solver-annotated solutions and comprehensively evaluate LLMs by feasibility, solution optimality, and reasoning efficiency. Experiments across a wide range of modern LLMs show that high-performing models achieve strong feasibility and solution quality on small instances, but both degrade as instance size grows, even if more tokens are used for reasoning. We also observe systematic effects across the taxonomy: set-based tasks are relatively easy, whereas graph-structured problems and bottleneck objectives lead to more frequent failures.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑