SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2302.05185 · 2023

On Penalty-based Bilevel Gradient Descent Method

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; 1 honoured the contract we drafted, 3 violated it and 0 have no contract verdict; 1 failure of our instrument; 0 no recorded run), measured 2026-11-22; 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/2302.05185.json · badge: /api/ran/2302.05185.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
hanshen95/penalized-bilevel-gradient-descent canonical (classifier label)
classifier basis: classifier_2025
5 ran · 0 no recorded run
FunctionStatusWhere it lives
compute_acc Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
hanshen95/penalized-bilevel-gradient-descent/V-PBGD/data-hyper-cleaning/data_hyper_clean.py
pointer only (licence: NONE) · get_code("0e0f3de9c07cf33d")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, hanshen95/penalized-bilevel-gradient-descent 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.

dg Ran
ran, violated the contract we drafted
hanshen95/penalized-bilevel-gradient-descent/V-PBGD/toy/toy.py
pointer only (licence: NONE) · get_code("6b2c8a3979d0712e")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, hanshen95/penalized-bilevel-gradient-descent 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.

f Ran
ran, violated the contract we drafted
hanshen95/penalized-bilevel-gradient-descent/V-PBGD/toy/toy.py
pointer only (licence: NONE) · get_code("7e299e6776b649a1")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, hanshen95/penalized-bilevel-gradient-descent 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.

g Ran
ran, violated the contract we drafted
hanshen95/penalized-bilevel-gradient-descent/V-PBGD/toy/toy.py
pointer only (licence: NONE) · get_code("aaae9088694d9425")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, hanshen95/penalized-bilevel-gradient-descent 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.

loss_L2 Ran
ran, honoured the contract we drafted
hanshen95/penalized-bilevel-gradient-descent/V-PBGD/data-hyper-cleaning/data_hyper_clean.py
pointer only (licence: NONE) · get_code("7529f6f33361fe23")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, hanshen95/penalized-bilevel-gradient-descent 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-22.

Repositories linked to this paper

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

Abstract

Bilevel optimization enjoys a wide range of applications in emerging machine learning and signal processing problems such as hyper-parameter optimization, image reconstruction, meta-learning, adversarial training, and reinforcement learning. However, bilevel optimization problems are traditionally known to be difficult to solve. Recent progress on bilevel algorithms mainly focuses on bilevel optimization problems through the lens of the implicit-gradient method, where the lower-level objective is either strongly convex or unconstrained. In this work, we tackle a challenging class of bilevel problems through the lens of the penalty method. We show that under certain conditions, the penalty reformulation recovers the (local) solutions of the original bilevel problem. Further, we propose the penalty-based bilevel gradient descent (PBGD) algorithm and establish its finite-time convergence for the constrained bilevel problem with lower-level constraints yet without lower-level strong convexity. Experiments on synthetic and real datasets showcase the efficiency of the proposed PBGD algorithm.

For agents

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

get_harvested_code_for_paper("2302.05185")
get_code_for_paper("2302.05185")
have("2302.05185")

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

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

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

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

Connect an agent — have() is free.