Flow Matching for Count Data introduces count‑FM, a flow‑matching framework tailored to high‑dimensional count data such as single‑cell RNA sequencing and neural spike trains. The method models transitions with a continuous‑time birth‑death process that uses local unit jumps, enabling efficient, simulation‑free learning of conditional transition rates directly in count space. Experiments show that count‑FM variants achieve strong sample quality with fewer parameters and provide interpretable transport paths for tasks including unconditional generation, transport, and conditional generation on real biological datasets.
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...
CRNDiff is a new count‑native diffusion framework that uses stochastic chemical reaction networks to model nonnegative integer data such as single‑cell RNA sequencing. It provides a closed‑form forward‑noising kernel, enabling efficient reverse sampling via forward‑filtering backward‑sampling and data‑driven selection of the terminal noising time. The method also introduces tilted Feynman–Kac steering to sample rare subpopulations without retraining, and demonstrates superior conditional fidelity and marker‑level preservation on human heart scRNA‑seq data.
arXiv:2604. 03779v2 Announce Type: replace-cross Abstract: Diffusion models have excelled at generative tasks for both continuous and token-based domains, but their application to discrete ordinal data remains underdeveloped.
arXiv:2606. 07760v1 Announce Type: new Abstract: Understanding cellular phenotypes and how they respond to perturbations is critical for disease biology and therapeutic design.
arXiv:2607. 06652v1 Announce Type: new Abstract: Rough path signatures are a universal feature map for continuous paths and, via the expected signature, characterise path distributions.
arXiv:2602. 24201v2 Announce Type: replace Abstract: Estimating density ratios between pairs of intractable data distributions is a core problem in probabilistic modeling, enabling principled comparisons of sample likelihoods under different data-generating processes across conditions.
arXiv:2607. 06583v1 Announce Type: cross Abstract: DNA methylation (DNAm) serves as one of the most robust molecular biomarkers of biological aging.
arXiv:2606. 02133v1 Announce Type: cross Abstract: Non-monotonic sequence generation methods, such as masked diffusion models, provide a flexible alternative to left-to-right autoregressive modeling by allowing tokens to be generated in non-fixed and prescribed orders.
The paper introduces dFlowGRPO, a reinforcement learning framework tailored for discrete flow models (DFMs). It generalizes previous work on diffusion large language models by supporting various probability paths and non-masked source distributions, and formulates denoising as a Markov decision process that leverages transition rates and posterior models. Experiments on the multimodal DFM FUDOKI show that dFlowGRPO outperforms existing GRPO methods on text‑to‑image generation and matches continuous flow models on multimodal understanding tasks.
PuTR-CouT is a transformer‑based counting‑by‑tracking framework designed for camera‑trap image sequences. It generates synthetic training data using structural priors to create pseudo‑tracking labels, enabling the tracker to associate detections across frames and estimate per‑species counts. The method improves upon the MaxBoxCount baseline on the iWildCam 2021 benchmark, offering competitive counting results along with multi‑species predictions and track‑level verification.
arXiv:2606. 05327v1 Announce Type: new Abstract: Flow matching (FM) has emerged as a powerful framework for learning dynamic transport maps between two empirical distributions.
arXiv:2608. 15867v1 Announce Type: cross Abstract: Synthetic populations are critical inputs for activity-based travel demand models, yet generating realistic populations from limited survey data remains challenging.