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 > stat > arXiv:2407.00649

Help | Advanced Search

Statistics > Machine Learning

arXiv:2407.00649 (stat)
[Submitted on 30 Jun 2024 (v1) , last revised 14 Jan 2025 (this version, v3)]

Title: Particle Semi-Implicit Variational Inference

Title: 粒子半隐式变分推理

Authors:Jen Ning Lim, Adam M. Johansen
Abstract: Semi-implicit variational inference (SIVI) enriches the expressiveness of variational families by utilizing a kernel and a mixing distribution to hierarchically define the variational distribution. Existing SIVI methods parameterize the mixing distribution using implicit distributions, leading to intractable variational densities. As a result, directly maximizing the evidence lower bound (ELBO) is not possible, so they resort to one of the following: optimizing bounds on the ELBO, employing costly inner-loop Markov chain Monte Carlo runs, or solving minimax objectives. In this paper, we propose a novel method for SIVI called Particle Variational Inference (PVI) which employs empirical measures to approximate the optimal mixing distributions characterized as the minimizer of a free energy functional. PVI arises naturally as a particle approximation of a Euclidean--Wasserstein gradient flow and, unlike prior works, it directly optimizes the ELBO whilst making no parametric assumption about the mixing distribution. Our empirical results demonstrate that PVI performs favourably compared to other SIVI methods across various tasks. Moreover, we provide a theoretical analysis of the behaviour of the gradient flow of a related free energy functional: establishing the existence and uniqueness of solutions as well as propagation of chaos results.
Abstract: 半隐式变分推断(SIVI)通过利用核函数和混合分布来分级定义变分分布,从而增强了变分族的表达能力。现有的 SIVI 方法使用隐式分布来参数化混合分布,导致变分密度难以计算。因此,直接最大化证据下界(ELBO)是不可能的,于是它们转而采用以下方法之一:优化 ELBO 的边界、使用昂贵的内循环马尔可夫链蒙特卡洛运行,或者解决极小极大目标。本文提出了一种新的 SIVI 方法,称为粒子变分推断(PVI),它使用经验测度来近似由自由能泛函最小值刻画的最佳混合分布。PVI 自然地作为欧几里得–Wasserstein 梯度流的粒子近似出现,并且与先前的工作不同,它直接优化 ELBO,同时不对混合分布做出参数假设。我们的实证结果显示,与其他 SIVI 方法相比,PVI 在各种任务中的表现更优。此外,我们还对该相关自由能泛函梯度流的行为进行了理论分析:证明了解的存在性和唯一性以及混沌传播的结果。
Comments: NeurIPS 2024 Camera ready
Subjects: Machine Learning (stat.ML) ; Machine Learning (cs.LG)
Cite as: arXiv:2407.00649 [stat.ML]
  (or arXiv:2407.00649v3 [stat.ML] for this version)
  https://doi.org/10.48550/arXiv.2407.00649
arXiv-issued DOI via DataCite

Submission history

From: Jen Ning Lim [view email]
[v1] Sun, 30 Jun 2024 10:21:41 UTC (4,669 KB)
[v2] Wed, 30 Oct 2024 13:18:41 UTC (5,301 KB)
[v3] Tue, 14 Jan 2025 17:08:47 UTC (5,301 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
view license
Current browse context:
stat.ML
< prev   |   next >
new | recent | 2024-07
Change to browse by:
cs
cs.LG
stat

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号