Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 33 min ago
PreprintarXiv licencearXiv

Flow Matching for Count Data

Abstract

High-dimensional count data arise in applications such as single-cell RNA sequencing and neural spike trains, where mappings between distributions across successive batches or time points form critical components of data analysis. The recent success of diffusion- and flow-based deep generative models for images, video, and text motivates extending these ideas to count-valued settings, but many existing methods either treat each count as a categorical state or transform counts into a continuous space, neither of which is natural or efficient when the count range is large. We propose count-FM, a flow-matching framework for count data based on a continuous-time birth-death process with local unit jumps. Count-FM learns marginal transitions efficiently in count space through simulation-free training of conditional transition rates, allowing transport between arbitrary count-distributed source and target populations. In simulation, count-FM variants achieve strong sample quality while using substantially fewer parameters. We further apply count-FM to scRNA-seq and neural spike-train data for unconditional generation, transport, and conditional generation. Across these tasks, count-FM yields improved sample quality, greater modeling efficiency, and interpretable transport paths.

Related

  1. ForceFlowAb: physics-aware mixture-of-experts flow matching model for antibody CDRs design
    Z. Li, Z. Lv, G. Zhang
    bioRxivPreprintAll rights reservedFull textBioinformatics & computational biologybioRxiv
  2. TopoFlow: Evolutionarily Conditioned Flow Matching for Protein Conformational Ensemble Generation
    X. Yang, X. Cui, X. LI +4
    bioRxivPreprintAll rights reservedFull textBioinformatics & computational biologybioRxiv
  3. A Flow Matching Framework for Neural Representational Dissimilarity
    Zeyuan Ye, Xue-Xin Wei
    arXivPreprintCC BY 4.0Full textNeurosciencearXiv
  4. trFlow: ultrafast all-atom protein conformational ensemble generation via conditional flow matching
    C. Xiang, K. Zhao, Z. Peng +2
    bioRxivPreprintCC BY-NC-NDFull textBioinformatics & computational biologybioRxiv
  5. RiboDFM: Robust RNA sequence design using backbone-conditioned discrete flow matching
    X. Liu, X. An, Z. Peng +2
    bioRxivPreprintCC BY-NC-NDFull textBioinformatics & computational biologybioRxiv
BibTeX
@misc{wei2026flow,
  title = {{Flow Matching for Count Data}},
  author = {Ganchao Wei and John Pearson},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2605.07746},
  eprint = {2605.07746},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2605.07746},
}
RIS
TY  - UNPB
TI  - Flow Matching for Count Data
AU  - Ganchao Wei
AU  - John Pearson
PY  - 2026
DA  - 2026/09/22
PB  - arXiv
DO  - 10.48550/arxiv.2605.07746
UR  - https://arxiv.org/abs/2605.07746
AB  - High-dimensional count data arise in applications such as single-cell RNA sequencing and neural spike trains, where mappings between distributions across successive batches or time points form critical components of data analysis. The recent success of diffusion- and flow-based deep generative models for images, video, and text motivates extending these ideas to count-valued settings, but many existing methods either treat each count as a categorical state or transform counts into a continuous space, neither of which is natural or efficient when the count range is large. We propose count-FM, a flow-matching framework for count data based on a continuous-time birth-death process with local unit jumps. Count-FM learns marginal transitions efficiently in count space through simulation-free training of conditional transition rates, allowing transport between arbitrary count-distributed source and target populations. In simulation, count-FM variants achieve strong sample quality while using substantially fewer parameters. We further apply count-FM to scRNA-seq and neural spike-train data for unconditional generation, transport, and conditional generation. Across these tasks, count-FM yields improved sample quality, greater modeling efficiency, and interpretable transport paths.
ER  -