Papers › Accelerated Bregman Proximal Gradient Methods for Relatively Smooth Convex Optimization

Accelerated Bregman Proximal Gradient Methods for Relatively Smooth Convex Optimization

9 Aug 2018arXiv:1808.03045links table onlyarchive 2025-07-28

Filip Hanzely, Peter Richtarik, Lin Xiao

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

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^(-γ)) convergence rate, where γ∈(0,2] is the triangle scaling exponent (TSE) of the Bregman distance. For the Euclidean distance, we have γ=2 and recover the convergence rate of Nesterov's accelerated gradient methods. For non-Euclidean Bregman distances, the TSE can be much smaller (say γ≤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⁻²) rates in numerical experiments on several applications and provide posterior numerical certificates for the fast rates.

PaperPDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 11 code samples harvested from 2 repositories linked to this paper: 9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified. Where Syntology's instrument failed: 2 where the contract check could not run; failures of Syntology's instrument, not of the code.

By repository: official repository: 11 samples from 2 repositories, 9 ran (7 with no instrument failure; 2 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written between 2026-09-22 and 2026-09-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

Microsoft/accbpg officialmentioned in papermentioned on GitHubMITSyntology: 8 samples, 6 ran (0 instrument-failed) · 2 unverified report
linxiaolx/accbpg officialmentioned in papermentioned on GitHubSyntology: 3 samples, 3 ran (2 instrument-failed) · 0 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

11 samples harvested: 9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1ran · honoured contract
2ran; the contract check could not run
6ran
2unverified

Licence: 0 of the 11 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; the list below is grouped by repository, each group headed by its name and what it is to the paper. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives 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” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. For 1 sample that ran, the graph records a signature this page does not show: 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. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: 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. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

Microsoft/accbpg official repository 8 samples, 6 ran (0 instrument-failed) · 2 unverified
D_opt_FW accbpg/D_opt_alg.py ran MIT (permissive) · 6d3542f113696500 · report fixture: 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 · returned tuple · level recorded 2026-09-25
D_opt_FW_away accbpg/D_opt_alg.py ran MIT (permissive) · ebb43079607596cc · report fixture: 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 · returned tuple · level recorded 2026-09-25
D_opt_KYinit accbpg/applications.py ran fingerprinted MIT (permissive) · 87864de3167417a5 · report fixture: signature V:ndarray/2/float · returned ndarray · level recorded 2026-09-25
load_libsvm_file accbpg/utils.py ran MIT (permissive) · 8097e49b7557dfbf · report fixture: returned tuple · level recorded 2026-09-25
mnist_2digits accbpg/utils.py ran MIT (permissive) · 39b1e2f7bd6e45fb · report fixture: signature X:ndarray/2/float, y:ndarray/1/int, d1:int/0/int, d2:int/0/int · returned tuple · level recorded 2026-09-25
shuffle_data in 34 papers accbpg/utils.py ran fingerprinted MIT (permissive) · fb69d5f3793a0e5b · report fixture: signature X:ndarray/2/float, y:ndarray/1/int · returned tuple · level recorded 2026-09-25
D_opt_design accbpg/applications.py unverified MIT (permissive) · 5ff255477435bde3 · report
D_opt_libsvm accbpg/applications.py unverified MIT (permissive) · 0779cc54868c0714 · report
linxiaolx/accbpg official repository 3 samples, 3 ran (2 instrument-failed) · 0 unverified
ABPG accbpg/algorithms.py ran; the contract check could not run (RAISES) MIT (permissive) · 9a55fc3fd11346ec · report fixture: 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 · returned tuple · level recorded 2026-09-22
BPG accbpg/algorithms.py ran; the contract check could not run (RAISES) MIT (permissive) · 70d648a19e9e5f2a · report fixture: 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 · returned tuple · level recorded 2026-09-22
solve_theta accbpg/algorithms.py ran · honoured contract fingerprinted MIT (permissive) · 5aabc13a3b3cb060 · report fixture: signature theta:float/0/float, gamma:float/0/float, gainratio:float/0/float · returned float · level recorded 2026-09-22

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections