{"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/heuristic-dropout-an-efficient-regularization","title":"Heuristic Dropout: An Efficient Regularization Method for Medical Image Segmentation Models","arxiv_id":null,"date":"2022-05-23","proceeding":"International Conference on Acoustics, Speech and Signal Processing 2022 5","authors":["Dachuan Shi","Ruiyang Liu","Linmi Tao","Chun Yuan"],"abstract":"For medical image segmentation in a real scenario, the amount of accurate annotation data at the pixel level is typically small, which tends to cause an overfitting problem. This manuscript goes deep into the research of the Dropout algorithm, which is commonly used in neural networks to alleviate the overfitting problem. From the perspective of solving the co-adaptation problem, this manuscript explains the basic principles of the Dropout algorithm and discusses the existing limitations of its derivative methods. Furthermore, we propose a novel Heuristic Dropout algorithm to address these limitations. The proposed algorithm takes information entropy and variance as heuristic rules. It guides our algorithm to drop features suffering from co-adaptation problem more efficiently and thus can better alleviate the overfitting problem of small-scale medical image segmentation datasets. Experiments on medical image segmentation datasets and models show that the proposed algorithm significantly improves the performance of these models.","url_abs":"https://ieeexplore.ieee.org/abstract/document/9747409","url_pdf":"https://ieeexplore.ieee.org/abstract/document/9747409","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":"heuristic-dropout-an-efficient-regularization","repo_url":"https://github.com/MindCode-4/code-12/tree/main/HeuristicDropout","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"heuristic-dropout-an-efficient-regularization","repo_url":"https://github.com/MindCode-4/code-7/tree/main/HeuristicDropout","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"heuristic-dropout-an-efficient-regularization","repo_url":"https://github.com/MindSpore-scientific-2/code-12/tree/main/HeuristicDropout","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"heuristic-dropout-an-efficient-regularization","repo_url":"https://github.com/mindspore-ai/contrib/tree/master/application/HeuristicDropout","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"heuristic-dropout-an-efficient-regularization","repo_url":"https://github.com/sdc17/HeuristicDropout","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"image-segmentation","task_name":"Image Segmentation"},{"task_slug":"medical-image-segmentation","task_name":"Medical Image Segmentation"},{"task_slug":"segmentation","task_name":"Segmentation"},{"task_slug":"semantic-segmentation","task_name":"Semantic Segmentation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"MindCode-4/code-12","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"MindCode-4/code-7","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2407.00342"],"harvested_for_calls":[{"arxiv_id":"2407.00342","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2407.00342"},"call":"get_harvested_code_for_paper(arxiv_id=\"2407.00342\")"}]},{"repo":"MindSpore-scientific-2/code-12","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2506.05982"],"harvested_for_calls":[{"arxiv_id":"2506.05982","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2506.05982"},"call":"get_harvested_code_for_paper(arxiv_id=\"2506.05982\")"}]},{"repo":"mindspore-ai/contrib","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2305.12102"],"harvested_for_calls":[{"arxiv_id":"2305.12102","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2305.12102"},"call":"get_harvested_code_for_paper(arxiv_id=\"2305.12102\")"}]},{"repo":"sdc17/HeuristicDropout","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"6d97b65c79aa0365c1ab703d87c23c7861e9e4dc938b4ee3fb1bdc00d258ed0c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}