aiqbench analysis
This paper introduces Count Flow Map, a generative model designed specifically for high-dimensional count data by learning stochastic transitions directly in count space using Poisson births and Binomial deaths. Unlike standard diffusion models that often require sequential evaluations or operate on continuous variables, this approach enables high-quality generation with only one or few steps while preserving nonnegative integer constraints without predefined limits. The method demonstrates practical utility in single-cell drug perturbation prediction and neural population forecasting, offering a more efficient alternative for scientific applications involving discrete event dynamics.
Stochastic Flow Map for Count Data
arXiv:2609.23290v1 Announce Type: cross Abstract: High-dimensional count data are common in scientific applications, but most diffusion and flow models are designed for continuous or categorical data, and generation often requires many sequential model evaluations. We propose Count Flow Map, a generative model that learns finite-time transitions directly in count space for one- or few-step generation. Our model directly learns stochastic transitions over finite time intervals, using Poisson births and Binomial deaths to preserve nonnegative integer counts without a predefined maximum. These transition models are trained to match the underlying local birth--death dynamics and to maintain consistency across step sizes. We characterize the connection between local dynamics and finite-time transition consistency and derive a bound on the generation error. After validating Count Flow Map in several simulations, including a high-dimensional, high-count setting, we apply it to single-cell drug perturbation prediction and neural population forecasting, where it captures perturbation responses and supports forecasts of high-activity events with only one or a few model evaluations. Together, these experiments demonstrate that Count Flow Map enables high-quality generation directly in count space across inference budgets, from one-step to few-step generation, using a single trained model.
Abstract:High-dimensional count data are common in scientific applications, but most diffusion and flow models are designed for continuous or categorical data, and generation often requires many sequential model evaluations. We propose Count Flow Map, a generative model that learns finite-time transitions directly in count space for one- or few-step generation. Our model directly learns stochastic transitions over finite time intervals, using Poisson births and Binomial deaths to preserve nonnegative integer counts without a predefined maximum. These transition models are trained to match the underlying local birth--death dynamics and to maintain consistency across step sizes. We characterize the connection between local dynamics and finite-time transition consistency and derive a bound on the generation error. After validating Count Flow Map in several simulations, including a high-dimensional, high-count setting, we apply it to single-cell drug perturbation prediction and neural population forecasting, where it captures perturbation responses and supports forecasts of high-activity events with only one or a few model evaluations. Together, these experiments demonstrate that Count Flow Map enables high-quality generation directly in count space across inference budgets, from one-step to few-step generation, using a single trained model.
Machine Learning (stat.ML); Machine Learning (cs.LG)
arXiv:2609.23290 [stat.ML]
(or arXiv:2609.23290v1 [stat.ML] for this version)
https://doi.org/10.48550/arXiv.2609.23290 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 282 words
Related coverage

New Simulations Show Quantum Turbulence Forms Via Kibble-Zurek Mechanism
Quantum Zeitgeist · Jul 15, 2026
GVCC: Zero-Shot Video Compression via Codebook-Driven Stochastic Rectified Flow
arXiv · Sep 28, 2026
Reach-Avoid Certificates for Contact-based Stochastic Hybrid Systems
arXiv · Oct 14, 2026
Structured Testbench Generation for LLM-Driven HDL Design and Verification-Oriented Data Curation
arXiv · Jun 12, 2026