Generator-Guided Inverse Sampling for Lévy-Driven Generative Models

• URL: http://arxiv.org/abs/2608.10384v1
• Date: Tue, 11 Aug 2026 02:25:28 GMT
• Title: Generator-Guided Inverse Sampling for Lévy-Driven Generative Models
• Abstract summary: We study inverse sampling for Lévy-driven generative models from the perspective of Markov generators.<n>We develop a structured reverse sampler that decomposes the dynamics into diffusion, small jump, and large jump components.
• Score: 7.926964418680483
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper studies inverse sampling for Lévy-driven generative models from the perspective of Markov generators. Unlike conventional diffusion models, Lévy-driven dynamics involve infinite jump activities, which makes their reverse process nonlocal and difficult to characterize using score information alone. We address this challenge by analyzing the forward and reversed generators. It is derived that the reversed jump component generally becomes a state-dependent Markov jump process governed by a nonlocal density ratio. This observation motivates a structured reverse sampler that decomposes the dynamics into diffusion, small jump, and large jump components. Based on this characterization, we develop a computationally tractable sampler for a class of isotropic linear Lévy SDEs with symmetric $α$-stable jump components. For the jump component, the neural network is used only to amortize the rate of large jump activities, while jump amplitudes are generated from analytically derived conditional distributions, which improves interpretability and controllability. Efficient implementation techniques are further introduced under this setting to avoid expensive high-dimensional integration and sampling. The sampler is further adapted to approximate observation-guided sampling and applied to OFDM-SISO channel estimation under mixed Gaussian and impulsive noise. Simulations show robust estimation performance with a favorable tradeoff between complexity and performance.

Related papers

• Volterra Generative Models [0.0]
  We introduce Volterra generative models, a continuous-time score-based framework whose forward process injects path-dependent noise through fractional kernels.<n>We prove squared error bounds, derive an augmented linear-Gaussian forward process, and show that the learning can remain data-dimensional.<n>Experiments on MNIST and CIFAR-10 show that persistent fractional perturbations with small Markovian lifts can improve score-based generation.
  arXiv  Detail & Related papers  (2026-06-16T15:40:09Z)
• Initialization-Aware Score-Based Diffusion Sampling [2.554905387213586]
  classical samplers from a Gaussian distribution require a long time horizon noising typically inducing a large number of discretization steps and high computational cost.<n>We present a Kullback-Leibler convergence analysis of Vari Exploding diffusion samplers that highlights the critical role of the backward process.<n>Experiments on toy distributions and benchmark datasets demonstrate competitive or improved generative quality while using significantly fewer sampling steps.
  arXiv  Detail & Related papers  (2026-02-28T18:37:10Z)
• Weighted Stochastic Differential Equation to Implement Wasserstein-Fisher-Rao Gradient Flow [0.0]
  A promising line of work leverages tools from information geometry to augment diffusion-based samplers with mass reweighting mechanisms.<n>Our work provides a preliminary but rigorous investigation of WFR-based sampling dynamics, and aims to clarify their theoretical structure as a foundation for future developments.
  arXiv  Detail & Related papers  (2025-12-19T18:31:27Z)
• Generative modelling with jump-diffusions [0.0]
  I present a generalization of generative diffusion processes to a wide class of non-Gaussian noise processes.<n>For the problem of capturing a heavy-tailed target distribution, the jump-diffusion Laplace model outperforms models driven by alpha-stable noise.
  arXiv  Detail & Related papers  (2025-03-09T11:08:03Z)
• Scalable Equilibrium Sampling with Sequential Boltzmann Generators [60.00515282300297]
  We extend the Boltzmann generator framework with two key contributions.<n>The first is a highly efficient Transformer-based normalizing flow operating directly on all-atom Cartesian coordinates.<n>In particular, we perform inference-time scaling of flow samples using a continuous-time variant of sequential Monte Carlo.
  arXiv  Detail & Related papers  (2025-02-25T18:59:13Z)
• Energy-Based Diffusion Language Models for Text Generation [126.23425882687195]
  Energy-based Diffusion Language Model (EDLM) is an energy-based model operating at the full sequence level for each diffusion step.<n>Our framework offers a 1.3$times$ sampling speedup over existing diffusion models.
  arXiv  Detail & Related papers  (2024-10-28T17:25:56Z)
• On the Trajectory Regularity of ODE-based Diffusion Sampling [79.17334230868693]
  Diffusion-based generative models use differential equations to establish a smooth connection between a complex data distribution and a tractable prior distribution. In this paper, we identify several intriguing trajectory properties in the ODE-based sampling process of diffusion models.
  arXiv  Detail & Related papers  (2024-05-18T15:59:41Z)
• Time-series Generation by Contrastive Imitation [87.51882102248395]
  We study a generative framework that seeks to combine the strengths of both: Motivated by a moment-matching objective to mitigate compounding error, we optimize a local (but forward-looking) transition policy. At inference, the learned policy serves as the generator for iterative sampling, and the learned energy serves as a trajectory-level measure for evaluating sample quality.
  arXiv  Detail & Related papers  (2023-11-02T16:45:25Z)
• A Geometric Perspective on Diffusion Models [57.27857591493788]
  We inspect the ODE-based sampling of a popular variance-exploding SDE. We establish a theoretical relationship between the optimal ODE-based sampling and the classic mean-shift (mode-seeking) algorithm.
  arXiv  Detail & Related papers  (2023-05-31T15:33:16Z)
• Accurate generation of stochastic dynamics based on multi-model Generative Adversarial Networks [0.0]
  Generative Adversarial Networks (GANs) have shown immense potential in fields such as text and image generation. Here we quantitatively test this approach by applying it to a prototypical process on a lattice. Importantly, the discreteness of the model is retained despite the noise.
  arXiv  Detail & Related papers  (2023-05-25T10:41:02Z)
• Reflected Diffusion Models [93.26107023470979]
  We present Reflected Diffusion Models, which reverse a reflected differential equation evolving on the support of the data. Our approach learns the score function through a generalized score matching loss and extends key components of standard diffusion models.
  arXiv  Detail & Related papers  (2023-04-10T17:54:38Z)
• Sample Complexity Bounds for 1-bit Compressive Sensing and Binary Stable Embeddings with Generative Priors [52.06292503723978]
  Motivated by advances in compressive sensing with generative models, we study the problem of 1-bit compressive sensing with generative models. We first consider noiseless 1-bit measurements, and provide sample complexity bounds for approximate recovery under i.i.d.Gaussian measurements. We demonstrate that the Binary $epsilon$-Stable Embedding property, which characterizes the robustness of the reconstruction to measurement errors and noise, also holds for 1-bit compressive sensing with Lipschitz continuous generative models.
  arXiv  Detail & Related papers  (2020-02-05T09:44:10Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.