Dijkstra's in Disguise
https://blog.evjang.com/2018/08/dijkstras.html [blog.evjang.com]
2018-08-13 01:03
We have 3 very well-known algorithms (currency arbitrage, Q-learning, path tracing) that independently discovered the principle of relaxation used in shortest-path algorithms such as Dijkstra’s and Bellman-Ford. Remarkably, each of these disparate fields of study discovered notions of hard and soft optimality, which is relevant in the presence of noise or high-dimensional path integrals.
source: HN