Self-Purifying Flow Matching (SPFM)

• Self-Purifying Flow Matching (SPFM) is a conditional generative modeling technique that evaluates per-sample losses to autonomously detect mislabeled data.
• It employs a dynamic routing mechanism by comparing conditional and unconditional losses to maintain fidelity in conditional updates.
• Empirical results demonstrate that SPFM significantly improves performance metrics in both synthetic and TTS datasets even under high label noise.

Self-Purifying Flow Matching (SPFM) is a methodology within conditional continuous-time generative modeling, designed to mitigate the adverse effects of label noise by automatically detecting and neutralizing mislabeled or unreliable conditioning data during training. Deployed within the classifier-free guidance (CFG) paradigm of flow matching, SPFM is characterized by a principled, in-training evaluation of per-sample losses for both conditional and unconditional branches. This assessment enables dynamic identification and selective routing of suspicious samples without reliance on external label quality estimators or architectural modifications (Kim et al., 23 Sep 2025, Yi et al., 19 Dec 2025).

1. Conceptual Underpinnings

SPFM operates in the context of flow matching, a framework where a parameterized time-dependent vector field $v_\theta(\mathbf{x},t)$ transports a tractable base distribution $p_0$ (frequently a standard Gaussian) to a target data distribution $p_1$. For conditional generation, each sample $\mathbf{x}_1$ is associated with a context $\mathbf{c}$ (such as a class label or text prompt). Label contamination—samples in which $\mathbf{c}$ is incorrect or unreliable—can result in significant performance degradation, manifesting as reduced conditional fidelity and increased generation artifacts.

The core innovation of SPFM is per-sample evaluation of the conditional loss $\mathcal{L}_{\mathrm{cond}}$ against the unconditional loss $\mathcal{L}_{\mathrm{uncond}}$. If, for a sample, conditioning increases the flow-matching error relative to the unconditional baseline, the label is flagged as unreliable, and the sample is excluded from conditional updates—effectively neutralizing its potential to corrupt the conditional branch while retaining its utility for modeling the unconditional data distribution (Kim et al., 23 Sep 2025, Yi et al., 19 Dec 2025).

2. Mathematical Framework

2.1. Standard Objectives

Assume data pairs $(\mathbf{x}_1, \mathbf{c})$ and independent $\mathbf{x}_0 \sim p_0(\mathbf{x})$. Interpolate:

$p_0$0

The parameterized velocity field $p_0$1 is trained with mean squared error, yielding the conditional flow-matching loss:

$p_0$2

Classifier-free guidance (CFG) implements joint training of both conditional and unconditional branches by randomly omitting $p_0$3 during training ($p_0$4), and combines predictions at sampling time (Kim et al., 23 Sep 2025).

2.2. Purification Score and Routing Logic

For a fixed interpolation $p_0$5, SPFM computes:

$p_0$6

If $p_0$7, the model regards the label as potentially incorrect and performs only an unconditional update. The per-sample SPFM objective:

$p_0$8

This can be succinctly written with an indicator:

$p_0$9

2.3. Algorithmic Workflow

A standard SPFM workflow involves a warm-up phase (to avoid misclassifying samples before the conditional branch becomes useful), followed by per-batch evaluation as outlined in the data's pseudocode (Kim et al., 23 Sep 2025, Yi et al., 19 Dec 2025). The integration overhead is minimal: two forward passes per sample for loss evaluation and a one-line routing decision.

3. Theoretical Insights and Empirical Robustness

SPFM is predicated on the observation that, for correctly labeled data, conditioning should reduce or maintain the loss ($p_1$0), whereas, for mislabeled data, conditioning typically increases the error ($p_1$1) (Kim et al., 23 Sep 2025, Yi et al., 19 Dec 2025). Empirically, the purification score $p_1$2 exhibits strong separation between clean and noisy samples: on the TITW-Easy split, an F$p_1$3 score of approximately $p_1$4 is reported for the detection criterion at $p_1$5.

SPFM demonstrates robust convergence properties and is stable in the presence of up to 40% label noise in synthetic settings. By converting noisy labels into unconditional updates, it prevents contamination of the conditional branch and preserves the alignment between generated output and specified condition (Kim et al., 23 Sep 2025).

4. Implementation Details and Model Integration

SPFM has been validated on both synthetic 2D data and large-scale text-to-speech (TTS) systems in-the-wild. In synthetic experiments, a simple linear architecture is adopted for $p_1$6, with 10% CFG dropout and label noise introduced via random label reassignment (40%). For TTS, SPFM is paired with the SupertonicTTS backbone, utilizing an AdamW optimizer, batch sizes of 128 (4$p_1$7RTX 4090, batch-expansion factor 8), learning rate of $p_1$8 with scheduled halving, and a purification warm-up of 40k iterations (Kim et al., 23 Sep 2025, Yi et al., 19 Dec 2025).

SPFM architecture is agnostic: integration involves only the training objective and does not require network modifications, additional modules, or external pre-trained models. In the Supertonic TTS setup, the routing between conditional and unconditional objectives is achieved by accessing both branches of the shared backbone per sample; the rest of the pipeline (duration loss, vocoder, etc.) remains unaltered (Yi et al., 19 Dec 2025).

5. Empirical Performance and Evaluation

5.1. Synthetic 2D Data

Under 40% label noise, SPFM recovers clean conditional shapes (two-circle, spiral) in all tested settings, while standard flow matching exhibits loss of conditionality. SPFM outperforms the baseline as measured by mean squared error (MSE) across all guidance weights $p_1$9 (Kim et al., 23 Sep 2025).

5.2. In-the-Wild Text-to-Speech

Empirical evaluation on TITW and the WildSpoof challenge demonstrates SPFM's impact on practical TTS robustness. Experiments on TITW-Easy and TITW-Hard show that SPFM delivers improved or preserved UTMOS (perceptual quality), DNSMOS (noise suppression), and significantly reduced WER (word error rate):

System	UTMOS	DNSMOS	WER (%)
SupertonicTTS	3.43 ± 0.01	2.84 ± 0.01	6.68
+ SPFM (Easy)	3.43 ± 0.01	2.86 ± 0.01	5.96
SupertonicTTS	3.50 ± 0.01	2.88 ± 0.01	7.60
+ SPFM (Hard)	3.55 ± 0.01	2.91 ± 0.01	6.86

On the WildSpoof TTS leaderboard, SPFM achieves the lowest WER among all teams for both seen (5.50%) and unseen (5.88%) speakers, with UTMOS and DNSMOS scores ranked in the second-highest cohort (Yi et al., 19 Dec 2025).

Dataset-level filtering analysis finds that SPFM retains $\mathbf{x}_1$097% of samples; the discarded 3% manifest low UTMOS and high WER, confirming reliable identification of low-quality data (Kim et al., 23 Sep 2025).

6. Practical Usage, Limitations, and Future Directions

A warm-up phase (e.g., 4 epochs for synthetic data, 40k iterations for TTS) is vital to avoid early misclassification, as the conditional branch is initially not yet predictive. The selection of purification time ($\mathbf{x}_1$1) is empirically optimal; significant deviation reduces discriminative capacity. The routing criterion $\mathbf{x}_1$2 is straightforward, but alternatives—such as learned or annealed margins, or aggregation across multiple $\mathbf{x}_1$3 values—may further improve reliability (Kim et al., 23 Sep 2025, Yi et al., 19 Dec 2025).

SPFM may be extended via reweighting (soft routing) rather than hard selection, curriculum learning, active (re-)labeling, or adaptation to other conditional generative settings (e.g., conditional diffusion for vision or acoustics). A noted limitation is the possibility of occasional misclassification if the conditional branch is undertrained or borderline clean samples are present; using a single $\mathbf{x}_1$4 may not suffice for all problem domains (Yi et al., 19 Dec 2025).

7. Significance and Broader Context

SPFM advances the discipline of robust conditional generative modeling, providing a scalable, lightweight training-time mechanism for self-purification without architectural intrusiveness or external supervision. Its empirical validation across synthetic and real-world TTS benchmarks affirms its practical impact for tasks characterized by imperfect conditioning labels or extensive label noise. The simplicity and generality of its core criterion—comparing conditional versus unconditional losses on a per-sample basis—position SPFM as a candidate for broad adoption in robust generative modeling pipelines, particularly in domains where label acquisition is error-prone or expensive (Kim et al., 23 Sep 2025, Yi et al., 19 Dec 2025).