{"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/a-generalization-result-for-convergence-in","title":"A Generalization Result for Convergence in Learning-to-Optimize","arxiv_id":"2410.07704","date":"2024-10-10","proceeding":null,"authors":["Michael Sucker","Peter Ochs"],"abstract":"Learning-to-optimize leverages machine learning to accelerate optimization algorithms. While empirical results show tremendous improvements compared to classical optimization algorithms, theoretical guarantees are mostly lacking, such that the outcome cannot be reliably assured. Especially, convergence is hardly studied in learning-to-optimize, because conventional convergence guarantees in optimization are based on geometric arguments, which cannot be applied easily to learned algorithms. Thus, we develop a probabilistic framework that resembles classical optimization and allows for transferring geometric arguments into learning-to-optimize. Based on our new proof-strategy, our main theorem is a generalization result for parametric classes of potentially non-smooth, non-convex loss functions and establishes the convergence of learned optimization algorithms to critical points with high probability. This effectively generalizes the results of a worst-case analysis into a probabilistic framework, and frees the design of the learned algorithm from using safeguards.","url_abs":"https://arxiv.org/abs/2410.07704v2","url_pdf":"https://arxiv.org/pdf/2410.07704v2.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":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2410.07704","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.07704"}},"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":"deterministic:regex_extraction","url":"https://github.com/MichiSucker/COLA_2024","reach":null}],"summary":{"ran_draft_wrong":1,"ran_fixture":2},"by_repo_kind":{"found_in_text":{"samples":3,"ran":3,"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":"233ba649e3066a74","entry":"compute_sq_dist_to_point","repo":"MichiSucker/COLA_2024","repo_kind":"found_in_text","path":"experiments/nn_training/evaluation.py","file_url":"https://github.com/MichiSucker/COLA_2024/blob/HEAD/experiments/nn_training/evaluation.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"233ba649e3066a74"}},{"code_sha256_prefix":"d94289cbb7914ebb","entry":"estimate_conv_prob","repo":"MichiSucker/COLA_2024","repo_kind":"found_in_text","path":"experiments/quadratics/evaluation.py","file_url":"https://github.com/MichiSucker/COLA_2024/blob/HEAD/experiments/quadratics/evaluation.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"d94289cbb7914ebb"}},{"code_sha256_prefix":"05bd086d3417fb0a","entry":"estimate_suff_desc_prob","repo":"MichiSucker/COLA_2024","repo_kind":"found_in_text","path":"experiments/nn_training/evaluation.py","file_url":"https://github.com/MichiSucker/COLA_2024/blob/HEAD/experiments/nn_training/evaluation.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"05bd086d3417fb0a"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}