arXiv (All)
open access
MGD: Moment Guided Diffusion for Maximum Entropy Generation
Generating samples from limited information is a fundamental problem across scientific domains. Classical maximum entropy methods provide principled uncertainty quantification from moment constraints but require sampling via MCMC or Langevin dynamics, which typically exhibit exponential slowdown in
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Accelerated Sampling with the Inertial Langevin Algorithm#972393
- Error attribution in gradient random walk methods for parabolic equations#1143882
- Mean square error analysis of stochastic gradient and variance-reduced sampling algorithms#999177
- Monte Carlo Approximations of Time-Nonlocal Diffusions in Bounded Domains#1033902
- Fast Convergence for High-Order ODE Solvers in Diffusion Probabilistic Models#999662
Record · ID 974332
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive