SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2401.09257 · 2024

A First-Order Multi-Gradient Algorithm for Multi-Objective Bi-Level Optimization

arXiv · PDF · Open in the Atlas

Code that ran

3 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, 0 violated it and 0 have no contract verdict; 2 failures of our instrument; 2 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/2401.09257.json · badge: /api/ran/2401.09257.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
baijiong-lin/forum canonical (classifier label)
classifier basis: census
3 ran · 2 no recorded run
FunctionStatusWhere it lives
conv1x1 Ran
ran; our contract draft was wrong, not the code
baijiong-lin/forum/LibMTL/model/resnet.py
pointer only (licence: NONE) · get_code("d9def42110729a85")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, baijiong-lin/forum 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.

conv3x3 Ran
ran; our contract draft was wrong, not the code
baijiong-lin/forum/LibMTL/model/resnet.py
pointer only (licence: NONE) · get_code("160bb14bd76201b4")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, baijiong-lin/forum 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.

count_improvement Ran
ran, honoured the contract we drafted
baijiong-lin/forum/LibMTL/utils.py
pointer only (licence: NONE) · get_code("5dac3fe14d3266fc")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, baijiong-lin/forum 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.

prepare_args Not yet run
unverified (harvested, no recorded run)
baijiong-lin/forum/LibMTL/config.py
pointer only (licence: NONE) · get_code("0d69bd947f5ec578")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, baijiong-lin/forum 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. No invocation recorded.

set_param Not yet run
unverified (harvested, no recorded run)
baijiong-lin/forum/LibMTL/utils.py
pointer only (licence: NONE) · get_code("246644b6e1dfd76d")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, baijiong-lin/forum 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. No invocation 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, 4 are also present in other papers whose code we hold (2 with at least one paper dated earlier, 2 the same month, 4 later) and 1 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.

FunctionAlso present inEarliest-datedOthers named
conv1x1 431 other papers
313 dated earlier, 8 the same month, 99 later, 10 same year, order not determinable, 1 undated · 38 only as an assembly brick
1409.1556 (2014-09)
Very Deep Convolutional Networks for Large-Scale Image Recognition
1506.01186 (2015-06)
Cyclical Learning Rates for Training Neural Networks
1507.05717 (2015-07)
An End-to-End Trainable Neural Network for Image-based Sequence Recognition and Its Application to Scene Text Recognition
and 428 more not named here
conv3x3 312 other papers
214 dated earlier, 6 the same month, 81 later, 10 same year, order not determinable, 1 undated · 31 only as an assembly brick
1409.1556 (2014-09)
Very Deep Convolutional Networks for Large-Scale Image Recognition
1507.05717 (2015-07)
An End-to-End Trainable Neural Network for Image-based Sequence Recognition and Its Application to Scene Text Recognition
1512.03385 (2015-12)
Deep Residual Learning for Image Recognition
and 309 more not named here
set_param 7 other papers
7 later · 2 only as an assembly brick
2405.18541 (2024-05)
Low-Rank Few-Shot Adaptation of Vision-Language Models
2501.10945 (2025-01)
Gradient-Based Multi-Objective Deep Learning: Algorithms, Theories, Applications, and Beyond
2505.22389 (2025-05)
Train with Perturbation, Infer after Merging: A Two-Stage Framework for Continual Learning
and 4 more not named here
count_improvement 2 other papers
2 later
2402.02009 (2024-02)
Robust Multi-Task Learning with Excess Risks
2501.10945 (2025-01)
Gradient-Based Multi-Objective Deep Learning: Algorithms, Theories, Applications, and Beyond

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

In this paper, we study the Multi-Objective Bi-Level Optimization (MOBLO) problem, where the upper-level subproblem is a multi-objective optimization problem and the lower-level subproblem is for scalar optimization. Existing gradient-based MOBLO algorithms need to compute the Hessian matrix, causing the computational inefficient problem. To address this, we propose an efficient first-order multi-gradient method for MOBLO, called FORUM. Specifically, we reformulate MOBLO problems as a constrained multi-objective optimization (MOO) problem via the value-function approach. Then we propose a novel multi-gradient aggregation method to solve the challenging constrained MOO problem. Theoretically, we provide the complexity analysis to show the efficiency of the proposed method and a non-asymptotic convergence result. Empirically, extensive experiments demonstrate the effectiveness and efficiency of the proposed FORUM method in different learning problems. In particular, it achieves state-of-the-art performance on three multi-task learning benchmark datasets. The code is available at https://github.com/Baijiong-Lin/FORUM.

For agents

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

get_harvested_code_for_paper("2401.09257")
get_code_for_paper("2401.09257")
have("2401.09257")

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

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

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

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

Connect an agent — have() is free.