{"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/optimal-and-adaptive-monteiro-svaiter","title":"Optimal and Adaptive Monteiro-Svaiter Acceleration","arxiv_id":"2205.15371","date":"2022-05-30","proceeding":null,"authors":["Yair Carmon","Danielle Hausler","Arun Jambulapati","Yujia Jin","Aaron Sidford"],"abstract":"We develop a variant of the Monteiro-Svaiter (MS) acceleration framework that removes the need to solve an expensive implicit equation at every iteration. Consequently, for any $p\\ge 2$ we improve the complexity of convex optimization with Lipschitz $p$th derivative by a logarithmic factor, matching a lower bound. We also introduce an MS subproblem solver that requires no knowledge of problem parameters, and implement it as either a second- or first-order method by solving linear systems or applying MinRes, respectively. On logistic regression our method outperforms previous second-order momentum methods, but under-performs Newton's method; simply iterating our first-order adaptive subproblem solver performs comparably to L-BFGS.","url_abs":"https://arxiv.org/abs/2205.15371v2","url_pdf":"https://arxiv.org/pdf/2205.15371v2.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":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"optimal-and-adaptive-monteiro-svaiter","repo_url":"https://github.com/danielle-hausler/ms-optimal","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2205.15371","atlas_url":"https://app.syntology.ai/?focus=2205.15371","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.15371"}},"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":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/danielle-hausler/ms-optimal","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":6,"unverified":2},"by_repo_kind":{"official":{"samples":8,"ran":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":0,"samples":[{"code_sha256_prefix":"9eb479354b6cb855","entry":"basic_bisection_condition","repo":"danielle-hausler/ms-optimal","repo_kind":"official","path":"algorithms/bisection.py","file_url":"https://github.com/danielle-hausler/ms-optimal/blob/HEAD/algorithms/bisection.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"9eb479354b6cb855"}},{"code_sha256_prefix":"f20ec5118663a82d","entry":"first_order_oracle_results_summary","repo":"danielle-hausler/ms-optimal","repo_kind":"official","path":"algorithms/solvers.py","file_url":"https://github.com/danielle-hausler/ms-optimal/blob/HEAD/algorithms/solvers.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"f20ec5118663a82d"}},{"code_sha256_prefix":"c6cbbcf1e75ae336","entry":"gen_binary_synthetic_dataset","repo":"danielle-hausler/ms-optimal","repo_kind":"official","path":"dataset/gen_dataset.py","file_url":"https://github.com/danielle-hausler/ms-optimal/blob/HEAD/dataset/gen_dataset.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"c6cbbcf1e75ae336"}},{"code_sha256_prefix":"9a01858b9641bc76","entry":"gen_const_mean_vector","repo":"danielle-hausler/ms-optimal","repo_kind":"official","path":"dataset/gen_dataset.py","file_url":"https://github.com/danielle-hausler/ms-optimal/blob/HEAD/dataset/gen_dataset.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"9a01858b9641bc76"}},{"code_sha256_prefix":"5ba46eacdbd891e9","entry":"get_outputs","repo":"danielle-hausler/ms-optimal","repo_kind":"official","path":"algorithms/newton.py","file_url":"https://github.com/danielle-hausler/ms-optimal/blob/HEAD/algorithms/newton.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"5ba46eacdbd891e9"}},{"code_sha256_prefix":"5af6798f4e6b4728","entry":"maybe_to_arry","repo":"danielle-hausler/ms-optimal","repo_kind":"official","path":"dataset/custom_dataset.py","file_url":"https://github.com/danielle-hausler/ms-optimal/blob/HEAD/dataset/custom_dataset.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"5af6798f4e6b4728"}},{"code_sha256_prefix":"7498c1f486e35816","entry":"get_outputs","repo":"danielle-hausler/ms-optimal","repo_kind":"official","path":"algorithms/ms_algorithm.py","file_url":"https://github.com/danielle-hausler/ms-optimal/blob/HEAD/algorithms/ms_algorithm.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"7498c1f486e35816"}},{"code_sha256_prefix":"0053d8b694daf836","entry":"read_from_file","repo":"danielle-hausler/ms-optimal","repo_kind":"official","path":"dataset/gen_dataset.py","file_url":"https://github.com/danielle-hausler/ms-optimal/blob/HEAD/dataset/gen_dataset.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"0053d8b694daf836"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}