paper-with-me

홈 › Papers

Aligning LLMs with Graph Neural Solvers for Combinatorial Optimization

2026-03-28 · Shaodi Feng, Zhuoyi Lin, Yaoxin Wu, Haiyan Yin, Yan Jin, Senthilnath Jayavelu, Xun Xu arxiv

Recent research has demonstrated the effectiveness of large language models (LLMs) in solving combinatorial optimization problems (COPs) by representing tasks and instances in natural language. However, purely language-based approaches struggle to accurately capture complex relational structures inherent in many COPs, rendering them less effective at addressing medium-sized or larger instances. To address these limitations, we propose AlignOPT, a novel approach that aligns LLMs with graph neural solvers to learn a more generalizable neural COP heuristic. Specifically, AlignOPT leverages the semantic understanding capabilities of LLMs to encode textual descriptions of COPs and their instances, while concurrently exploiting graph neural solvers to explicitly model the underlying graph structures of COP instances. Our approach facilitates a robust integration and alignment between linguistic semantics and structural representations, enabling more accurate and scalable COP solutions. Experimental results demonstrate that AlignOPT achieves state-of-the-art results across diverse COPs, underscoring its effectiveness in aligning semantic and structural representations. In particular, AlignOPT demonstrates strong generalization, effectively extending to previously unseen COP instances.

📄 PDF Abstract BibTeX arXiv:2603.27169

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers

2020-08-01 · ECCV 2020 8 · Michal Rolínek, Paul Swoboda, Dominik Zietlow, Anselm Paulus 외

Building on recent progress at the intersection of combinatorial optimization and deep learning, we propose an end-to-end trainable architecture for deep graph matching that contains unmodified combinatorial solvers. Usi…

Combinatorial OptimizationDeep LearningGraph Matching

Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers

2020-03-25 · Michal Rolínek, Paul Swoboda, Dominik Zietlow, Anselm Paulus 외

Building on recent progress at the intersection of combinatorial optimization and deep learning, we propose an end-to-end trainable architecture for deep graph matching that contains unmodified combinatorial solvers. Usi…

Combinatorial OptimizationDeep LearningGraph Matching

A General Framework for Evaluating Robustness of Combinatorial Optimization Solvers on Graphs

2021-12-28 · Han Lu, Zenan Li, Runzhong Wang, Qibing Ren 외

Solving combinatorial optimization (CO) on graphs is among the fundamental tasks for upper-stream applications in data mining, machine learning and operations research. Despite the inherent NP-hard challenge for CO, heur…

Adversarial AttackCombinatorial Optimization

Combinatorial optimization and reasoning with graph neural networks

2021-02-18 · Quentin Cappart, Didier Chételat, Elias Khalil, Andrea Lodi 외

Combinatorial optimization is a well-established area in operations research and computer science. Until recently, its methods have focused on solving problem instances in isolation, ignoring that they often stem from re…

BIG-bench Machine LearningCombinatorial OptimizationInductive Bias

VN-Solver: Vision-based Neural Solver for Combinatorial Optimization over Graphs

2023-08-06 · Mina Samizadeh, Guangmo Tong

Data-driven approaches have been proven effective in solving combinatorial optimization problems over graphs such as the traveling salesman problems and the vehicle routing problem. The rationale behind such methods is t…

Combinatorial Optimization