Self-Consistent Generative Paths via Admissible Random Variational Transport

• URL: http://arxiv.org/abs/2606.08953v1
• Date: Mon, 08 Jun 2026 02:56:06 GMT
• Title: Self-Consistent Generative Paths via Admissible Random Variational Transport
• Abstract summary: We study a complementary question: when is a generated probability path self-consistent?<n>We define a self-consistent generative path as a random fixed point of admissible local variational transport corrections.<n>The resulting theory turns endpoint matching into path self-consistency testing.
• Score: 14.74009385288423
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Modern generative models often define an entire probability path from a simple prior to the data law, rather than only an endpoint map. Diffusion models follow stochastic denoising paths, flow matching learns transport fields, consistency and distillation methods compress paths into one or a few steps, adversarial models match terminal distributions, and VAEs generate through latent kernels. Existing unifying views mainly describe how such paths are constructed. We study a complementary question: when is a generated probability path self-consistent? We define a self-consistent generative path as a random fixed point of admissible local variational transport corrections. In this framework, a local correction is specified by a random variational transport operator combining a divergence or geometry term, an energy term, and a structural constraint. The framework contains random regularized optimal-transport proximal steps as a structured instance, while also allowing non-OT divergences, latent kernels, adversarial constraints, causal discrete kernels, and terminal one-step maps. The theory yields a random fixed-point path residual (R-FPR), which measures the gap between the actual generated path and an admissible local correction. We prove well-posedness, random fixed-point existence and attraction, non-contractive existence, residual-to-generation error bounds, empirical residual concentration, proxy perturbation bounds, continuous-time limits, and operator-level generalization with model-specific corollaries. The resulting theory turns endpoint matching into path self-consistency testing and provides a residual-control principle for diagnosing failures, regularizing training, and guiding adaptive sampling across diffusion, flow, one-step, VAE, GAN/WGAN, and autoregressive generators.

Related papers

• Generative Diffusion Surrogates with Analytical Variance Schedule [0.0]
  Transport describes physical systems in which an initially structured distribution spreads under unresolved forcing, scattering, or heterogeneous media.<n>Here we prescribe the forward noising rate as the time derivative of this variance, turning generative time into a calibrated transport clock.<n>For ballistic-to-diffusive transport in turbulent plasmas, the surrogate matches test-particle distributions, reproduces the laboratory-measured variance scale, and tracks the simulated kurtosis evolution without schedule tuning.
  arXiv  Detail & Related papers  (2026-09-01T18:00:00Z)
• Rethinking Structural Anomaly Detection: From Decision Boundaries to Projection Operators [51.771100367755544]
  We introduce a geometric perspective to address the mismatch between the inductive bias of existing methods and the structure of the data.<n>Specifically, we learn a projection operator onto the manifold of normal samples and define a sample as anomalous if it is altered by this projection.<n> Notably, it provides a unifying interpretation of reconstruction-based methods by explaining their success and failure in terms of projection quality.
  arXiv  Detail & Related papers  (2026-06-13T12:37:20Z)
• A Unified Measure-Theoretic View of Diffusion, Score-Based, and Flow Matching Generative Models [0.3222802562733787]
  We survey continuous-time generative modeling methods based on transporting a simple reference distribution to a data distribution via deterministic dynamics.<n>We present a unified framework in which diffusion models, score-based generative models, and flow matching are instances of learning a time-dependent vector field.
  arXiv  Detail & Related papers  (2026-05-07T18:32:15Z)
• Solving physics-constrained inverse problems with conditional flow matching [0.6567875008573567]
  We present a conditional flow matching framework for solving physics-constrained inverse problems.<n>A neural network is trained to learn the velocity field of a probability flow ordinary differential equation.<n>We show that overtraining can induce behavior in the generated conditional distributions.
  arXiv  Detail & Related papers  (2026-03-14T21:43:48Z)
• Differentiable Stochastic Traffic Dynamics: Physics-Informed Generative Modelling in Transportation [0.0]
  This work develops a framework in which the physics constraint itself is distributional and spatial, derived from traffic-flow dynamics.<n>The framework provides a basis for distributional traffic-state estimation and for fundamental analysis in a physics-informed generative setting.
  arXiv  Detail & Related papers  (2026-03-10T04:25:20Z)
• On Exact Editing of Flow-Based Diffusion Models [97.0633397035926]
  We propose Conditioned Velocity Correction (CVC) to reformulate flow-based editing as a distribution transformation problem driven by a known source prior.<n>CVC rethinks the role of velocity in inter-distribution transformation by introducing a dual-perspective velocity conversion mechanism.<n>We show that CVC consistently achieves superior fidelity, better semantic alignment, and more reliable editing behavior across diverse tasks.
  arXiv  Detail & Related papers  (2025-12-30T06:29:20Z)
• On the Collapse of Generative Paths: A Criterion and Correction for Diffusion Steering [29.633206995806542]
  In-time steering enables pretrained diffusion/flow models to be adapted to new tasks without retraining.<n>This construction harbors a critical and previously unformalized failure mode: Marginal Path Collapse.<n>We introduce Adaptive path Correction with Exponents (ACE), which extends Feynman-Kac steering to time-varying exponents.
  arXiv  Detail & Related papers  (2025-12-11T06:44:08Z)
• Departures: Distributional Transport for Single-Cell Perturbation Prediction with Neural Schrödinger Bridges [51.83259180910313]
  A major bottleneck in gene function analysis is the unpaired nature of single-cell data.<n>We approximate Schrdinger Bridge (SB) to tackle unpaired single-cell perturbation data.<n>Our model effectively captures heterogeneous single-cell responses and achieves state-of-the-art performance.
  arXiv  Detail & Related papers  (2025-11-17T08:27:13Z)
• Gradient Variance Reveals Failure Modes in Flow-Based Generative Models [2.4223685315022867]
  We show that Rectified Flows learn ODE vector fields whose trajectories are straight between source and target distributions, enabling near one-step inference.<n>We prove that a memorizing vector field exists even when training interpolants intersect, and that optimizing the straight-path objective converges to this ill-defined field.
  arXiv  Detail & Related papers  (2025-10-20T21:37:11Z)
• Adaptive Conformal Prediction Intervals Over Trajectory Ensembles [50.31074512684758]
  Future trajectories play an important role across domains such as autonomous driving, hurricane forecasting, and epidemic modeling.<n>We propose a unified framework based on conformal prediction that transforms sampled trajectories into calibrated prediction intervals with theoretical coverage guarantees.
  arXiv  Detail & Related papers  (2025-08-18T21:14:07Z)
• 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)
• Adaptive Annealed Importance Sampling with Constant Rate Progress [68.8204255655161]
  Annealed Importance Sampling (AIS) synthesizes weighted samples from an intractable distribution. We propose the Constant Rate AIS algorithm and its efficient implementation for $alpha$-divergences.
  arXiv  Detail & Related papers  (2023-06-27T08:15:28Z)

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.