{"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/fastlloyd-federated-accurate-secure-and","title":"FastLloyd: Federated, Accurate, Secure, and Tunable $k$-Means Clustering with Differential Privacy","arxiv_id":"2405.02437","date":"2024-05-03","proceeding":null,"authors":["Abdulrahman Diaa","Thomas Humphries","Florian Kerschbaum"],"abstract":"We study the problem of privacy-preserving $k$-means clustering in the horizontally federated setting. Existing federated approaches using secure computation suffer from substantial overheads and do not offer output privacy. At the same time, differentially private (DP) $k$-means algorithms either assume a trusted central curator or significantly degrade utility by adding noise in the local DP model. Naively combining the secure and central DP solutions results in a protocol with impractical overhead. Instead, our work provides enhancements to both the DP and secure computation components, resulting in a design that is faster, more private, and more accurate than previous work. By utilizing the computational DP model, we design a lightweight, secure aggregation-based approach that achieves five orders of magnitude speed-up over state-of-the-art related work. Furthermore, we not only maintain the utility of the state-of-the-art in the central model of DP, but we improve the utility further by designing a new DP clustering mechanism.","url_abs":"https://arxiv.org/abs/2405.02437v3","url_pdf":"https://arxiv.org/pdf/2405.02437v3.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":"fastlloyd-federated-accurate-secure-and","repo_url":"https://github.com/d-diaa/fastlloyd","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"constrained-clustering","task_name":"Constrained Clustering"},{"task_slug":"privacy-preserving","task_name":"Privacy Preserving"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2405.02437","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.02437"}},"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/d-diaa/fastlloyd","reach":null}],"summary":{"ran_violates":1,"ran_draft_wrong":1,"unverified":1},"by_repo_kind":{"official":{"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":"14b476eda188a4d6","entry":"get_cluster_associations","repo":"d-diaa/fastlloyd","repo_kind":"official","path":"utils/evaluations.py","file_url":"https://github.com/d-diaa/fastlloyd/blob/HEAD/utils/evaluations.py","link_basis":"first_harvest_node","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"14b476eda188a4d6"}},{"code_sha256_prefix":"c4ccd2f58807df6a","entry":"safe_metric","repo":"d-diaa/fastlloyd","repo_kind":"official","path":"utils/evaluations.py","file_url":"https://github.com/d-diaa/fastlloyd/blob/HEAD/utils/evaluations.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"c4ccd2f58807df6a"}},{"code_sha256_prefix":"3ce4034a231b69fd","entry":"evaluate","repo":"d-diaa/fastlloyd","repo_kind":"official","path":"utils/evaluations.py","file_url":"https://github.com/d-diaa/fastlloyd/blob/HEAD/utils/evaluations.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":"3ce4034a231b69fd"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}