arXiv:2607. 12616v1 Announce Type: new Abstract: Continuous-time generative frameworks construct probability paths between base and target domains by optimizing time-dependent velocity fields.
Continuous-time generative frameworks construct probability paths between base and target domains by optimizing time-dependent velocity fields. While theoretical targets favor straight trajectories, empirical networks develop complex path deformations.
High-fidelity image generation faces a trade-off between speed and quality. Diffusion models produce strong visuals but require costly iterative sampling.
arXiv:2607. 21427v1 Announce Type: new Abstract: Discrete flow matching provides a flexible framework for generative modeling on discrete structures.
arXiv:2410. 10137v5 Announce Type: replace Abstract: We develop Riemannian approaches to variational autoencoders (VAEs) for PDE-type ambient data with regularizing geometric latent dynamics, which we refer to as VAE-DLM, or VAEs with dynamical latent manifolds.
arXiv:2511. 10841v3 Announce Type: replace-cross Abstract: Modeling continuous-time dynamics from sparse and irregularly-sampled time series remains a fundamental challenge.
arXiv:2603. 13421v2 Announce Type: replace Abstract: Generative models based on the Flow Matching objective, particularly Rectified Flow, have emerged as a dominant paradigm for efficient, high-fidelity image synthesis.
arXiv:2606. 07481v1 Announce Type: new Abstract: While Computational Fluid Dynamics (CFD) provides high-fidelity flow fields for optimizing indoor environments, its computational cost limits rapid exploration.
arXiv:2606. 00140v1 Announce Type: cross Abstract: While the rapid adoption of multimodal generative models offers immense potential, it has also increased the risks of harmful content synthesis, deepfakes, and copyright infringements.
arXiv:2605. 00941v4 Announce Type: replace Abstract: Flow matching has become a leading framework for generative modeling, but quantifying the uncertainty of its samples remains an open problem.
arXiv:2605. 01729v2 Announce Type: replace Abstract: Generative Flow Networks (GFlowNets) learn to sample states proportional to an unnormalized reward.
arXiv:2603. 10718v3 Announce Type: replace Abstract: Flow Matching enables simulation-free training of generative models on Riemannian manifolds, yet sampling typically still relies on numerically integrating a probability-flow ODE.
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.