具有拉格朗日代价的神经最优传输
Neural Optimal Transport with Lagrangian Costs
AI总结:
研究拉格朗日代价下的概率测度最优传输问题,提出一种无需 ODE 求解器即可高效计算测地线并输出拉格朗日最优传输映射的神经计算方法。
摘要:
我们研究了概率测度之间的最优传输问题,其中底层代价函数被认为满足最小作用原理,也称为拉格朗日代价。当连接来自物理系统的观测时,这些推广是有用的,其中传输动力学受系统几何形状的影响,例如障碍物(例如,在拉格朗日量中引入障碍函数),并允许从业者结合对底层系统的先验知识,如非欧几里得几何(例如,路径必须是圆形的)。我们的贡献具有计算价值,我们展示了高效计算测地线和摊还基于样条路径的能力,这即使在低维问题中也从未被实现过。与先前的工作不同,我们还输出所得的拉格朗日最优传输映射,而无需 ODE 求解器。我们在取自先前工作的低维示例上展示了我们公式的有效性。用于重现我们实验的源代码可在 https://github.com/facebookresearch/lagrangian-ot 获取。
英文摘要:
We investigate the optimal transport problem between probability measures when the underlying cost function is understood to satisfy a least action principle, also known as a Lagrangian cost. These generalizations are useful when connecting observations from a physical system where the transport dynamics are influenced by the geometry of the system, such as obstacles (e.g., incorporating barrier functions in the Lagrangian), and allows practitioners to incorporate a priori knowledge of the underlying system such as non-Euclidean geometries (e.g., paths must be circular). Our contributions are of computational interest, where we demonstrate the ability to efficiently compute geodesics and amortize spline-based paths, which has not been done before, even in low dimensional problems. Unlike prior work, we also output the resulting Lagrangian optimal transport map without requiring an ODE solver. We demonstrate the effectiveness of our formulation on low-dimensional examples taken from prior work. The source code to reproduce our experiments is available at https://github.com/facebookresearch/lagrangian-ot.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。