Pith. sign in

REVIEW 1 cited by

A Lightweight CNN-Transformer Model for Learning Traveling Salesman Problems

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2305.01883 v2 pith:4WPVLA6A submitted 2023-05-03 cs.LG cs.CG

classification cs.LGcs.CG
keywords modelsmodelcnn-transformerembeddinglayerpartialperformanceproblems
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Several studies have attempted to solve traveling salesman problems (TSPs) using various deep learning techniques. Among them, Transformer-based models show state-of-the-art performance even for large-scale Traveling Salesman Problems (TSPs). However, they are based on fully-connected attention models and suffer from large computational complexity and GPU memory usage. Our work is the first CNN-Transformer model based on a CNN embedding layer and partial self-attention for TSP. Our CNN-Transformer model is able to better learn spatial features from input data using a CNN embedding layer compared with the standard Transformer-based models. It also removes considerable redundancy in fully-connected attention models using the proposed partial self-attention. Experimental results show that the proposed CNN embedding layer and partial self-attention are very effective in improving performance and computational complexity. The proposed model exhibits the best performance in real-world datasets and outperforms other existing state-of-the-art (SOTA) Transformer-based models in various aspects. Our code is publicly available at https://github.com/cm8908/CNN_Transformer3.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. An Efficient Diffusion-based Non-Autoregressive Solver for Traveling Salesman Problem

    cs.LG 2025-01 conditional novelty 6.0 of 10

    A one-step discrete diffusion model with an alternating add/remove noise schedule, paired with a dual-modality graph transformer, matches or beats prior neural TSP solvers in quality and speed.

Pith tools