Structure As Search: Unsupervised Permutation Learning for Combinatorial Optimization
arXiv:2507.04164v3 Announce Type: replace Abstract: We propose a non-autoregressive framework for the Travelling Salesman Problem where solutions emerge directly from learned permutations, without requiring explicit search. By applying a similarity transformation to Hamiltonian cycles, the model learns to approximate permutation…
