Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > math > arXiv:2306.00191

Help | Advanced Search

Mathematics > Numerical Analysis

arXiv:2306.00191 (math)
[Submitted on 31 May 2023 (v1) , last revised 16 Jul 2023 (this version, v2)]

Title: Parameterized Wasserstein Hamiltonian Flow

Title: 参数化Wasserstein哈密顿流

Authors:Hao Wu, Shu Liu, Xiaojing Ye, Haomin Zhou
Abstract: In this work, we propose a numerical method to compute the Wasserstein Hamiltonian flow (WHF), which is a Hamiltonian system on the probability density manifold. Many well-known PDE systems can be reformulated as WHFs. We use parameterized function as push-forward map to characterize the solution of WHF, and convert the PDE to a finite-dimensional ODE system, which is a Hamiltonian system in the phase space of the parameter manifold. We establish error analysis results for the continuous time approximation scheme in Wasserstein metric. For the numerical implementation, we use neural networks as push-forward maps. We apply an effective symplectic scheme to solve the derived Hamiltonian ODE system so that the method preserves some important quantities such as total energy. The computation is done by fully deterministic symplectic integrator without any neural network training. Thus, our method does not involve direct optimization over network parameters and hence can avoid the error introduced by stochastic gradient descent (SGD) methods, which is usually hard to quantify and measure. The proposed algorithm is a sampling-based approach that scales well to higher dimensional problems. In addition, the method also provides an alternative connection between the Lagrangian and Eulerian perspectives of the original WHF through the parameterized ODE dynamics.
Abstract: 在这项工作中,我们提出了一种数值方法来计算Wasserstein哈密顿流(WHF),这是一种在概率密度流形上的哈密顿系统。许多著名的偏微分方程系统可以重新表述为WHF。我们使用参数化函数作为推进映射来表征WHF的解,并将偏微分方程转换为有限维常微分方程系统,该系统是参数流形相空间中的哈密顿系统。我们在Wasserstein度量下建立了连续时间逼近格式的误差分析结果。对于数值实现,我们使用神经网络作为推进映射。我们应用一种有效的辛格式求解推导出的哈密顿常微分方程系统,从而使方法保留了一些重要的守恒量,例如总能量。计算完全由确定性的辛积分器完成,而无需任何神经网络训练。因此,我们的方法不涉及网络参数的直接优化,从而避免了随机梯度下降(SGD)方法引入的误差,这种误差通常难以量化和测量。所提出的算法是一种基于抽样的方法,能够很好地扩展到更高维问题。此外,该方法还通过参数化常微分方程动力学提供了原始WHF的拉格朗日和欧拉视角之间的另一种联系。
Comments: We welcome any comments and suggestions
Subjects: Numerical Analysis (math.NA)
Cite as: arXiv:2306.00191 [math.NA]
  (or arXiv:2306.00191v2 [math.NA] for this version)
  https://doi.org/10.48550/arXiv.2306.00191
arXiv-issued DOI via DataCite

Submission history

From: Hao Wu [view email]
[v1] Wed, 31 May 2023 21:13:41 UTC (1,160 KB)
[v2] Sun, 16 Jul 2023 15:17:03 UTC (1,141 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
view license
Current browse context:
math.NA
< prev   |   next >
new | recent | 2023-06
Change to browse by:
cs
cs.NA
math

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号