arXiv (All)
open access
Euclidean Distance-Based Flow Matching
Flow Matching has recently become popular as a technique for generative modeling with applications in many domains. In the standard Flow Matching formulation, we interpret the vector field as the solution of a least-squares regression problem, which is known to be sensitive to contamination. Therefo
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- LatentFM: A Latent Flow Matching Approach for Generative Medical Image Segmentation#984096
- Beyond the Manifold Hypothesis: Hybrid Spectral Parameterizations for Flow Matching#1116763
- Discriminative Flow Matching: Beyond Time-Conditioning in Generative Restoration via Flow-State Representations#927808
- Probabilistic Geodesic Flow Matching on Location-Scale Families#1128875
- Diffusion Flow Matching: Dimension-Improved KL Bounds and Wasserstein Guarantees#1203879
Record · ID 1344036
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive