Itô maps for any-step SDEs

• URL: http://arxiv.org/abs/2606.11156v1
• Date: Tue, 09 Jun 2026 17:39:22 GMT
• Title: Itô maps for any-step SDEs
• Abstract summary: Recent one-step generative models accelerate sampling by learning deterministic flow maps of underlying dynamics.<n>We introduce the It map, an any-step flow map that takes an intermediate state and Brownian path and predicts future states in a single pass.<n>It maps produce diverse, conditionally valid endpoint samples from fixed intermediate states and support strong steering performance on synthetic and image-generation benchmarks.
• Score: 5.492715250025273
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recent one-step generative models accelerate sampling by learning deterministic flow maps of the underlying dynamics. These methods rely on learning from ordinary differential equations, leaving open how to define an exact distillation procedure for stochastic dynamics. We introduce the Itô map, an any-step stochastic flow map that takes an intermediate state and Brownian path and predicts future states in a single pass. The Itô map formulation yields novel estimators for inference-time control by providing cheap, differentiable access to posterior samples. Empirically, Itô maps produce diverse, conditionally valid endpoint samples from fixed intermediate states and support strong steering performance on synthetic and image-generation benchmarks. These results establish any-step SDE integration as a useful primitive for posterior sampling and stochastic control.

Related papers

• Flow-Map GRPO: Reinforcement Learning for Few-Step Flow-Map Generators via Anchored Stochastic Composition [13.766141027420879]
  Few-step flow-map generators, such as consistency models and MeanFlow, accelerate sampling by directly learning longrange transport maps between noise and data.<n>These models are typically deterministic, which makes them difficult to optimize with post-training methods.<n>We propose Flow-MapO, an online framework for deterministic post-training framework for fewstep flow-map generators.
  arXiv  Detail & Related papers  (2026-07-01T07:25:11Z)
• Strong Stochastic Flow Maps [38.75021352054866]
  Flow and diffusion models generate high-quality samples in many modalities.<n> Flow maps alleviate this problem by learning the solution map of the differential equation directly.<n>We propose Strong Flow Maps (SSFMs) as a novel framework for learning the strong solution map of additive-noise SDEs.
  arXiv  Detail & Related papers  (2026-05-31T08:14:47Z)
• AnyFlow: Any-Step Video Diffusion Model with On-Policy Flow Map Distillation [70.80207977907908]
  We introduce AnyFlow, the first any-step video diffusion distillation framework based on flow maps.<n>We show that AnyFlow achieves performance matches or surpasses consistency-based counterparts in the few-step regime.
  arXiv  Detail & Related papers  (2026-05-13T16:06:34Z)
• Stochastic Transition-Map Distillation for Fast Probabilistic Inference [14.377745343756485]
  Diffusion models achieve strong generation quality, diversity, and distribution coverage, but their performance often comes with expensive inference.<n>In this work, we propose Transition-Map Distillation (STMD), a teacher-free framework for accelerating diffusion model inference.
  arXiv  Detail & Related papers  (2026-05-08T12:31:44Z)
• Variational Smoothing and Inference for SDEs from Sparse Data with Dynamic Neural Flows [2.9746075314244376]
  We develop a novel method for smoothing the posterior differential equations (SDEs) in partially observed systems.<n>We learn this conditional score using neural networks trained to satisfy both the governing PDE and the observation-induced jump conditions.<n>The resulting score induces a posterior SDE with the same diffusion coefficient but a modified drift, enabling efficient posterior trajectory.
  arXiv  Detail & Related papers  (2026-05-07T02:47:06Z)
• Beyond Scores: Proximal Diffusion Models [10.27283386401996]
  We develop Proximal Diffusion Models (ProxDM) to learn proximal operators of the log-density.<n>We show that two variants of ProxDM achieve significantly faster within just a few sampling steps compared to conventional score-matching methods.
  arXiv  Detail & Related papers  (2025-07-11T18:30:09Z)
• Feynman-Kac Correctors in Diffusion: Annealing, Guidance, and Product of Experts [64.34482582690927]
  We provide an efficient and principled method for sampling from a sequence of annealed, geometric-averaged, or product distributions derived from pretrained score-based models.<n>We propose Sequential Monte Carlo (SMC) resampling algorithms that leverage inference-time scaling to improve sampling quality.
  arXiv  Detail & Related papers  (2025-03-04T17:46:51Z)
• Flow map matching with stochastic interpolants: A mathematical framework for consistency models [15.520853806024943]
  Flow Map Matching is a principled framework for learning the two-time flow map of an underlying generative model.<n>We show that FMM unifies and extends a broad class of existing approaches for fast sampling.
  arXiv  Detail & Related papers  (2024-06-11T17:41:26Z)
• 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)
• 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)
• Restoration-Degradation Beyond Linear Diffusions: A Non-Asymptotic Analysis For DDIM-Type Samplers [90.45898746733397]
  We develop a framework for non-asymptotic analysis of deterministic samplers used for diffusion generative modeling. We show that one step along the probability flow ODE can be expressed as two steps: 1) a restoration step that runs ascent on the conditional log-likelihood at some infinitesimally previous time, and 2) a degradation step that runs the forward process using noise pointing back towards the current gradient.
  arXiv  Detail & Related papers  (2023-03-06T18:59:19Z)
• Score-based Continuous-time Discrete Diffusion Models [102.65769839899315]
  We extend diffusion models to discrete variables by introducing a Markov jump process where the reverse process denoises via a continuous-time Markov chain. We show that an unbiased estimator can be obtained via simple matching the conditional marginal distributions. We demonstrate the effectiveness of the proposed method on a set of synthetic and real-world music and image benchmarks.
  arXiv  Detail & Related papers  (2022-11-30T05:33:29Z)

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.