{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"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":"https://syntology.ai/paper/2407.07084","atlas_url":"https://app.syntology.ai/?focus=2407.07084","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.07084"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2407.07084"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2407.07084"},"call":"get_harvested_code_for_paper(arxiv_id=\"2407.07084\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2407.07084"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2407.07084\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2407.07084"},"call":"get_concepts_for_paper(arxiv_id=\"2407.07084\")"}],"by_repo":[{"repo":"mlolab/s-dane","kind":"official","samples":15,"ran":10,"instrument":6,"unverified":5}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2407.07084.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2407.07084.svg"},"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":3,"ran_draft_wrong":6,"ran_violates":1,"unverified":5},"n_samples":15,"n_ran":10,"n_constructed":0,"n_ran_checked":4,"n_instrument":6,"n_unverified":5,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"official":{"samples":15,"ran":10,"n_ran_checked":4,"n_instrument":6,"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,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":10,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-24","last":"2026-09-24","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"3bc32482b7e6ace5","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,"signature":"a:float/0/float, b:float/0/float, vector1:list/1/Tensor, vector2:list/1/Tensor","fixture_out_type":"list","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mlolab/s-dane when it was checked","mcp_get_code":{"code_sha256":"3bc32482b7e6ace5"}},{"code_sha256":"029b117429ce49ea","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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"vector_list:dict/0/?","fixture_out_type":"list","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mlolab/s-dane when it was checked","mcp_get_code":{"code_sha256":"029b117429ce49ea"}},{"code_sha256":"759293e202b468dd","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,"signature":"clf_name:str/0/str, train_set:list/1/MinimalBatch","fixture_out_type":"Quadratic_model","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":"/code/get-classifier","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mlolab/s-dane when it was checked","mcp_get_code":{"code_sha256":"759293e202b468dd"}},{"code_sha256":"cfac3c404e669f4e","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,"signature":"dataset_name:str/0/str, split:str/0/str, datadir:str/0/str, exp_dict:dict/0/?","fixture_out_type":"DatasetWrapper","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":"/code/get-dataset","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mlolab/s-dane when it was checked","mcp_get_code":{"code_sha256":"cfac3c404e669f4e"}},{"code_sha256":"d7a2c7ec3d979bb1","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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"metric_name:str/0/str","fixture_out_type":"function","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mlolab/s-dane when it was checked","mcp_get_code":{"code_sha256":"d7a2c7ec3d979bb1"}},{"code_sha256":"493c4dd4d6a4d756","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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"fname:str/0/str, decode:NoneType/0/?","fixture_out_type":"dict","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":"/code/load-json","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mlolab/s-dane when it was checked","mcp_get_code":{"code_sha256":"493c4dd4d6a4d756"}},{"code_sha256":"50ab62fb90cfd1a3","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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"fname:str/0/str","fixture_out_type":"dict","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":"/code/load-pkl","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mlolab/s-dane when it was checked","mcp_get_code":{"code_sha256":"50ab62fb90cfd1a3"}},{"code_sha256":"b22ded125b44e841","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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"a:int/0/int, vector:list/1/int","fixture_out_type":"list","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","retrieve_with":{"tool":"get_code","code_sha256":"b22ded125b44e841"},"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mlolab/s-dane when it was checked","mcp_get_code":{"code_sha256":"b22ded125b44e841"}},{"code_sha256":"4c6787e9e326cb19","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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"fname:str/0/str","fixture_out_type":"list","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":"/code/read-text","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mlolab/s-dane when it was checked","mcp_get_code":{"code_sha256":"4c6787e9e326cb19"}},{"code_sha256":"1173582bb0065e73","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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"dataset:SimpleDataset/0/?, nb_users:int/0/int","fixture_out_type":"dict","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mlolab/s-dane when it was checked","mcp_get_code":{"code_sha256":"1173582bb0065e73"}},{"code_sha256":"b667f8007c622e6b","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,"code_page":"/code/get-model","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mlolab/s-dane when it was checked","mcp_get_code":{"code_sha256":"b667f8007c622e6b"}},{"code_sha256":"0ce85016c30f493a","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,"code_page":"/code/get-optimizer","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mlolab/s-dane when it was checked","mcp_get_code":{"code_sha256":"0ce85016c30f493a"}},{"code_sha256":"90fe3d7379deaea0","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,"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mlolab/s-dane when it was checked","mcp_get_code":{"code_sha256":"90fe3d7379deaea0"}},{"code_sha256":"4d8479a4925059d8","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,"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mlolab/s-dane when it was checked","mcp_get_code":{"code_sha256":"4d8479a4925059d8"}},{"code_sha256":"0236a198be4ab7d9","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,"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mlolab/s-dane when it was checked","mcp_get_code":{"code_sha256":"0236a198be4ab7d9"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"a1f5a683f579f62282bebb440e2f85291817abd9fbf47a16474c080547ff3a8c","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}