paper-with-me

Papers

GraphThought: Graph Combinatorial Optimization with Thought Generation

2025-02-17 · Zixiao Huang, Lifeng Guo, Junjie Sheng, Haosheng Chen, Wenhao Li, Bo Jin, Changhong Lu, Xiangfeng Wang

Large language models (LLMs) have demonstrated remarkable capabilities across various domains, especially in text processing and generative tasks. Recent advancements in the reasoning capabilities of state-of-the-art LLMs, such as OpenAI-o1, have significantly broadened their applicability, particularly in complex problem-solving and logical inference. However, most existing LLMs struggle with notable limitations in handling graph combinatorial optimization (GCO) problems. To bridge this gap, we formally define the Optimal Thoughts Design (OTD) problem, including its state and action thought space. We then introduce a novel framework, GraphThought, designed to generate high-quality thought datasets for GCO problems. Leveraging these datasets, we fine-tune the Llama-3-8B-Instruct model to develop Llama-GT. Notably, despite its compact 8B-parameter architecture, Llama-GT matches the performance of state-of-the-art LLMs on the GraphArena benchmark. Experimental results show that our approach outperforms both proprietary and open-source models, even rivaling specialized models like o1-mini. This work sets a new state-of-the-art benchmark while challenging the prevailing notion that model scale is the primary driver of reasoning capability.

📄 PDF Abstract BibTeX arXiv:2502.11607

Code (0)

등록된 구현이 없습니다.

Tasks

Combinatorial Optimization

Similar Papers 제목 키워드 기반

Text2Zinc: A Cross-Domain Dataset for Modeling Optimization and Satisfaction Problems in MiniZinc

2025-02-22 · Akash Singirikonda, Serdar Kadioglu, Karthik Uppuluri

There is growing interest in utilizing large language models (LLMs) as co-pilots for combinatorial optimization and constraint programming tasks across various problems. This paper aims to advance this line of research b…

Combinatorial OptimizationKnowledge Graphs

Permutation Picture of Graph Combinatorial Optimization Problems

2024-10-22 · Yimeng Min

This paper proposes a framework that formulates a wide range of graph combinatorial optimization problems using permutation-based representations. These problems include the travelling salesman problem, maximum independe…

Combinatorial Optimization

Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms

2025-01-30 · Shuaiqun Pan, Yash J. Patel, Aneta Neumann, Frank Neumann 외

Variational quantum algorithms, such as the Recursive Quantum Approximate Optimization Algorithm (RQAOA), have become increasingly popular, offering promising avenues for employing Noisy Intermediate-Scale Quantum device…

BenchmarkingCombinatorial OptimizationGraph Generation

Learning Combinatorial Optimization on Graphs: A Survey with Applications to Networking

2020-05-22 · Natalia Vesselinova, Rebecca Steinert, Daniel F. Perez-Ramirez, Magnus Boman

Existing approaches to solving combinatorial optimization problems on graphs suffer from the need to engineer each problem algorithmically, with practical problems recurring in many instances. The practical side of theor…

BIG-bench Machine LearningCombinatorial Optimization

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