arXiv:2503.11427cs.LGmath.DS2025-03被引 3

用随机路径求期望,高效解高维福克-普朗克方程

FlowKac: An Efficient Neural Fokker-Planck solver using Temporal Normalizing Flows and the Feynman-Kac Formula

  • 基于费曼-卡茨公式,用随机路径期望替代传统数值求解
  • 自适应采样+时间索引归一化流,降低计算复杂度并保持精度
  • 适合高维动态系统建模,尤其适用于三维以上的复杂场景

高维复杂动力系统的福克-普朗克方程求解仍是关键挑战,因解析解难求且传统数值方法受限。本文提出FlowKac,将福克-普朗克方程通过费曼-卡茨公式重表述,通过随机路径的期望值查询解在特定点的值。核心创新在于自适应随机采样方案,显著降低计算复杂度同时保持高精度。该采样技术与时间索引归一化流结合,可有效捕捉随时间演化的概率密度分布,实现灵活、无网格的求解。该方法缓解了维度灾难问题,提升了计算效率与准确性,特别适用于需要超越常规三维的应用场景。通过多种随机微分方程实验验证了方法的鲁棒性与可扩展性,相比现有技术有显著提升。

原文摘要 · Abstract (English)

Solving the Fokker-Planck equation for high-dimensional complex dynamical systems remains a pivotal yet challenging task due to the intractability of analytical solutions and the limitations of traditional numerical methods. In this work, we present FlowKac, a novel approach that reformulates the Fokker-Planck equation using the Feynman-Kac formula, allowing to query the solution at a given point via the expected values of stochastic paths. A key innovation of FlowKac lies in its adaptive stochastic sampling scheme which significantly reduces the computational complexity while maintaining high accuracy. This sampling technique, coupled with a time-indexed normalizing flow, designed for capturing time-evolving probability densities, enables robust sampling of collocation points, resulting in a flexible and mesh-free solver. This formulation mitigates the curse of dimensionality and enhances computational efficiency and accuracy, which is particularly crucial for applications that inherently require dimensions beyond the conventional three. We validate the robustness and scalability of our method through various experiments on a range of stochastic differential equations, demonstrating significant improvements over existing techniques.

福克-普朗克随机过程神经网络高维求解

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。