Generative Modeling with Flux Matching

• URL: http://arxiv.org/abs/2605.07319v1
• Date: Fri, 08 May 2026 06:28:23 GMT
• Title: Generative Modeling with Flux Matching
• Abstract summary: We introduce Flux Matching, a new paradigm for generative modeling that generalizes existing score-based models to a broader family of vector fields.<n>This flexibility enables a class of generative models that cannot be learned under score matching.<n>We show that Flux Matching performs strongly on high-dimensional image datasets.
• Score: 48.08053461764371
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We introduce Flux Matching, a new paradigm for generative modeling that generalizes existing score-based models to a broader family of vector fields that need not be conservative. Rather than requiring the model to equal the data score, the Flux Matching objective imposes a weaker condition that admits infinitely many vector fields whose stationary distribution is the data. This flexibility enables a class of generative models that cannot be learned under score matching, in which inductive biases, structural priors, and properties of the dynamics can be directly imposed or optimized. We show that Flux Matching performs strongly on high-dimensional image datasets and, more importantly, that our added freedom unlocks a range of applications including faster sampling, interpretable and mechanistic models, and dynamics that encode directed dependencies between variables. More broadly, Flux Matching opens a new dimension in generative modeling by turning the vector field itself into a design choice rather than a fixed target. Code is available at https://github.com/peterpaohuang/flux_matching.

Related papers

• Venom: A PyTorch Generative Modeling Toolkit [1.7248543886678744]
  V ENOM implements representative generative modeling families under a unified, MNIST-first interface.<n>The package currently includes diffusion and score-based models, flow matching and one-step generators, variational autoencoders, normalizing flows, generative adversarial networks, and energy-based models.
  arXiv  Detail & Related papers  (2026-05-17T19:06:46Z)
• SetFlow: Generating Structured Sets of Representations for Multiple Instance Learning [0.0]
  We introduce SetFlow, a generative architecture that models entire Multiple Instance Learning bags directly in the representation space.<n>We evaluate SetFlow on a large-scale mammography benchmark using a state-of-the-art MIL-PF classification pipeline.
  arXiv  Detail & Related papers  (2026-03-20T13:29:26Z)
• Preference Trajectory Modeling via Flow Matching for Sequential Recommendation [50.077447974294586]
  Sequential recommendation predicts each user's next item based on their historical interaction sequence.<n>FlowRec is a simple yet effective sequential recommendation framework.<n>We construct a personalized behavior-based prior distribution to replace Gaussian noise and learn a vector field to model user preference trajectories.
  arXiv  Detail & Related papers  (2025-08-25T02:55:42Z)
• Efficient Flow Matching using Latent Variables [9.363347684114474]
  We show that $texttLatent-CFM$ exhibits improved generation quality with significantly less training and computation than state-of-the-art flow matching models.<n>We also consider generative modeling of spatial fields stemming from physical processes.
  arXiv  Detail & Related papers  (2025-05-07T14:59:23Z)
• Promises and Pitfalls of Generative Masked Language Modeling: Theoretical Framework and Practical Guidelines [74.42485647685272]
  We focus on Generative Masked Language Models (GMLMs) We train a model to fit conditional probabilities of the data distribution via masking, which are subsequently used as inputs to a Markov Chain to draw samples from the model. We adapt the T5 model for iteratively-refined parallel decoding, achieving 2-3x speedup in machine translation with minimal sacrifice in quality.
  arXiv  Detail & Related papers  (2024-07-22T18:00:00Z)
• Pre-Trained Model Recommendation for Downstream Fine-tuning [22.343011779348682]
  Model selection aims to rank off-the-shelf pre-trained models and select the most suitable one for the new target task. Existing model selection techniques are often constrained in their scope and tend to overlook the nuanced relationships between models and tasks. We present a pragmatic framework textbfFennec, delving into a diverse, large-scale model repository.
  arXiv  Detail & Related papers  (2024-03-11T02:24:32Z)
• Disentanglement via Latent Quantization [60.37109712033694]
  In this work, we construct an inductive bias towards encoding to and decoding from an organized latent space. We demonstrate the broad applicability of this approach by adding it to both basic data-re (vanilla autoencoder) and latent-reconstructing (InfoGAN) generative models.
  arXiv  Detail & Related papers  (2023-05-28T06:30:29Z)
• Diffusion bridges vector quantized Variational AutoEncoders [0.0]
  We show that our model is competitive with the autoregressive prior on the mini-Imagenet dataset. Our framework also extends the standard VQ-VAE and enables end-to-end training.
  arXiv  Detail & Related papers  (2022-02-10T08:38:12Z)
• Goal-directed Generation of Discrete Structures with Conditional Generative Models [85.51463588099556]
  We introduce a novel approach to directly optimize a reinforcement learning objective, maximizing an expected reward. We test our methodology on two tasks: generating molecules with user-defined properties and identifying short python expressions which evaluate to a given target value.
  arXiv  Detail & Related papers  (2020-10-05T20:03:13Z)
• Semi-Supervised Learning with Normalizing Flows [54.376602201489995]
  FlowGMM is an end-to-end approach to generative semi supervised learning with normalizing flows. We show promising results on a wide range of applications, including AG-News and Yahoo Answers text data.
  arXiv  Detail & Related papers  (2019-12-30T17:36:33Z)

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.