{"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/efficient-estimation-of-mutual-information","title":"Efficient Estimation of Mutual Information for Strongly Dependent Variables","arxiv_id":"1411.2003","date":"2014-11-07","proceeding":null,"authors":["Shuyang Gao","Greg Ver Steeg","Aram Galstyan"],"abstract":"We demonstrate that a popular class of nonparametric mutual information (MI)\nestimators based on k-nearest-neighbor graphs requires number of samples that\nscales exponentially with the true MI. Consequently, accurate estimation of MI\nbetween two strongly dependent variables is possible only for prohibitively\nlarge sample size. This important yet overlooked shortcoming of the existing\nestimators is due to their implicit reliance on local uniformity of the\nunderlying joint distribution. We introduce a new estimator that is robust to\nlocal non-uniformity, works well with limited data, and is able to capture\nrelationship strengths over many orders of magnitude. We demonstrate the\nsuperior performance of the proposed estimator on both synthetic and real-world\ndata.","url_abs":"http://arxiv.org/abs/1411.2003v3","url_pdf":"http://arxiv.org/pdf/1411.2003v3.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":"efficient-estimation-of-mutual-information","repo_url":"https://github.com/BiuBiuBiLL/MIE","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"efficient-estimation-of-mutual-information","repo_url":"https://github.com/BiuBiuBiLL/NPEET_LNC","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"efficient-estimation-of-mutual-information","repo_url":"https://github.com/gregversteeg/NPEET","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"efficient-estimation-of-mutual-information","repo_url":"https://gitlab.com/ita-ml/pyhard","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=1411.2003","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1411.2003"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+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":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/BiuBiuBiLL/NPEET_LNC","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://gitlab.com/ita-ml/pyhard","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/BiuBiuBiLL/MIE","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/gregversteeg/NPEET","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":3},"by_repo_kind":{"listed":{"samples":3,"ran":0,"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":0,"samples":[{"code_sha256_prefix":"fbc31af0253394cf","entry":"centropy","repo":"gregversteeg/NPEET","repo_kind":"listed","path":"npeet/entropy_estimators.py","file_url":"https://github.com/gregversteeg/NPEET/blob/HEAD/npeet/entropy_estimators.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"fbc31af0253394cf"}},{"code_sha256_prefix":"631c7d5fc16cefe2","entry":"entropy","repo":"gregversteeg/NPEET","repo_kind":"listed","path":"npeet/entropy_estimators.py","file_url":"https://github.com/gregversteeg/NPEET/blob/HEAD/npeet/entropy_estimators.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"631c7d5fc16cefe2"}},{"code_sha256_prefix":"6cc5bd04f80cb6bd","entry":"tc","repo":"gregversteeg/NPEET","repo_kind":"listed","path":"npeet/entropy_estimators.py","file_url":"https://github.com/gregversteeg/NPEET/blob/HEAD/npeet/entropy_estimators.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"6cc5bd04f80cb6bd"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}