[논문 리뷰] An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem

연구 동기 및 목표

• 2D Euclidean 그래프에서 NP-hard Travelling Salesman Problem (TSP)에 대한 학습 기반 솔루션을 동기 부여한다.
• 그래프 컨볼루션 네트워크를 직접 투어-인접 히트 맵을 출력하도록 개발한다.
• beam search를 통한 빠르고 병렬화 가능한 비자 autoregressive 추론을 가능하게 한다.
• Concorde의 최적해를 이용해 감독 학습으로 샘플 효율성을 개선한다.
• 자 autoregressive DL 방법 및 전통적인 OR 솔버와의 비교를 통해 품질과 속도를 평가한다.]
• method: [Build a graph ConvNet that processes node coordinates and edge distances to produce per-edge features.
• Predict an edge adjacency heat-map via an MLP applied to edge embeddings.
• Train end-to-end with cross-entropy loss using ground-truth TSP tours from Concorde.
• Convert the predicted heat-map into a valid tour with post-hoc beam search (and variants with shortest-tour heuristic).
• Use k-NN graph embeddings and residual graph conv layers to capture graph structure and anisotropic diffusion.]
• research_questions: [Can a non-autoregressive graph ConvNet directly predict TSP tour edges effectively for 2D Euclidean graphs?
• Does beam search decoding on a heat-map adjacency representation yield competitive tours compared to autoregressive models?
• How do solution quality, inference speed, and sample efficiency compare to existing DL approaches and traditional OR solvers?
• What is the model’s generalization behavior across fixed graph sizes and to other sizes?]
• key_findings: [The method reduces the average optimality gap from 0.52% to 0.01% for 50 nodes.
• The method reduces the average optimality gap from 2.26% to 1.39% for 100 nodes.
• Inference is fast due to GPU-accelerated, highly parallelized graph ConvNet and beam search.
• Supervised training with optimal solutions is more sample-efficient than reinforcement learning in this setup.
• Beam search with 1,280 solutions outperforms autoregressive deep learning methods in both quality and speed on fixed-size graphs.]
• table_headers: []
• table_rows: []} }

관련 연구