{"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/accelerated-bregman-proximal-gradient-methods","title":"Accelerated Bregman Proximal Gradient Methods for Relatively Smooth Convex Optimization","arxiv_id":"1808.03045","date":"2018-08-09","proceeding":null,"authors":["Filip Hanzely","Peter Richtarik","Lin Xiao"],"abstract":"We consider the problem of minimizing the sum of two convex functions: one is differentiable and relatively smooth with respect to a reference convex function, and the other can be nondifferentiable but simple to optimize. We investigate a triangle scaling property of the Bregman distance generated by the reference convex function and present accelerated Bregman proximal gradient (ABPG) methods that attain an $O(k^{-\\gamma})$ convergence rate, where $\\gamma\\in(0,2]$ is the triangle scaling exponent (TSE) of the Bregman distance. For the Euclidean distance, we have $\\gamma=2$ and recover the convergence rate of Nesterov's accelerated gradient methods. For non-Euclidean Bregman distances, the TSE can be much smaller (say $\\gamma\\leq 1$), but we show that a relaxed definition of intrinsic TSE is always equal to 2. We exploit the intrinsic TSE to develop adaptive ABPG methods that converge much faster in practice. Although theoretical guarantees on a fast convergence rate seem to be out of reach in general, our methods obtain empirical $O(k^{-2})$ rates in numerical experiments on several applications and provide posterior numerical certificates for the fast rates.","url_abs":"https://arxiv.org/abs/1808.03045v3","url_pdf":"https://arxiv.org/pdf/1808.03045v3.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":"accelerated-bregman-proximal-gradient-methods","repo_url":"https://github.com/Microsoft/accbpg","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"accelerated-bregman-proximal-gradient-methods","repo_url":"https://github.com/linxiaolx/accbpg","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1808.03045","atlas_url":"https://app.syntology.ai/?focus=1808.03045","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.03045"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1808.03045"},"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":"1808.03045"},"call":"get_harvested_code_for_paper(arxiv_id=\"1808.03045\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"1808.03045"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1808.03045\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1808.03045"},"call":"get_concepts_for_paper(arxiv_id=\"1808.03045\")"}],"by_repo":[{"repo":"Microsoft/accbpg","kind":"official","samples":8,"ran":6,"instrument":0,"unverified":2},{"repo":"linxiaolx/accbpg","kind":"official","samples":3,"ran":3,"instrument":2,"unverified":0}],"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/1808.03045.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/1808.03045.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/linxiaolx/accbpg","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/Microsoft/accbpg","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran_fixture":2,"ran":6,"ran_honours":1,"unverified":2},"n_samples":11,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":2,"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":11,"ran":9,"n_ran_checked":7,"n_instrument":2,"repositories":2}},"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,"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","signature_not_shown":"the graph records a signature for this sample and it is not shown; signature_not_shown_because names why, as the export's field-exclusion reason","signature_not_shown_because":{"signature_is_harness_object_repr":"an argument's recorded type or element kind is a printout of an object in Syntology's harness (such as a mock object, a class or a pandas printout), not the type of an input, so it does not describe the call's shape"}},"n_ran_with_level_date":9,"n_ran_without_level_date":0,"n_ran_signature_not_shown":1,"levels_written_between":{"first":"2026-09-22","last":"2026-09-25","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":"9a55fc3fd11346ec","code_sha256_prefix":"9a55fc3fd11346ec","entry":"ABPG","repo":"linxiaolx/accbpg","repo_kind":"official","path":"accbpg/algorithms.py","file_url":"https://github.com/linxiaolx/accbpg/blob/HEAD/accbpg/algorithms.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"none","behaviour_fingerprint":false,"signature":"f:callable/0/?, h:MockBregmanDivergence/0/?, L:float/0/float, x0:ndarray/1/float, gamma:float/0/float, maxitrs:int/0/int, epsilon:float/0/float, theta_eq:bool/0/bool, restart:bool/0/bool, restart_rule:str/0/str, verbose:bool/0/bool, verbskip:int/0/int","fixture_out_type":"tuple","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"9a55fc3fd11346ec"}},{"code_sha256":"70d648a19e9e5f2a","code_sha256_prefix":"70d648a19e9e5f2a","entry":"BPG","repo":"linxiaolx/accbpg","repo_kind":"official","path":"accbpg/algorithms.py","file_url":"https://github.com/linxiaolx/accbpg/blob/HEAD/accbpg/algorithms.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"none","behaviour_fingerprint":false,"signature":"f:callable/0/?, h:BregmanDivergenceHandler/0/?, L:float/0/float, x0:ndarray/1/float, maxitrs:int/0/int, epsilon:float/0/float, linesearch:bool/0/bool, ls_ratio:float/0/float, verbose:bool/0/bool, verbskip:int/0/int","fixture_out_type":"tuple","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"70d648a19e9e5f2a"}},{"code_sha256":"6d3542f113696500","code_sha256_prefix":"6d3542f113696500","entry":"D_opt_FW","repo":"Microsoft/accbpg","repo_kind":"official","path":"accbpg/D_opt_alg.py","file_url":"https://github.com/Microsoft/accbpg/blob/HEAD/accbpg/D_opt_alg.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"V:ndarray/2/float, x0:ndarray/1/float, eps:float/0/float, maxitrs:int/0/int, verbose:bool/0/bool, verbskip:int/0/int","fixture_out_type":"tuple","level_recorded_at":"2026-09-25T10:37:12.143382+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"6d3542f113696500"}},{"code_sha256":"ebb43079607596cc","code_sha256_prefix":"ebb43079607596cc","entry":"D_opt_FW_away","repo":"Microsoft/accbpg","repo_kind":"official","path":"accbpg/D_opt_alg.py","file_url":"https://github.com/Microsoft/accbpg/blob/HEAD/accbpg/D_opt_alg.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"V:ndarray/2/float, x0:ndarray/1/float, eps:float/0/float, maxitrs:int/0/int, verbose:bool/0/bool, verbskip:int/0/int","fixture_out_type":"tuple","level_recorded_at":"2026-09-25T10:37:12.143382+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"ebb43079607596cc"}},{"code_sha256":"87864de3167417a5","code_sha256_prefix":"87864de3167417a5","entry":"D_opt_KYinit","repo":"Microsoft/accbpg","repo_kind":"official","path":"accbpg/applications.py","file_url":"https://github.com/Microsoft/accbpg/blob/HEAD/accbpg/applications.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"V:ndarray/2/float","fixture_out_type":"ndarray","level_recorded_at":"2026-09-25T10:37:12.143382+00:00","retrieve_with":{"tool":"get_code","code_sha256":"87864de3167417a5"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"87864de3167417a5"}},{"code_sha256":"8097e49b7557dfbf","code_sha256_prefix":"8097e49b7557dfbf","entry":"load_libsvm_file","repo":"Microsoft/accbpg","repo_kind":"official","path":"accbpg/utils.py","file_url":"https://github.com/Microsoft/accbpg/blob/HEAD/accbpg/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature_not_shown":true,"signature_not_shown_because":"signature_is_harness_object_repr","fixture_out_type":"tuple","level_recorded_at":"2026-09-25T10:37:12.143382+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"8097e49b7557dfbf"}},{"code_sha256":"39b1e2f7bd6e45fb","code_sha256_prefix":"39b1e2f7bd6e45fb","entry":"mnist_2digits","repo":"Microsoft/accbpg","repo_kind":"official","path":"accbpg/utils.py","file_url":"https://github.com/Microsoft/accbpg/blob/HEAD/accbpg/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"X:ndarray/2/float, y:ndarray/1/int, d1:int/0/int, d2:int/0/int","fixture_out_type":"tuple","level_recorded_at":"2026-09-25T10:37:12.143382+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"39b1e2f7bd6e45fb"}},{"code_sha256":"fb69d5f3793a0e5b","code_sha256_prefix":"fb69d5f3793a0e5b","entry":"shuffle_data","repo":"Microsoft/accbpg","repo_kind":"official","path":"accbpg/utils.py","file_url":"https://github.com/Microsoft/accbpg/blob/HEAD/accbpg/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"X:ndarray/2/float, y:ndarray/1/int","fixture_out_type":"tuple","level_recorded_at":"2026-09-25T10:37:12.143382+00:00","retrieve_with":{"tool":"get_code","code_sha256":"fb69d5f3793a0e5b"},"code_page":"/code/shuffle-data","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"fb69d5f3793a0e5b"}},{"code_sha256":"5aabc13a3b3cb060","code_sha256_prefix":"5aabc13a3b3cb060","entry":"solve_theta","repo":"linxiaolx/accbpg","repo_kind":"official","path":"accbpg/algorithms.py","file_url":"https://github.com/linxiaolx/accbpg/blob/HEAD/accbpg/algorithms.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"signature":"theta:float/0/float, gamma:float/0/float, gainratio:float/0/float","fixture_out_type":"float","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"5aabc13a3b3cb060"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"5aabc13a3b3cb060"}},{"code_sha256":"5ff255477435bde3","code_sha256_prefix":"5ff255477435bde3","entry":"D_opt_design","repo":"Microsoft/accbpg","repo_kind":"official","path":"accbpg/applications.py","file_url":"https://github.com/Microsoft/accbpg/blob/HEAD/accbpg/applications.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":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"5ff255477435bde3"}},{"code_sha256":"0779cc54868c0714","code_sha256_prefix":"0779cc54868c0714","entry":"D_opt_libsvm","repo":"Microsoft/accbpg","repo_kind":"official","path":"accbpg/applications.py","file_url":"https://github.com/Microsoft/accbpg/blob/HEAD/accbpg/applications.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":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"0779cc54868c0714"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"563bb7d304e3eb362a8ce00cac093a0172e091594af7cd68bc88153d6144883c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}