{"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/stabilized-proximal-point-methods-for","title":"Stabilized Proximal-Point Methods for Federated Optimization","arxiv_id":"2407.07084","date":"2024-07-09","proceeding":null,"authors":["Xiaowen Jiang","Anton Rodomanov","Sebastian U. Stich"],"abstract":"In developing efficient optimization algorithms, it is crucial to account for communication constraints -- a significant challenge in modern Federated Learning. The best-known communication complexity among non-accelerated algorithms is achieved by DANE, a distributed proximal-point algorithm that solves local subproblems at each iteration and that can exploit second-order similarity among individual functions. However, to achieve such communication efficiency, the algorithm requires solving local subproblems sufficiently accurately resulting in slightly sub-optimal local complexity. Inspired by the hybrid-projection proximal-point method, in this work, we propose a novel distributed algorithm S-DANE. Compared to DANE, this method uses an auxiliary sequence of prox-centers while maintaining the same deterministic communication complexity. Moreover, the accuracy condition for solving the subproblem is milder, leading to enhanced local computation efficiency. Furthermore, S-DANE supports partial client participation and arbitrary stochastic local solvers, making it attractive in practice. We further accelerate S-DANE and show that the resulting algorithm achieves the best-known communication complexity among all existing methods for distributed convex optimization while still enjoying good local computation efficiency as S-DANE. Finally, we propose adaptive variants of both methods using line search, obtaining the first provably efficient adaptive algorithms that could exploit local second-order similarity without the prior knowledge of any parameters.","url_abs":"https://arxiv.org/abs/2407.07084v2","url_pdf":"https://arxiv.org/pdf/2407.07084v2.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":"stabilized-proximal-point-methods-for","repo_url":"https://github.com/mlolab/s-dane","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"federated-learning","task_name":"Federated Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":"https://app.syntology.ai/?focus=2407.07084","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.07084"}},"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/mlolab/s-dane","reach":{"status":"ok"}}],"summary":{"ran":10,"unverified":5},"by_repo_kind":{"official":{"samples":15,"ran":10,"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":15,"samples":[{"code_sha256_prefix":"3bc32482b7e6ace5","entry":"add_vectors","repo":"mlolab/s-dane","repo_kind":"official","path":"src/optimizers/accgradsliding.py","file_url":"https://github.com/mlolab/s-dane/blob/HEAD/src/optimizers/accgradsliding.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"3bc32482b7e6ace5"}},{"code_sha256_prefix":"029b117429ce49ea","entry":"compute_average_vectors","repo":"mlolab/s-dane","repo_kind":"official","path":"src/optimizers/accgradsliding.py","file_url":"https://github.com/mlolab/s-dane/blob/HEAD/src/optimizers/accgradsliding.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"029b117429ce49ea"}},{"code_sha256_prefix":"759293e202b468dd","entry":"get_classifier","repo":"mlolab/s-dane","repo_kind":"official","path":"src/base_classifier.py","file_url":"https://github.com/mlolab/s-dane/blob/HEAD/src/base_classifier.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"759293e202b468dd"}},{"code_sha256_prefix":"cfac3c404e669f4e","entry":"get_dataset","repo":"mlolab/s-dane","repo_kind":"official","path":"src/datasets.py","file_url":"https://github.com/mlolab/s-dane/blob/HEAD/src/datasets.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"cfac3c404e669f4e"}},{"code_sha256_prefix":"d7a2c7ec3d979bb1","entry":"get_metric_function","repo":"mlolab/s-dane","repo_kind":"official","path":"src/metrics.py","file_url":"https://github.com/mlolab/s-dane/blob/HEAD/src/metrics.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"d7a2c7ec3d979bb1"}},{"code_sha256_prefix":"493c4dd4d6a4d756","entry":"load_json","repo":"mlolab/s-dane","repo_kind":"official","path":"src/utils.py","file_url":"https://github.com/mlolab/s-dane/blob/HEAD/src/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"493c4dd4d6a4d756"}},{"code_sha256_prefix":"50ab62fb90cfd1a3","entry":"load_pkl","repo":"mlolab/s-dane","repo_kind":"official","path":"src/utils.py","file_url":"https://github.com/mlolab/s-dane/blob/HEAD/src/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"50ab62fb90cfd1a3"}},{"code_sha256_prefix":"b22ded125b44e841","entry":"multiply_number_vector","repo":"mlolab/s-dane","repo_kind":"official","path":"src/optimizers/accgradsliding.py","file_url":"https://github.com/mlolab/s-dane/blob/HEAD/src/optimizers/accgradsliding.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"b22ded125b44e841"}},{"code_sha256_prefix":"4c6787e9e326cb19","entry":"read_text","repo":"mlolab/s-dane","repo_kind":"official","path":"src/utils.py","file_url":"https://github.com/mlolab/s-dane/blob/HEAD/src/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"4c6787e9e326cb19"}},{"code_sha256_prefix":"1173582bb0065e73","entry":"split_index_iid","repo":"mlolab/s-dane","repo_kind":"official","path":"src/datasets.py","file_url":"https://github.com/mlolab/s-dane/blob/HEAD/src/datasets.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"1173582bb0065e73"}},{"code_sha256_prefix":"b667f8007c622e6b","entry":"get_model","repo":"mlolab/s-dane","repo_kind":"official","path":"src/models.py","file_url":"https://github.com/mlolab/s-dane/blob/HEAD/src/models.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":"b667f8007c622e6b"}},{"code_sha256_prefix":"0ce85016c30f493a","entry":"get_optimizer","repo":"mlolab/s-dane","repo_kind":"official","path":"src/optimizer.py","file_url":"https://github.com/mlolab/s-dane/blob/HEAD/src/optimizer.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":"0ce85016c30f493a"}},{"code_sha256_prefix":"90fe3d7379deaea0","entry":"polyhedron_loss","repo":"mlolab/s-dane","repo_kind":"official","path":"src/metrics.py","file_url":"https://github.com/mlolab/s-dane/blob/HEAD/src/metrics.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":"90fe3d7379deaea0"}},{"code_sha256_prefix":"4d8479a4925059d8","entry":"quadratic_loss","repo":"mlolab/s-dane","repo_kind":"official","path":"src/metrics.py","file_url":"https://github.com/mlolab/s-dane/blob/HEAD/src/metrics.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":"4d8479a4925059d8"}},{"code_sha256_prefix":"0236a198be4ab7d9","entry":"split_index_dirichlet","repo":"mlolab/s-dane","repo_kind":"official","path":"src/datasets.py","file_url":"https://github.com/mlolab/s-dane/blob/HEAD/src/datasets.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":"0236a198be4ab7d9"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}