Training Flow Matching Models with Reliable Labels via Self-Purification

Hyeongju Kim, Yechan Yu, June Young Yi, Juheon Lee
9/23/2025
eess.AScs.AIcs.SD

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Training datasets are inherently imperfect, often containing mislabeled samples due to human annotation errors, limitations of tagging models, and other sources of noise. Such label contamination can significantly degrade the performance of a trained model. In this work, we introduce Self-Purifying Flow Matching (SPFM), a principled approach to filtering unreliable data within the flow-matching framework. SPFM identifies suspicious data using the model itself during the training process, bypassing the need for pretrained models or additional modules. Our experiments demonstrate that models trained with SPFM generate samples that accurately adhere to the specified conditioning, even when trained on noisy labels. Furthermore, we validate the robustness of SPFM on the TITW dataset, which consists of in-the-wild speech data, achieving performance that surpasses existing baselines.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{kim2025training,
  title  = {Training Flow Matching Models with Reliable Labels via Self-Purification},
  author = {Hyeongju Kim and Yechan Yu and June Young Yi and Juheon Lee},
  year   = {2025},
  eprint = {2509.19091},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2509.19091v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2509.19091.svg)](https://codeofpaper.com/paper/2509.19091)

Discussion