Smoothing the max operator in a dynamic program recursion induces a random walk on the computational graph. The expected path on that walk can be computed efficiently by backpropagation, which converges to backtracking as smoothing vanishes. https://t.co/AjyGsez1B1 pic.twitter.com/RZELfrmRqn
— Mathieu Blondel (@mblondel_ml) July 10, 2018