{"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/a-uniformly-stable-algorithm-for-unsupervised","title":"Algorithmic Stability and Generalization of an Unsupervised Feature Selection Algorithm","arxiv_id":"2010.09416","date":"2020-10-19","proceeding":"NeurIPS 2021 12","authors":["Xinxing Wu","Qiang Cheng"],"abstract":"Feature selection, as a vital dimension reduction technique, reduces data dimension by identifying an essential subset of input features, which can facilitate interpretable insights into learning and inference processes. Algorithmic stability is a key characteristic of an algorithm regarding its sensitivity to perturbations of input samples. In this paper, we propose an innovative unsupervised feature selection algorithm attaining this stability with provable guarantees. The architecture of our algorithm consists of a feature scorer and a feature selector. The scorer trains a neural network (NN) to globally score all the features, and the selector adopts a dependent sub-NN to locally evaluate the representation abilities for selecting features. Further, we present algorithmic stability analysis and show that our algorithm has a performance guarantee via a generalization error bound. Extensive experimental results on real-world datasets demonstrate superior generalization performance of our proposed algorithm to strong baseline methods. Also, the properties revealed by our theoretical analysis and the stability of our algorithm-selected features are empirically confirmed.","url_abs":"https://arxiv.org/abs/2010.09416v2","url_pdf":"https://arxiv.org/pdf/2010.09416v2.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":"a-uniformly-stable-algorithm-for-unsupervised","repo_url":"https://github.com/xinxingwu-uk/ufs","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"decision-making","task_name":"Decision Making"},{"task_slug":"dimensionality-reduction","task_name":"Dimensionality Reduction"},{"task_slug":"feature-selection","task_name":"feature selection"}],"methods":[{"method_slug":"feature-selection","method_name":"Feature Selection"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":"https://app.syntology.ai/?focus=2010.09416","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.09416"}},"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/xinxingwu-uk/ufs","reach":null}],"summary":{"ran_fixture":1,"ran_draft_wrong":2},"by_repo_kind":{"official":{"samples":3,"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":"f42b6bb917023ab6","entry":"hierarchy_top_k_keep","repo":"xinxingwu-uk/ufs","repo_kind":"official","path":"Python/AbsoluteAndOtherAlgorithms/Defined/Functions.py","file_url":"https://github.com/xinxingwu-uk/ufs/blob/HEAD/Python/AbsoluteAndOtherAlgorithms/Defined/Functions.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"f42b6bb917023ab6"}},{"code_sha256_prefix":"a54bab3cd077b5c6","entry":"top_k_keep","repo":"xinxingwu-uk/ufs","repo_kind":"official","path":"Python/AbsoluteAndOtherAlgorithms/Defined/Functions.py","file_url":"https://github.com/xinxingwu-uk/ufs/blob/HEAD/Python/AbsoluteAndOtherAlgorithms/Defined/Functions.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"a54bab3cd077b5c6"}},{"code_sha256_prefix":"8ae53fe8b9c568e9","entry":"top_k_keepWeights_1","repo":"xinxingwu-uk/ufs","repo_kind":"official","path":"Python/AbsoluteAndOtherAlgorithms/Defined/Functions.py","file_url":"https://github.com/xinxingwu-uk/ufs/blob/HEAD/Python/AbsoluteAndOtherAlgorithms/Defined/Functions.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"8ae53fe8b9c568e9"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}