Flow Duality and Source Geometry for Categorical Generation

• URL: http://arxiv.org/abs/2609.10863v2
• Date: Sun, 13 Sep 2026 12:17:34 GMT
• Title: Flow Duality and Source Geometry for Categorical Generation
• Abstract summary: Continuous and discrete flow matching are usually treated as separate constructions.<n>This paper identifies a duality between them: projecting continuous convex-interpolant flows with one-hot targets through a position-wise argmax yields discrete convex-interpolant flows.
• Score: 3.0458514384586404
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Continuous and discrete flow matching are usually treated as separate constructions. This paper identifies a duality between them: projecting continuous convex-interpolant flows with one-hot targets through a position-wise argmax yields discrete convex-interpolant flows. The result requires source laws with appropriate coordinate symmetry and regularity, and it makes the continuous source distribution an explicit design choice for categorical generation. We derive the induced discrete interpolation behavior for Gaussian, bounded-uniform, and centered negative-exponential sources, showing that different source geometries lead to qualitatively different transition timing and vocabulary-size dependence. Small visual diagnostics and a short language-modeling pilot suggest that these source-design effects can also appear in learned transports and early generative quality.

Related papers

• Fluid-DiT: Graph-Free Diffusion Transformers for Fluid Flow Simulations Learning [50.053186229257555]
  We propose a Graph-Free Diffusion Transformer that replaces graph message passing with attention-based denoising.<n>By leveraging the transformer's global receptive field, Fluid-DiT naturally captures both local flow structures and long-range correlations.<n>It consistently outperforms graph-based diffusion baselines in both sample quality and distributional accuracy.
  arXiv  Detail & Related papers  (2026-08-07T12:28:45Z)
• Disentangling Continuous-Time Latent Dynamics: Identifiability of Latent SDEs via Diffusion Shifts [60.95873409673775]
  identifiability in continuous-time latent differential equation models remains largely open.<n>We study additive-noise latent SDEs observed through an unknown nonlinear diffeomorphism.<n>We propose a two-stage estimator for latent disentanglement and optional graph recovery.
  arXiv  Detail & Related papers  (2026-06-26T16:18:28Z)
• Multi-Headed Transformer Architectures as Time-dependent Wasserstein Gradient Flows [16.7218879608165]
  We study the data flow in multi-headed transformer architectures as time-dependent gradient flows for a suitable interaction energy.<n>We prove the $$-convergence of the perturbed interaction energy to the unperturbed one, leading to the convergence of the corresponding gradient flows.<n>We complement these theoretical results with numerical experiments that confirm the predicted energy-dissipation identity and clarify the behavior of the dynamics in both the autonomous-like (Ornstein-Uhlenbeck) and the genuinely non-autonomous (oscillating-weights) regimes.
  arXiv  Detail & Related papers  (2026-05-15T15:32:18Z)
• SEED: Targeted Data Selection by Weighted Independent Set [76.68391670109433]
  We develop a robust and scalable data selection pipeline dubbed SEED.<n>SEED consistently outperforms state-of-the-art methods on instruction tuning, visual instruction tuning, and semantic segmentation.
  arXiv  Detail & Related papers  (2026-05-15T07:26:54Z)
• GeoFlowVLM: Geometry-Aware Joint Uncertainty for Frozen Vision-Language Embedding [3.0708725114491293]
  We propose textbfGeoFlowVLM as a post-hoc adapter that learns the joint distribution of paired $ell$-normalised dual-encoder VLM embeddings.<n>A consistency result shows that, in the population limit, the trained network exposes the joint flow and both cross-modal conditional flows.<n>We derive two quantities from this single model: a conditional retrieval entropy that quantifies aleatoric ambiguity with a decision-theoretic interpretation via a Fano-type bound, and a marginaltypicality score justified by an exact chain-rule decomposition of the joint NLL
  arXiv  Detail & Related papers  (2026-05-13T11:12:18Z)
• 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)
• Axiomatic On-Manifold Shapley via Optimal Generative Flows [9.595059073171269]
  Shapley-based attribution is critical for post-hoc XAI but suffers from off-manifold artifacts due to baselines.<n>We propose a formal theory of on-manifold Aumann-Shapley attributions driven by optimal generative flows.
  arXiv  Detail & Related papers  (2026-03-05T12:05:20Z)
• GeodesicNVS: Probability Density Geodesic Flow Matching for Novel View Synthesis [54.39598154430305]
  We propose a Data-to-Data Flow Matching framework that learns deterministic transformations directly between paired views.<n>PDG-FM constrains flow trajectories using geodesic interpolants derived from probability density metrics of pretrained diffusion models.<n>These results highlight the advantages of incorporating data-dependent geometric regularization into deterministic flow matching for consistent novel view generation.
  arXiv  Detail & Related papers  (2026-03-01T09:30:11Z)
• Flow Matching is Adaptive to Manifold Structures [32.55405572762157]
  Flow matching is a simulation-based alternative to diffusion-based generative modeling.<n>We show how flow matching adapts to data geometry and circumvents the curse of dimensionality.
  arXiv  Detail & Related papers  (2026-02-25T23:52:32Z)
• Variational Bayesian Flow Network for Graph Generation [54.94088904387278]
  We propose Variational Bayesian Flow Network (VBFN) for graph generation.<n>VBFN performs variational lifting to a tractable joint Gaussian variational belief family governed by structured precisions.<n>On synthetic and molecular graph datasets, VBFN improves fidelity and diversity, and surpasses baseline methods.
  arXiv  Detail & Related papers  (2026-01-30T03:59:38Z)
• Error Analysis of Discrete Flow with Generator Matching [34.847768962128164]
  We develop a unified framework grounded in calculus theory to investigate the theoretical properties of discrete flow models.<n>Specifically, we derive the KL divergence of two path measures regarding two continuous-time Markov chains with different transition rates.<n>We provide a comprehensive analysis that encompasses the error arising from transition rate estimation and early stopping.
  arXiv  Detail & Related papers  (2025-09-26T05:41:45Z)
• Independent projections of diffusions: Gradient flows for variational inference and optimal mean field approximations [0.0]
  This paper presents a construction, called the emphindependent projection, which is optimal for two natural criteria. First, when the original diffusion is reversible with invariant measure $rho_*$, the independent projection serves as the Wasserstein gradient flow for the relative entropy $H(cdot,|,rho_*)$ constrained to the space of product measures. Second, among all processes with independent coordinates, the independent projection is shown to exhibit the slowest growth rate of path-space entropy relative to the original diffusion.
  arXiv  Detail & Related papers  (2023-09-23T10:33:59Z)
• COMET Flows: Towards Generative Modeling of Multivariate Extremes and Tail Dependence [13.041607703862724]
  COMET Flows decompose the process of modeling a joint distribution into two parts: (i) modeling its marginal distributions, and (ii) modeling its copula distribution. Results on both synthetic and real-world datasets demonstrate the effectiveness of COMET Flows.
  arXiv  Detail & Related papers  (2022-05-02T21:37:54Z)
• Nonlinear Isometric Manifold Learning for Injective Normalizing Flows [58.720142291102135]
  We use isometries to separate manifold learning and density estimation. We also employ autoencoders to design embeddings with explicit inverses that do not distort the probability distribution.
  arXiv  Detail & Related papers  (2022-03-08T08:57:43Z)
• An Indirect Rate-Distortion Characterization for Semantic Sources: General Model and the Case of Gaussian Observation [83.93224401261068]
  Source model is motivated by the recent surge of interest in the semantic aspect of information. intrinsic state corresponds to the semantic feature of the source, which in general is not observable. Rate-distortion function is the semantic rate-distortion function of the source.
  arXiv  Detail & Related papers  (2022-01-29T02:14:24Z)
• Lifting the Convex Conjugate in Lagrangian Relaxations: A Tractable Approach for Continuous Markov Random Fields [53.31927549039624]
  We show that a piecewise discretization preserves better contrast from existing discretization problems. We apply this theory to the problem of matching two images.
  arXiv  Detail & Related papers  (2021-07-13T12:31:06Z)

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.