arXiv AI
Posterior sampling by source-space MCMC via prior-based few-step transport maps
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
arXiv Machine Learning
4d ago
Interacting particle guidance for sampling reward-tilted generative priors
arXiv:2609.37227v1 Announce Type: new Abstract: Inference-time steering adapts pretrained diffusion and flow-based models to new tasks, e.g., to generate samples from a conditional distribution or sa...
arXiv Statistics ML
Sep 10
Manifold-Aligned Generative Transport
arXiv:2602.19600v2 Announce Type: replace Abstract: Many high-dimensional datasets concentrate near a low-dimensional structure embedded in the ambient space. Generative models for such data must con...
arXiv Machine Learning
2d ago
Unifying Distributional Training for One-Step Visual Generation
arXiv:2609.35763v3 Announce Type: replace Abstract: Distributional training provides collective supervision for one-step visual generation by matching real and generated features in frozen representa...
arXiv Machine Learning
Sep 3
Source Distribution Estimation by Posterior Averaging
The paper introduces a new approach to source distribution estimation (SDE) in simulation-based science, addressing limitations of existing methods that rely on a fixed surrogate likelihood. By employing an expectation‑maximization framework, the authors iteratively train an amortized posterior on fresh simulations (E‑step) and refit the source distribution to the posterior’s average (M‑step). Two parameterizations are explored: separate source and posterior flows, and a single shared conditional flow, with experiments on three benchmark tasks showing improved performance over fixed surrogate and iterated baseline methods, notably achieving higher data‑space C2ST scores on the Lotka–Volterra benchmark.
arXiv Machine Learning
Aug 5
Information-Geometric Forward Policy Training in GFlowNets
arXiv:2608. 03967v1 Announce Type: cross Abstract: Generative Flow Networks (GFlowNets) have emerged as a flexible framework for amortised inference over discrete and mixed discrete-continuous objects, requiring only an unnormalised target density specified through a reward.
arXiv AI
Jun 2
Efficient Weighted Sampling via Score-based Generative Models
arXiv:2502. 04646v2 Announce Type: replace-cross Abstract: Weighted sampling -- sampling from a probability density function (PDF) proportional to the product of a base PDF and a weight function -- is a fundamental technique with wide-ranging applications in variance reduction, biased sampling, data augmentation, and more.