Realizing that in many cases a single global shift is suboptimal, Halperin et al. have shown that a network that is similar in structure to SyncNet can be leveraged to achieve a dynamic temporal alignment [1]}. This is done by using the Dijkstra algorithm as a post processing step, in order to find the optimal path in the graph of pairwise distances.
