{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/beta-rank-a-robust-convolutional-filter","title":"Beta-Rank: A Robust Convolutional Filter Pruning Method For Imbalanced Medical Image Analysis","arxiv_id":"2304.07461","date":"2023-04-15","proceeding":null,"authors":["Morteza Homayounfar","Mohamad Koohi-Moghadam","Reza Rawassizadeh","Varut Vardhanabhuti"],"abstract":"As deep neural networks include a high number of parameters and operations, it can be a challenge to implement these models on devices with limited computational resources. Despite the development of novel pruning methods toward resource-efficient models, it has become evident that these models are not capable of handling \"imbalanced\" and \"limited number of data points\". We proposed a novel filter pruning method by considering the input and output of filters along with the values of the filters that deal with imbalanced datasets better than others. Our pruning method considers the fact that all information about the importance of a filter may not be reflected in the value of the filter. Instead, it is reflected in the changes made to the data after the filter is applied to it. In this work, three methods are compared with the same training conditions except for the ranking values of each method, and 14 methods are compared from other papers. We demonstrated that our model performed significantly better than other methods for imbalanced medical datasets. For example, when we removed up to 58% of FLOPs for the IDRID dataset and up to 45% for the ISIC dataset, our model was able to yield an equivalent (or even superior) result to the baseline model. To evaluate FLOP and parameter reduction using our model in real-world settings, we built a smartphone app, where we demonstrated a reduction of up to 79% in memory usage and 72% in prediction time. All codes and parameters for training different models are available at https://github.com/mohofar/Beta-Rank","url_abs":"https://arxiv.org/abs/2304.07461v2","url_pdf":"https://arxiv.org/pdf/2304.07461v2.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":"beta-rank-a-robust-convolutional-filter","repo_url":"https://github.com/mohofar/beta-rank","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"image-classification","task_name":"Image Classification"},{"task_slug":"medical-image-analysis","task_name":"Medical Image Analysis"},{"task_slug":"medical-image-classification","task_name":"Medical Image Classification"},{"task_slug":"network-pruning","task_name":"Network Pruning"}],"methods":[{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"pruning","method_name":"Pruning"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/image-classification-on-cifar-10","task":"Image Classification","dataset":"CIFAR-10","model":"Beta-Rank","rank_in_archive_order":166,"of":265,"metrics":{"Percentage correct":"93.97"},"uses_additional_data":false},{"leaderboard":"/sota/image-classification-on-cifar-100","task":"Image Classification","dataset":"CIFAR-100","model":"Beta-Rank","rank_in_archive_order":158,"of":211,"metrics":{"Accuracy":"74.01","Percentage correct":"74.01"},"uses_additional_data":false},{"leaderboard":"/sota/medical-image-classification-on-idrid","task":"Medical Image Classification","dataset":"IDRiD","model":"Beta-Rank","rank_in_archive_order":1,"of":2,"metrics":{"Accuracy":"81.88"},"uses_additional_data":false},{"leaderboard":"/sota/medical-image-classification-on-isic-2017","task":"Medical Image Classification","dataset":"ISIC 2017","model":"Beta-Rank","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy":"72.44"},"uses_additional_data":false},{"leaderboard":"/sota/network-pruning-on-cifar-100","task":"Network Pruning","dataset":"CIFAR-100","model":"Beta-Rank","rank_in_archive_order":3,"of":5,"metrics":{"Accuracy":"74.01"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"mohofar/beta-rank","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"699841d5f6804f6cbab08ea5018995d64007d5c157801afeb36f9bb98a0ced3d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}