Towards Universal Gene Regulatory Network Inference: Unlocking Generalizable Regulatory Knowledge in Single-cell Foundation Models

• URL: http://arxiv.org/abs/2605.08128v1
• Date: Fri, 01 May 2026 01:45:24 GMT
• Title: Towards Universal Gene Regulatory Network Inference: Unlocking Generalizable Regulatory Knowledge in Single-cell Foundation Models
• Abstract summary: Single-cell Foundation Models (scFMs) are widely expected to revolutionize Gene Regulatory Network (GRN) inference.<n>We introduce a GRN generalization benchmark designed to evaluate regulatory predictions on unseen genes and datasets.<n>We propose two novel methods, Virtual Value Perturbation and Gradient Trajectory, to distill implicit regulatory information from scFMs into highly generalizable inter-gene features.
• Score: 20.71882970022078
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Gene Regulatory Network (GRN) inference is essential for understanding complex cellular mechanisms, rendered tractable through single-cell transcriptomic data. With the emergence of single-cell Foundation Models (scFMs), enhanced transcriptomic encoding is widely expected to revolutionize GRN inference. However, we observe that their performance remains far from satisfactory. The primary reason is that the standard reconstruction-based pre-training objectives often fail to explicitly capture latent regulatory signals. To bridge this gap, we first introduce a GRN generalization benchmark designed to evaluate regulatory predictions on unseen genes and datasets, which relies on the zero-shot capabilities of scFMs and is inherently challenging for traditional methods. Furthermore, to unlock the regulatory knowledge within the foundation models, we propose two novel methods, Virtual Value Perturbation and Gradient Trajectory, to distill implicit regulatory information from scFMs into highly generalizable inter-gene features. Extensive experiments demonstrate that our approach significantly outperforms existing methods, establishing a new paradigm for leveraging the potential of scFMs in universal GRN inference.

Related papers

• Deep and Probabilistic Models for Gene Regulatory Network Inference [0.0]
  Gene regulatory networks (GRNs) link transcription factor (TF) proteins to their target genes, yet reconstructing these networks from genome-wide data remains challenging under practical and methodological constraints.<n>In this thesis, we develop two complementary frameworks that address these limitations.<n>In the first, PMF-GRN casts GRN inference as a probabilistic graphical model optimized by variational inference, enabling principled model selection and uncertainty-aware edge estimates.<n>In the second, GLM-Prior addresses the prior bottleneck by fine-tuning the pretrained Nucleotide Transformer to predict TF-target gene interactions directly from nucleotide sequence, while general
  arXiv  Detail & Related papers  (2026-07-17T15:31:05Z)
• CoDiffGRN: Rethinking Gene Regulatory Network Inference via the BEELINE-KGC Benchmark and Co-evolutionary Discrete Diffusion [20.970593459575756]
  Inferring gene regulatory networks (GRNs) from single-cell transcriptomic data is crucial for biological discovery.<n>We reformulate GRN inference as an inductive, ranking-centric graph completion problem.<n>We introduce textbfbenchmark, a new benchmark that incorporates an inductive gene-holdout split together with knowledge graph completion metrics.
  arXiv  Detail & Related papers  (2026-07-14T16:07:23Z)
• CDFM: Towards a General-Purpose Causal Discovery Foundation Model [62.32138962508216]
  Causal discovery is the process of recovering underlying causal structures from observational data.<n>We formulate the Causal Discovery Foundation Model (CDFM) as a unified, general-purpose framework for zero-shot structural inference.<n>CDFM consistently outperforms traditional algorithms, driving a paradigm shift toward a general-purpose causal discovery foundation model.
  arXiv  Detail & Related papers  (2026-07-13T12:58:28Z)
• Large Vision-Language Models Get Lost in Attention [51.851592109135716]
  We propose a unified framework grounded in information theory and geometry to quantify the geometric and entropic nature of residual updates.<n>Applying this unified framework reveals a fundamental functional decoupling: Attention acts as a subspace-language operator focused on reconfiguration, whereas FFNs serve as subspace-language operators driving semantic innovation.
  arXiv  Detail & Related papers  (2026-05-07T04:45:52Z)
• Why Self-Supervised Encoders Want to Be Normal [0.0]
  We show that the preference for normal distributions in self-supervised encoders is a direct consequence of the Information Bottleneck (IB) principle.<n>Under this framework, we show that latent representations correspond to soft clustering of inputs sharing similar predictive distributions.<n>This perspective unifies a wide range of existing supervised and less-supervised objectives and provides a principled explanation for commonly used regularization schemes.
  arXiv  Detail & Related papers  (2026-04-30T11:33:05Z)
• QuantumQA: Enhancing Scientific Reasoning via Physics-Consistent Dataset and Verification-Aware Reinforcement Learning [19.224968023943052]
  We introduce QuantumQA, a large-scale dataset constructed via a task-adaptive strategy.<n>We propose the verification-aware reward model (VRM) tailored for Reinforcement Learning with Verifiable Rewards (RLVR)
  arXiv  Detail & Related papers  (2026-04-20T12:33:50Z)
• Joint Source-Channel-Generation Coding: From Distortion-oriented Reconstruction to Semantic-consistent Generation [58.67925548779465]
  We propose Joint Source-Channel-Generation Coding (JSCGC), a novel paradigm that shifts the focus from perceptual reconstruction to probabilistic generation.<n>JSCGC improves substantially semantic quality and semantic fidelity, significantly outperforming conventional distortion-oriented J SCC methods.
  arXiv  Detail & Related papers  (2026-01-19T08:12:47Z)
• Does Generative Retrieval Overcome the Limitations of Dense Retrieval? [117.49076770892583]
  Generative retrieval (GR) has emerged as a new paradigm in neural information retrieval.<n>We investigate how GR fundamentally diverges from dense retrieval (DR) in both learning objectives and representational capacity.
  arXiv  Detail & Related papers  (2025-09-26T09:38:01Z)
• Beyond Low-rankness: Guaranteed Matrix Recovery via Modified Nuclear Norm [52.00038315973684]
  The nuclear norm (NN) has been widely explored in matrix recovery problems, such as Robust PCA and matrix completion.<n>We introduce a new modified nuclear norm (MNN) framework, where the MNN family norms are defined by adopting suitable transformations and performing the NN on the transformed matrix.
  arXiv  Detail & Related papers  (2025-07-24T11:53:55Z)
• When Invariant Representation Learning Meets Label Shift: Insufficiency and Theoretical Insights [16.72787996847537]
  Generalized label shift (GLS) is the latest developed one which shows great potential to deal with the complex factors within the shift. Main results show the insufficiency of invariant representation learning, and prove the sufficiency and necessity of GLS correction for generalization. We propose a kernel embedding-based correction algorithm (KECA) to minimize the generalization error and achieve successful knowledge transfer.
  arXiv  Detail & Related papers  (2024-06-24T12:47:21Z)
• Ensemble Kalman Filtering Meets Gaussian Process SSM for Non-Mean-Field and Online Inference [47.460898983429374]
  We introduce an ensemble Kalman filter (EnKF) into the non-mean-field (NMF) variational inference framework to approximate the posterior distribution of the latent states. This novel marriage between EnKF and GPSSM not only eliminates the need for extensive parameterization in learning variational distributions, but also enables an interpretable, closed-form approximation of the evidence lower bound (ELBO) We demonstrate that the resulting EnKF-aided online algorithm embodies a principled objective function by ensuring data-fitting accuracy while incorporating model regularizations to mitigate overfitting.
  arXiv  Detail & Related papers  (2023-12-10T15:22:30Z)
• Toward Certified Robustness Against Real-World Distribution Shifts [65.66374339500025]
  We train a generative model to learn perturbations from data and define specifications with respect to the output of the learned model. A unique challenge arising from this setting is that existing verifiers cannot tightly approximate sigmoid activations. We propose a general meta-algorithm for handling sigmoid activations which leverages classical notions of counter-example-guided abstraction refinement.
  arXiv  Detail & Related papers  (2022-06-08T04:09:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.