{"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/fedrts-federated-robust-pruning-via","title":"FedRTS: Federated Robust Pruning via Combinatorial Thompson Sampling","arxiv_id":"2501.19122","date":"2025-01-31","proceeding":null,"authors":["Hong Huang","Hai Yang","Yuan Chen","Jiaxun Ye","Dapeng Wu"],"abstract":"Federated Learning (FL) enables collaborative model training across distributed clients without data sharing, but its high computational and communication demands strain resource-constrained devices. While existing methods use dynamic pruning to improve efficiency by periodically adjusting sparse model topologies while maintaining sparsity, these approaches suffer from issues such as greedy adjustments, unstable topologies, and communication inefficiency, resulting in less robust models and suboptimal performance under data heterogeneity and partial client availability. To address these challenges, we propose Federated Robust pruning via combinatorial Thompson Sampling (FedRTS), a novel framework designed to develop robust sparse models. FedRTS enhances robustness and performance through its Thompson Sampling-based Adjustment (TSAdj) mechanism, which uses probabilistic decisions informed by stable, farsighted information instead of deterministic decisions reliant on unstable and myopic information in previous methods. Extensive experiments demonstrate that FedRTS achieves state-of-the-art performance in computer vision and natural language processing tasks while reducing communication costs, particularly excelling in scenarios with heterogeneous data distributions and partial client participation. Our codes are available at: https://github.com/Little0o0/FedRTS","url_abs":"https://arxiv.org/abs/2501.19122v2","url_pdf":"https://arxiv.org/pdf/2501.19122v2.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":[],"tasks":[{"task_slug":"federated-learning","task_name":"Federated Learning"},{"task_slug":"thompson-sampling","task_name":"Thompson Sampling"}],"methods":[{"method_slug":"pruning","method_name":"Pruning"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2501.19122","atlas_url":"https://app.syntology.ai/?focus=2501.19122","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.19122"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+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":"deterministic:regex_extraction","url":"https://github.com/Little0o0/FedRTS","reach":null}],"summary":{"ran_honours":1,"ran_draft_wrong":1,"unverified":1},"by_repo_kind":{"found_in_text":{"samples":3,"ran":2,"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":3,"samples":[{"code_sha256_prefix":"a1923181bd77db46","entry":"f_decay","repo":"Little0o0/FedRTS","repo_kind":"found_in_text","path":"api/distributed/fedrts/FedRTSAggregator.py","file_url":"https://github.com/Little0o0/FedRTS/blob/HEAD/api/distributed/fedrts/FedRTSAggregator.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"a1923181bd77db46"}},{"code_sha256_prefix":"27fcda30730d87dc","entry":"transform_list_to_tensor","repo":"Little0o0/FedRTS","repo_kind":"found_in_text","path":"api/distributed/fedrts/FedRTSAggregator.py","file_url":"https://github.com/Little0o0/FedRTS/blob/HEAD/api/distributed/fedrts/FedRTSAggregator.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"27fcda30730d87dc"}},{"code_sha256_prefix":"de1b93f599d4d752","entry":"FedRTSAggregator","repo":"Little0o0/FedRTS","repo_kind":"found_in_text","path":"api/distributed/fedrts/FedRTSAggregator.py","file_url":"https://github.com/Little0o0/FedRTS/blob/HEAD/api/distributed/fedrts/FedRTSAggregator.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"de1b93f599d4d752"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}