{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/not-all-tickets-are-equal-and-we-know-it","title":"Pruning neural network models for gene regulatory dynamics using data and domain knowledge","arxiv_id":"2403.04805","date":"2024-03-05","proceeding":null,"authors":["Intekhab Hossain","Jonas Fischer","Rebekka Burkholz","John Quackenbush"],"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.","url_abs":"https://arxiv.org/abs/2403.04805v2","url_pdf":"https://arxiv.org/pdf/2403.04805v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"not-all-tickets-are-equal-and-we-know-it","repo_url":"https://github.com/quackenbushlab/dash","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"general-knowledge","task_name":"General Knowledge"},{"task_slug":"network-pruning","task_name":"Network Pruning"},{"task_slug":"scientific-discovery","task_name":"scientific discovery"}],"methods":[{"method_slug":"focus","method_name":"Focus"},{"method_slug":"pruning","method_name":"Pruning"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2403.04805","atlas_url":"https://app.syntology.ai/?focus=2403.04805","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.04805"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"deterministic:regex_extraction","url":"https://github.com/junjieliu2910/DynamicSparseTraining","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/quackenbushlab/dash","reach":null}],"summary":{"ran":2,"ran_honours":1},"by_repo_kind":{"official":{"samples":1,"ran":1,"repositories":1},"found_in_text":{"samples":2,"ran":2,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":2,"samples":[{"code_sha256_prefix":"29ed56ed3751e459","entry":"BinaryStep","repo":"junjieliu2910/DynamicSparseTraining","repo_kind":"found_in_text","path":"mnist_lstm/model/lstmcell.py","file_url":"https://github.com/junjieliu2910/DynamicSparseTraining/blob/HEAD/mnist_lstm/model/lstmcell.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"29ed56ed3751e459"}},{"code_sha256_prefix":"c1851573f5d680f6","entry":"MaskedLSTMCell","repo":"junjieliu2910/DynamicSparseTraining","repo_kind":"found_in_text","path":"mnist_lstm/model/lstmcell.py","file_url":"https://github.com/junjieliu2910/DynamicSparseTraining/blob/HEAD/mnist_lstm/model/lstmcell.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"c1851573f5d680f6"}},{"code_sha256_prefix":"889c166d1e9211c3","entry":"PathReg","repo":"quackenbushlab/dash","repo_kind":"official","path":"ode_net/code/pathreg_helper_PHX.py","file_url":"https://github.com/quackenbushlab/dash/blob/HEAD/ode_net/code/pathreg_helper_PHX.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"889c166d1e9211c3"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}