Pith. sign in

REVIEW 1 cited by

Pruning neural network models for gene regulatory dynamics using data and domain knowledge

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 2403.04805 v2 pith:H6WENULH submitted 2024-03-05 cs.LG q-bio.QMstat.APstat.ML

classification cs.LGq-bio.QMstat.APstat.ML
keywords networkmodelsgenepruningdataneuralregulatorydash
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The practical utility of machine learning models in the sciences often hinges on their interpretability. It is common to assess a model's merit for scientific discovery, and thus novel insights, by how well it aligns with already available domain knowledge--a dimension that is currently largely disregarded in the comparison of neural network models. While pruning can simplify deep neural network architectures and excels in identifying sparse models, as we show in the context of gene regulatory network inference, state-of-the-art techniques struggle with biologically meaningful structure learning. To address this issue, we propose DASH, a generalizable framework that guides network pruning by using domain-specific structural information in model fitting and leads to sparser, better interpretable models that are more robust to noise. Using both synthetic data with ground truth information, as well as real-world gene expression data, we show that DASH, using knowledge about gene interaction partners within the putative regulatory network, outperforms general pruning methods by a large margin and yields deeper insights into the biological systems being studied.

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. Scalable iterative pruning of large language and vision models using block coordinate descent

    cs.LG 2024-11 conditional novelty 6.0 of 10

    An iterative block-coordinate-descent version of the Combinatorial Brain Surgeon outperforms one-shot Wanda pruning on DeiT and Mistral-7b, but without code release or error bars.

Pith tools