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 > cs > arXiv:2503.21346v1

Help | Advanced Search

Computer Science > Machine Learning

arXiv:2503.21346v1 (cs)
[Submitted on 27 Mar 2025 ]

Title: Scalable Expectation Estimation with Subtractive Mixture Models

Title: 基于减法混合模型的可扩展期望估计

Authors:Lena Zellinger, Nicola Branchini, Víctor Elvira, Antonio Vergari
Abstract: Many Monte Carlo (MC) and importance sampling (IS) methods use mixture models (MMs) for their simplicity and ability to capture multimodal distributions. Recently, subtractive mixture models (SMMs), i.e. MMs with negative coefficients, have shown greater expressiveness and success in generative modeling. However, their negative parameters complicate sampling, requiring costly auto-regressive techniques or accept-reject algorithms that do not scale in high dimensions. In this work, we use the difference representation of SMMs to construct an unbiased IS estimator ($\Delta\text{Ex}$) that removes the need to sample from the SMM, enabling high-dimensional expectation estimation with SMMs. In our experiments, we show that $\Delta\text{Ex}$ can achieve comparable estimation quality to auto-regressive sampling while being considerably faster in MC estimation. Moreover, we conduct initial experiments with $\Delta\text{Ex}$ using hand-crafted proposals, gaining first insights into how to construct safe proposals for $\Delta\text{Ex}$.
Abstract: 许多蒙特卡洛(MC)和重要性采样(IS)方法使用混合模型(MMs)因其简单性和能够捕捉多模态分布的能力。最近,减法混合模型(SMMs),即具有负系数的MMs,在生成建模中表现出更大的表达能力和成功。然而,它们的负参数使得采样变得复杂,需要成本高昂的自回归技术或无法在高维中扩展的接受-拒绝算法。在本工作中,我们利用SMMs的差分表示来构建一个无偏的IS估计器($\Delta\text{Ex}$),消除了从SMM中采样的需求,使SMMs能够进行高维期望估计。在我们的实验中,我们表明$\Delta\text{Ex}$可以在MC估计中比自回归采样更快,同时达到相当的估计质量。此外,我们使用手工设计的提议对$\Delta\text{Ex}$进行了初步实验,获得了如何为$\Delta\text{Ex}$构建安全提议的初步见解。
Subjects: Machine Learning (cs.LG) ; Computation (stat.CO); Machine Learning (stat.ML)
Cite as: arXiv:2503.21346 [cs.LG]
  (or arXiv:2503.21346v1 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2503.21346
arXiv-issued DOI via DataCite

Submission history

From: Lena Zellinger [view email]
[v1] Thu, 27 Mar 2025 10:25:03 UTC (744 KB)
Full-text links:

Access Paper:

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

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号