Prove convergence of incremental Sinkhorn-chain refinement
Prove that incrementally refining the temporal discretization of the Sinkhorn chain and applying alternating minimization converges to high-quality approximations of geodesics for the geodesic Sinkhorn distance, with the refinement strategy converging faster than direct optimization at high temporal resolution.
References
We conjecture that incremental refinement of the chain will converge to high-quality candidates faster, since in a poorly initialized chain of high temporal resolution it will take a long time until information from the end points propagates through the whole chain by alternating optimization.
However, we conjecture that in the continuous time limit of the restriction to measures with a fixed number of particles M, each particle will trace a clear path.
However, it is unclear whether this is the minimum, or merely a saddle point of the energy functional \bar{E}N. Further research is required to settle this question.