- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2(+1)
Read review
Paper summary
This paper proposes an approach that combines a neural-based method with traditional heuristic TSP methods. By learning how to iteratively optimize the input data of the TSP, this approach aims to improve the solution quality achieved by traditional TSP methods without incurring the high training costs typically associated with general neural-based methods.
Critical strengths
-
This paper proposes a paradigm that uses data-driven fine-tuning to optimize traditional algorithms, enabling them to find better solutions more quickly. This method learns how to improve the traditional approach from each attempt.
-
Experiments have shown that, compared to traditional heuristic TSP methods, this method can find better solutions more quickly; and compared to neural-based methods, it requires less training time and yields excellent results.
Critical weaknesses
The author did not clearly explain the motivation behind the method’s design or its underlying logic. My understanding is that this method essentially transforms “learning how to construct a good route” into “learning how to guide an algorithm that already knows how to construct routes so that it produces the correct solution.” However, since the ultimate goal is to alter the algorithm’s selection preferences, why not directly learn the weights of the edges between different cities, or directly modify the weight assigned to selecting a particular city, rather than achieving this indirectly through coordinate transformations? The author provides some qualitative explanations in the paper, such as: “Inspired by prompt engineering in LLMs, where input prompts are carefully modified to guide the model toward better responses, our TSP-MDF introduces an additional pre-processing stage prior to the initial tour construction stage, as shown in Figure 1.” However, even prompt engineering guides an LLM to make the correct choices by indicating which decisions are more important and how to proceed—it does not involve modifying the input data to achieve this guidance.
Questions for authors
- No experiments were provided to solve the confusion regarding the aforementioned weakness.
- Traditional non-learning methods include not only very basic approaches like Nearest and Farthest, but also methods that introduce perturbations into the strategy. They don’t always stick to a single path—so what would happen if you applied your method to them?
- The method described in this paper adopts a parameterized approach that incorporates the prior knowledge of traditional algorithms. Under these circumstances, if most of the decisions made by the traditional algorithm are already reasonably sound, the network may only need to drive changes in a few key decisions, rather than precisely determining the visit order of all nodes. However, what if the traditional method simply cannot reach the optimal solution—if it is far from the optimal solution and no amount of data adjustment can fix it? Does such a scenario exist? In that case, this is essentially a form of fine-tuning—how would it converge?
- Furthermore, different coordinate modifications may yield the same path; therefore, there may not be a single exact solution for a valid modification. This is why this design may be easier to learn, but it is not a strict, universal guarantee. Modifying the coordinates of all nodes remains a high-dimensional problem; many modifications may change nothing at all, or they may severely disrupt the constructor’s judgment. Whether good modifications are easily selected depends on the distribution of modifications, the algorithm’s sensitivity, and the training design—all of which affect the method’s generalization ability. So how can this be addressed?
If the author can clearly explain why the design focuses on changing the input rather than changing selection preferences, I would consider raising my score.