Papers › DFM: Interpolant-free Dual Flow Matching
DFM: Interpolant-free Dual Flow Matching
Denis Gudovskiy, Tomoyuki Okuno, Yohei Nakata
Continuous normalizing flows (CNFs) can model data distributions with expressive infinite-length architectures. But this modeling involves computationally expensive process of solving an ordinary differential equation (ODE) during maximum likelihood training. Recently proposed flow matching (FM) framework allows to substantially simplify the training phase using a regression objective with the interpolated forward vector field. In this paper, we propose an interpolant-free dual flow matching (DFM) approach without explicit assumptions about the modeled vector field. DFM optimizes the forward and, additionally, a reverse vector field model using a novel objective that facilitates bijectivity of the forward and reverse transformations. Our experiments with the SMAP unsupervised anomaly detection show advantages of DFM when compared to the CNF trained with either maximum likelihood or FM objectives with the state-of-the-art performance metrics.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
Code
No code repository is listed for this paper in the archive or in Syntology's graph.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Unsupervised Anomaly Detection | SMAP | DFM (flow matching) | AUC | 98.6 | #1 of 9 | Archive leaderboard | report |
| Unsupervised Anomaly Detection | SMAP | DFM (flow matching) | F1 | 94.1 | #1 of 9 | Archive leaderboard | report |
| Unsupervised Anomaly Detection | SMAP | DFM (flow matching) | Precision | 89.7 | #1 of 9 | Archive leaderboard | report |
| Unsupervised Anomaly Detection | SMAP | DFM (flow matching) | Recall | 98.9 | #1 of 9 | Archive leaderboard | report |
Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.
Methods
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections