{"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/variational-information-maximization-for","title":"Variational Information Maximization for Feature Selection","arxiv_id":"1606.02827","date":"2016-06-09","proceeding":"NeurIPS 2016 12","authors":["Shuyang Gao","Greg Ver Steeg","Aram Galstyan"],"abstract":"Feature selection is one of the most fundamental problems in machine\nlearning. An extensive body of work on information-theoretic feature selection\nexists which is based on maximizing mutual information between subsets of\nfeatures and class labels. Practical methods are forced to rely on\napproximations due to the difficulty of estimating mutual information. We\ndemonstrate that approximations made by existing methods are based on\nunrealistic assumptions. We formulate a more flexible and general class of\nassumptions based on variational distributions and use them to tractably\ngenerate lower bounds for mutual information. These bounds define a novel\ninformation-theoretic framework for feature selection, which we prove to be\noptimal under tree graphical models with proper choice of variational\ndistributions. Our experiments demonstrate that the proposed method strongly\noutperforms existing information-theoretic feature selection approaches.","url_abs":"http://arxiv.org/abs/1606.02827v1","url_pdf":"http://arxiv.org/pdf/1606.02827v1.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":"variational-information-maximization-for","repo_url":"https://github.com/BiuBiuBiLL/InfoFeatureSelection","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"feature-selection","task_name":"feature selection"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1606.02827","atlas_url":"https://app.syntology.ai/?focus=1606.02827","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1606.02827"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1606.02827\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1606.02827"},"call":"get_concepts_for_paper(arxiv_id=\"1606.02827\")"}],"by_repo":[{"repo":"BiuBiuBiLL/InfoFeatureSelection","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":"ddd6616bf24d69bcae7168f4969a698a9e3a7722019dd4324cba833cd2a642dd","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}