(2015) evaluated the PtrNet on geometric sorting tasks (e.g., Travelling Salesman Problem) where each input w i forms a continuous vector that represents the cartesian coordinate of the point (e.g., a city).
in the word ordering task, Equation 10 suffers from the data sparseness problem, as each input w i forms a high-dimensional discrete symbol.