Skip to content

Tracing Generated Samples to Training-Data Clusters in Flow-Matching Models

Aug 2026 · 0 citations · 16 references
Computer Science

TL;DR

This work investigates attribution in flow-matching models through a hybrid analytical--learned approach, and uses it to derive trajectory-based attribution scores at the cluster level, which show that semantic similarity constitutes a strong baseline, while the closed-form trajectory-based attribution is competitive in some metrics without requiring counterfactual retraining or model gradients.

Abstract

Understanding which training samples influence a generated image is an important problem in generative modeling. In flow matching, training samples influence the generated image through the velocity field along the generation trajectory. Removing samples to examine their counterfactual influence changes the velocity field, and the resulting effect on the final image depends on how the change propagates through the trajectory. Consequently, local changes in the velocity field do not necessarily predict the final counterfactual effect. This work investigates attribution in flow-matching models through a hybrid analytical--learned approach, and uses it to derive trajectory-based attribution scores at the cluster level. We evaluate these attribution scores using independently retrained leave-one-cluster-out (LOCO) models, and compare with several attribution baselines using two different flow-matching latent spaces. Our experiments show that semantic similarity constitutes a strong baseline, while the closed-form trajectory-based attribution is competitive in some metrics without requiring counterfactual retraining or model gradients. Our results show that attribution in flow matching depends not only on semantic similarity to training samples, but also on the latent representation, trajectory dynamics, and how influence is propagated to the final output.

View source

Similar papers

#artificial intelligence Preprint Sep 2026

Distilling Diffusion Score Discrepancy for Efficient Training Data Attribution

Training data attribution for diffusion models aims to identify the training samples that influence a generated instance, but existing methods either require costly per-sample gradient computation or query-specific model optimization. Moreover, most methods attribute changes in a proxy loss rather than changes in the a...

Shi-Xuan Liu, Joan Serrà, Kin-Wai Cheuk et al. · 0 citations
Preprint Aug 2026

Difficulty-Calibrated Interpolation Paths for Conditional Flow Matching

This work shows that the regression difficulty of Conditional Flow Matching varies systematically along the path, and proposes Difficulty-Calibrated Flow Matching, which derives the schedule from the model itself: a short pilot run with the linear path records the per-time loss, and the schedule is set to the quantile...

Airin Akter Tania, Md Raihan Khan · 2 citations
Preprint Sep 2026

Discriminative Flow Matching: Beyond Time-Conditioning in Generative Restoration via Flow-State Representations

This work proposes Discriminative Flow Matching, which conditions the Flow-Matching velocity field on Discriminative Flow-State Representations rather than explicit time coordinates, and suggests that discriminative representations provide an effective state-aware alternative to explicit time conditioning.

Shrishti Saha Shetu, Emanuël A. P. Habets, Andreas Brendel · 0 citations
#machine learning Preprint Sep 2026

Unifying Distributional Training for One-Step Visual Generation

A unified theoretical framework is introduced that separates distribution modeling from matching discrepancy and connects global objectives to pointwise feature updates through Wasserstein gradient flow and motivates MGFlow, which models feature distributions with Gaussian mixtures at an adjustable granularity between...

Chi Zhang, Hao-Yan Shi, Yue-Yi Liu et al. · 2 citations
Preprint Sep 2026

VTV-FM: Flow Matching through Variational Terminal-Velocity Closure

Flow matching (FM) learns generative transport by fitting continuous-time motion from a simple source distribution to the data distribution. Most existing methods use first-order bridges: once a source and a target sample are paired, the path is a straight motion with constant velocity. FM with optimal transport (OT) i...

Hao-Yang Jiang, Yu-Heng Li, Di Yang et al. · 0 citations

UvA-DARE (Digital Academic Repository) Variational Flow Matching for Graph Generation

Based on this formulation of flow matching as variational inference, CatFlow is developed, a flow matching method for categorical data that is easy to implement, computationally efficient, and achieves strong results on graph generation tasks.

Floor Eijkelboom, G. Bartosh, C. Naesseth et al. · 0 citations

Related blog posts

Microsoft Research Blog Aug 11, 2026

Introducing CARE-X: Towards Clinically Useful Radiology VLMs with Auxiliary Supervision, Reward-Aligned Learning, and Tool-Augmented Measurement

Radiology AI is evolving beyond report generation. CARE-X explores a unified approach that combines flexible reasoning, calibrated predictions, and measurement-based tools for chest X-ray interpretation. The post Introducing CARE-X: Towards Clinically Useful Radiology VLMs with Auxiliary Supervision, Reward-Aligned Learning, and Tool-Augmented Measurement appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.