CoDiffGRN: Rethinking Gene Regulatory Network Inference via the BEELINE-KGC Benchmark and Co-evolutionary Discrete Diffusion
On the map: Diffusion models → Flow matching, time series and science
Abstract (arXiv)
Inferring gene regulatory networks (GRNs) from single-cell transcriptomic data is crucial for biological discovery, yet existing approaches suffer from a fundamental misalignment with real-world needs. Researchers typically seek a small set of high-confidence regulatory interactions for experimental validation, often involving previously unseen genes. However, current benchmarks rely on transductive splits with global classification metrics, while prevailing models struggle to generalize under inductive settings. To bridge this gap, we reformulate GRN inference as an inductive, ranking-centric graph completion problem and introduce benchmark, a new benchmark that incorporates an inductive gene-holdout split together with knowledge graph completion metrics to better evaluate top-ranked predictions. Building on this, we propose method, the first co-evolutionary discrete diffusion framework that jointly models biologically coherent discretized gene expression states and regulatory interactions for robust inductive generalization and improved top-ranked regulatory discovery. We further introduce TF-ALL Subgraph Sampling (TASS) for scalable training. Extensive experiments on benchmark show that method establishes new state-of-the-art performance, significantly outperforming existing methods in novel regulatory discovery, and ablation studies further verify the effectiveness of our design.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Flow matching, time series and science, one of 14 directions in Diffusion models. Builds on 8 of its 48 references that are in the map. First posted on arXiv 14 Jul 2026.
Builds on
8 of 48 references.
Closest ancestors · 3
Same direction, newest first
- 2024Graph Diffusion Transformers for Multi-Conditional Molecular Generation24 Jan
- 2023SaGess: Sampling Graph Denoising Diffusion Model for Scalable Graph Generation29 Jun
- 2022DiGress: Discrete Denoising diffusion for graph generation29 Sep
Other references · 5
- 2020Denoising Diffusion Probabilistic Modelscited by 21,076
- 2021Improved Denoising Diffusion Probabilistic Modelscited by 3,761
- 2021Structured Denoising Diffusion Models in Discrete State-Spacescited by 1,719
- 2021How Attentive are Graph Attention Networks?cited by 835
- 2023Data navigation on the ENCODE portalcited by 3
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2024LLM4GRN: Discovering Causal Gene Regulatory Networks with LLMs -- Evaluation through Synthetic Data Generation
- 2026Control-Anchored Residual Flow Matching Conditioned on Gene Geometry for Virtual Cell Perturbation Modeling
- 2026RegNetAgents: A Multi-Agent Framework for Cross-Network Regulatory Driver Identification in Cancer Genomics
- 2025Biological Pathway Guided Gene Selection Through Collaborative Reinforcement Learning
- 2026Continuous surrogates versus threshold Boolean networks for modeling Arabidopsis ISR gene regulation
- 2026What Topological and Geometric Structure Do Biological Foundation Models Learn? Evidence from 141 Hypotheses
- 2026Knowledge Graphs and Reasoning LLMs for Finding Simple Yet Effective Transcriptomic Perturbation Predictors
- 2026Orchestra: Corroboration-Based Regulatory Candidate Discovery via Composed Bioinformatics MCP Agents ↗