SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2006.16434 · ICML · 2020

Efficient Continuous Pareto Exploration in Multi-Task Learning

Pingchuan Ma, Tao Du, Wojciech Matusik

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, 0 violated it and 0 have no contract verdict; 4 failures of our instrument; 0 no recorded run), measured 2026-11-22; 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/2006.16434.json · badge: /api/ran/2006.16434.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
mit-gfx/ContinuousParetoMTL marked official in Papers with Code
Papers with Code archive
5 ran · 0 no recorded run
FunctionStatusWhere it lives
_min_norm_2d Ran
ran; our contract draft was wrong, not the code
mit-gfx/ContinuousParetoMTL/pareto/optim/min_norm_solver.py
pointer only (licence: NONE) · get_code("6b4535e71b3443c9")
How it ran

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

_min_norm_element_from2 Ran
ran, honoured the contract we drafted
mit-gfx/ContinuousParetoMTL/pareto/optim/min_norm_solver.py
pointer only (licence: NONE) · get_code("62754f5394a78501")
How it ran

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

_next_point Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
mit-gfx/ContinuousParetoMTL/pareto/optim/min_norm_solver.py
pointer only (licence: NONE) · get_code("1de2512786c971c3")
How it ran

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

_projection2simplex Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
mit-gfx/ContinuousParetoMTL/pareto/optim/min_norm_solver.py
pointer only (licence: NONE) · get_code("a4ce8c4af95a958f")
How it ran

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

find_min_norm_element Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
mit-gfx/ContinuousParetoMTL/pareto/optim/min_norm_solver.py
pointer only (licence: NONE) · get_code("0cd42644b034aaaf")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, mit-gfx/ContinuousParetoMTL 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

Tasks in multi-task learning often correlate, conflict, or even compete with each other. As a result, a single solution that is optimal for all tasks rarely exists. Recent papers introduced the concept of Pareto optimality to this field and directly cast multi-task learning as multi-objective optimization problems, but solutions returned by existing methods are typically finite, sparse, and discrete. We present a novel, efficient method that generates locally continuous Pareto sets and Pareto fronts, which opens up the possibility of continuous analysis of Pareto optimal solutions in machine learning problems. We scale up theoretical results in multi-objective optimization to modern machine learning problems by proposing a sample-based sparse linear system, for which standard Hessian-free solvers in machine learning can be applied. We compare our method to the stateof-the-art algorithms and demonstrate its usage of analyzing local Pareto sets on various multitask classification and regression problems. The experimental results confirm that our algorithm reveals the primary directions in local Pareto sets for trade-off balancing, finds more solutions with different trade-offs efficiently, and scales well to tasks with millions of parameters.

For agents

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

get_harvested_code_for_paper("2006.16434")
get_code_for_paper("2006.16434")
have("2006.16434")

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

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

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

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

Connect an agent — have() is free.