SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2402.06271 · 2024

Adaptive proximal gradient methods are universal without approximation

arXiv · PDF · Open in the Atlas

Code that ran

5 of 5 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 3 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 2 failures of our instrument; 0 no recorded run), measured 2026-11-21; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2402.06271.json · badge: /api/ran/2402.06271.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
emanuellaude/universal-adaptive-proximal-gradient canonical (classifier label)
classifier basis: census
5 ran · 0 no recorded run
FunctionStatusWhere it lives
fexp10 Ran
ran, honoured the contract we drafted
emanuellaude/universal-adaptive-proximal-gradient/benchmarks.py
pointer only (licence: NONE) · get_code("e31c5f68879604e8")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, emanuellaude/universal-adaptive-proximal-gradient when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

fman10 Ran
ran, honoured the contract we drafted
emanuellaude/universal-adaptive-proximal-gradient/benchmarks.py
pointer only (licence: NONE) · get_code("287853c146b4077b")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, emanuellaude/universal-adaptive-proximal-gradient when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

projection_simplex_sort Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
emanuellaude/universal-adaptive-proximal-gradient/convex_optim/function.py
pointer only (licence: NONE) · get_code("6d92cd03e0f67179")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, emanuellaude/universal-adaptive-proximal-gradient when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

prox_logistic Ran
ran; our contract draft was wrong, not the code
emanuellaude/universal-adaptive-proximal-gradient/convex_optim/function.py
pointer only (licence: NONE) · get_code("5e9e3d0d7fc8ecba")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, emanuellaude/universal-adaptive-proximal-gradient when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

shrinkage Ran
ran, honoured the contract we drafted
emanuellaude/universal-adaptive-proximal-gradient/convex_optim/function.py
pointer only (licence: NONE) · get_code("252798f71c9aebaa")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, emanuellaude/universal-adaptive-proximal-gradient when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

Also present in other papers' code

Of 5 samples lifted from this paper's linked repositories, 5 carry a function identity and 0 do not. Of the 5 distinct functions with an identity, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 later) and 5 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-21.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

We show that adaptive proximal gradient methods for convex problems are not restricted to traditional Lipschitzian assumptions. Our analysis reveals that a class of linesearch-free methods is still convergent under mere local Hölder gradient continuity, covering in particular continuously differentiable semi-algebraic functions. To mitigate the lack of local Lipschitz continuity, popular approaches revolve around $\varepsilon$-oracles and/or linesearch procedures. In contrast, we exploit plain Hölder inequalities not entailing any approximation, all while retaining the linesearch-free nature of adaptive schemes. Furthermore, we prove full sequence convergence without prior knowledge of local Hölder constants nor of the order of Hölder continuity. Numerical experiments make comparisons with baseline methods on diverse tasks from machine learning covering both the locally and the globally Hölder setting.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2402.06271")
get_code_for_paper("2402.06271")
have("2402.06271")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2402.06271.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2402.06271.svg)](https://syntology.ai/paper/2402.06271)

Connect an agent — have() is free.