{"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/learning-to-maximize-mutual-information-for","title":"Learning to Maximize Mutual Information for Dynamic Feature Selection","arxiv_id":"2301.00557","date":"2023-01-02","proceeding":null,"authors":["Ian Covert","Wei Qiu","Mingyu Lu","Nayoon Kim","Nathan White","Su-In Lee"],"abstract":"Feature selection helps reduce data acquisition costs in ML, but the standard approach is to train models with static feature subsets. Here, we consider the dynamic feature selection (DFS) problem where a model sequentially queries features based on the presently available information. DFS is often addressed with reinforcement learning, but we explore a simpler approach of greedily selecting features based on their conditional mutual information. This method is theoretically appealing but requires oracle access to the data distribution, so we develop a learning approach based on amortized optimization. The proposed method is shown to recover the greedy policy when trained to optimality, and it outperforms numerous existing feature selection methods in our experiments, thus validating it as a simple but powerful approach for this problem.","url_abs":"https://arxiv.org/abs/2301.00557v2","url_pdf":"https://arxiv.org/pdf/2301.00557v2.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":"learning-to-maximize-mutual-information-for","repo_url":"https://github.com/iancovert/dynamic-selection","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"},{"task_slug":"feature-selection","task_name":"feature selection"}],"methods":[{"method_slug":"feature-selection","method_name":"Feature Selection"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2301.00557","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.00557"}},"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/iancovert/dynamic-selection","reach":null}],"summary":{"ran":2,"ran_honours":1,"unverified":1},"by_repo_kind":{"official":{"samples":4,"ran":3,"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":"233c9ebbe363a9cc","entry":"ConcreteSelector","repo":"iancovert/dynamic-selection","repo_kind":"official","path":"dynamic_selection/greedy.py","file_url":"https://github.com/iancovert/dynamic-selection/blob/HEAD/dynamic_selection/greedy.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"233c9ebbe363a9cc"}},{"code_sha256_prefix":"158e57a1e13ee09d","entry":"GreedyDynamicSelection","repo":"iancovert/dynamic-selection","repo_kind":"official","path":"dynamic_selection/greedy.py","file_url":"https://github.com/iancovert/dynamic-selection/blob/HEAD/dynamic_selection/greedy.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"158e57a1e13ee09d"}},{"code_sha256_prefix":"f8d153b8569b0e13","entry":"make_onehot","repo":"iancovert/dynamic-selection","repo_kind":"official","path":"dynamic_selection/greedy.py","file_url":"https://github.com/iancovert/dynamic-selection/blob/HEAD/dynamic_selection/greedy.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"f8d153b8569b0e13"}},{"code_sha256_prefix":"01e0b17ac1cac60a","entry":"restore_parameters","repo":"iancovert/dynamic-selection","repo_kind":"official","path":"dynamic_selection/greedy.py","file_url":"https://github.com/iancovert/dynamic-selection/blob/HEAD/dynamic_selection/greedy.py","link_basis":"first_harvest_node","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":"01e0b17ac1cac60a"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}