Pith. sign in

REVIEW 1 cited by

Causal Inference in Gene Regulatory Networks with GFlowNet: Towards Scalability in Large Systems

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2310.03579 v1 pith:34EQMFOG submitted 2023-10-05 cs.AI q-bio.MN

classification cs.AIq-bio.MN
keywords causalgrnsscalabilitygenestructurecycliclearningnetworks
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Understanding causal relationships within Gene Regulatory Networks (GRNs) is essential for unraveling the gene interactions in cellular processes. However, causal discovery in GRNs is a challenging problem for multiple reasons including the existence of cyclic feedback loops and uncertainty that yields diverse possible causal structures. Previous works in this area either ignore cyclic dynamics (assume acyclic structure) or struggle with scalability. We introduce Swift-DynGFN as a novel framework that enhances causal structure learning in GRNs while addressing scalability concerns. Specifically, Swift-DynGFN exploits gene-wise independence to boost parallelization and to lower computational cost. Experiments on real single-cell RNA velocity and synthetic GRN datasets showcase the advancement in learning causal structure in GRNs and scalability in larger systems.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Secrets of GFlowNets' Learning Behavior: A Theoretical Study

    cs.LG 2025-05 reject novelty 4.0 of 10

    The paper derives bounds for GFlowNet convergence, sample complexity, implicit regularization, and robustness, but the proofs do not support the stated rates.

Pith tools