ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Flow Matching models”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.CVEmpiricalRecentJun 9, 2026

Mean Flow Distillation: Robust and Stable Distillation for Flow Matching Models

An Zhao, Shengyuan Zhang, Zhongjian Sun, Yixiang Zhou +4 more

This paper proposes a novel distillation framework for flow matching models that enables high-fidelity single-step generation.

View →
cs.LGcs.AIRecentMay 29, 2026

Geometric Erasure by Contrastive Velocity Matching in Rectified Flows

Jonas Henry Grebe, Tobias Braun, Anna Rohrbach, Marcus Rohrbach

The paper introduces GEM, an effective concept erasure framework for Rectified Flow Transformers, by unifying trajectory-based unlearning with classic teacher-guided flow matching.

View →
cs.SDcs.AIeess.ASEmpiricalRecentJun 23, 2026

Beyond U-Net: A Latent-Representation-Aligned Skip-Free Backbone for Flow-Matching Speech Enhancement

Wangyi Pu, Michele Scarpiniti

This paper proposes a skip-free encoder-decoder backbone for flow-matching speech enhancement using Latent Representation Alignment.

View →
cs.SDcs.AIcs.LGEmpiricalRecentAug 4, 2026

InvFlowFD: Reference-Free and Background-Set-Free Perceptual Music Quality Metric with Flow Matching Inversion

Alon Ziv, Harel Pogoda, Yossi Adi

This paper proposes a background-set-free and reference-free music quality estimation method using unconditional Flow Matching inversion.

View →
cs.DCEmpiricalRecentJun 30, 2026

Omni-Flow: A Unified Workflow Orchestration and Distributed KV Cache Sharing Framework for Multimodal Inference

Bin Xiao, Jingfu Dong, Changran Wang, Yitian Chen +4 more

Omni-Flow is a distributed scheduling framework for multimodal inference that provides a unified abstraction for control flow, data flow, and compute flow.

View →
cs.LGEmpiricalRecentJul 23, 2026

Context-weighted Discrete Flow Matching

Daniil Cherniavskii, Daniel Severo, Karen Ullrich

The paper proposes a context-weighted sampler and scaled cross-entropy loss function for discrete generative modeling to improve generation quality and reduce generative perplexity.

View →
cs.LGRecentJun 1, 2026

Low-Pass Flow Matching

Francesco M. Ruscio, T. Konstantin Rusch

Low-Pass Flow Matching introduces a spectral bias into the flow matching process, allowing it to better model natural data by transitioning from a standard source spectrum to a frequency-decaying bias…

View →
cs.AIcs.CVcs.LGEmpiricalRecentNov 6, 2026

Flow-Guided Target-Space Alignment via Path Consistency

Ruizhi Yuan, Zeqiu Yu, Wei Gao, Wei Chen +2 more

This paper proposes a flow-guided target-space alignment method called FlowAlign that improves instance-level correspondence while preserving target-space structure in multimodal alignment problems.

View →
cs.DScs.CCTheoreticalRecentJul 16, 2026

Semi-Streaming Matching in a Single Pass II: Greedy is Optimal

Sepehr Assadi, Max Jiang, Mars Xiang

This paper proves that no single-pass semi-streaming algorithm can achieve a better-than-half approximation to the maximum matching problem, implying the optimality of the naive greedy algorithm.

View →
cs.DScs.CCTheoreticalRecentJul 16, 2026

Semi-Streaming Matching in a Single Pass I: A New Framework for Lower Bounds via Blueprints

Sepehr Assadi, Max Jiang, Mars Xiang

The paper develops a new framework for proving lower bounds for the maximum matching problem in the semi-streaming model, improving upon the previous best known bounds.

View →
cs.AIcs.DBcs.DSEmpiricalRecentJun 23, 2026

Can Aggregate Invariants Accelerate Continuous Subgraph Matching? Limits, Laws, and a Dynamic Spectral Index

Minghao Chen, Jiale Zheng

This paper investigates the use of spectral filtering for continuous subgraph matching over dynamic graphs and presents three key findings.

View →
cs.DSTheoreticalRecentJun 15, 2026

Online Matching with KIID Edge Arrivals

Yilong Feng, Haolong Li, Xiaowei Wu

This paper studies online stochastic matching in an edge arrival model, showing that competitive ratios better than 1-1/e are possible.

View →
cs.LGTheoreticalRecentJul 23, 2026

Expanding Flow Maps

Sophia Tang, Pranam Chatterjee

Introduces Expanding Generative Flows (EFlows) and Expanding Flow Maps (EFMs) for generating outputs of varying sizes in continuous and discrete state spaces.

View →
cs.CRcs.AIRecentJun 2, 2026

FlowGuard: Flow Matching for Identity-Independent Detection of Data-Free Model Stealing Attacks on Energy System Intrusion Detection Systems

Maxime Schwarzer, Laurin Holz, Tobias Huerten, Johannes Loevenich +3 more

FlowGuard introduces an identity-independent defense using flow matching to detect data-free model stealing attacks by identifying synthetic queries as out-of-distribution based on their lower-dimensi…

View →
cs.DBcs.AIcs.LGEmpiricalRecentJun 25, 2026

Understanding Domain-Aware Distribution Alignment in Budgeted Entity Matching

Nicholas Pulsone, Gregory Goren, Roee Shraga

This paper investigates the performance of BEACON, a state-of-the-art method for low-resource, domain-aware Entity Matching, under varying algorithmic choices and data availability conditions.

View →
cs.PLTheoreticalRecentJun 12, 2026

Formal Semantics and Type System for Vega Data Transformations

Kristýna Petrlíková, Tomas Petricek

This paper defines a graph-based operational semantics and type system for Vega, a declarative language for creating interactive data visualizations.

View →