Pruning neural network models for gene regulatory dynamics using data and domain knowledge
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 27 of its 67 references that are in the map. First posted on arXiv 5 Mar 2024.
Builds on
27 of 67 references.
References · 27
- 2018Neural Ordinary Differential Equationscited by 3,733
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2016Pruning Filters for Efficient ConvNetscited by 1,129
- 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
- 2017Learning Sparse Neural Networks through L0 Regularizationcited by 571
- 2016Learning Structured Sparsity in Deep Neural Networkscited by 538
- 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 475
- 2018Soft Filter Pruning for Accelerating Deep Convolutional Neural Networkscited by 313
- 2020Comparing Rewinding and Fine-tuning in Neural Network Pruningcited by 238
- 2019What's Hidden in a Randomly Weighted Neural Network?cited by 236
- 2019Deconstructing Lottery Tickets: Zeros, Signs, and the Supermaskcited by 206
15 more
- 2020Proving the Lottery Ticket Hypothesis: Pruning is All You Needcited by 200
- 2020Soft Threshold Weight Reparameterization for Learnable Sparsitycited by 150
- 2019Winning the Lottery with Continuous Sparsificationcited by 99
- 2015Fast ConvNets Using Group-wise Brain Damagecited by 81
- 2020Optimal Lottery Tickets via SubsetSum: Logarithmic Over-Parameterization is Sufficientcited by 81
- 2020Logarithmic Pruning is All You Needcited by 71
- 2020Dynamic Sparse Training: Find Efficient Sparse Network From Scratch With Trainable Masked Layerscited by 66
- 2022Unmasking the Lottery Ticket Hypothesis: What's Encoded in a Winning Ticket's Mask?cited by 38
- 2022Rare Gems: Finding Lottery Tickets at Initializationcited by 34
- 2022Most Activation Functions Can Win the Lottery Without Excessive Depthcited by 21
- 2022A General Framework For Proving The Equivariant Strong Lottery Ticket Hypothesiscited by 19
- 2021Beyond Predictions in Neural ODEs: Identification and Interventionscited by 15
- 2021Sparse Flows: Pruning Continuous-depth Modelscited by 13
- 2021Plant 'n' Seek: Can You Find the Winning Ticket?cited by 13
- 2022Sparsity in Continuous-Depth Neural Networkscited by 10
Built on by
Citing papers per year: 2024: 1.
1 paper.