Browse State-of-the-Art › Multi-Task Learning

Multi-Task Learning

1,306 papers with code · 8 benchmarks · 59 datasets archive 2025-07-28

Methodology

Multi-task learning aims to learn multiple different tasks simultaneously while maximizing performance on one or all of the tasks.

( Image credit: Cross-stitch Networks for Multi-task Learning )

Description from the archive archive 2025-07-28.

Benchmarks archive 2025-07-28

8 leaderboard tables shown for this task, 8 with rows (a “benchmark” on this site is a table with at least one row, as on /sota), ordered by row count. “Best model” is the first row in the archive's own order at snapshot; nothing is re-ranked here and metric direction is not recorded in the archive. PwC's Trend sparklines are not in the archive, so that column is omitted.

DatasetBest model (first row in archive order)PaperCodeSyntologyCompare
QM9 (5 rows) BayesAgg-MTL Bayesian Uncertainty for Gradient Aggregation in Multi-Task Learning code Syntology ran 7 of 8 samples · 1 unverified Compare
Cityscapes test (3 rows) SwinMTL SwinMTL: A Shared Architecture for Simultaneous Depth Estimation... code — Compare
NYUv2 (2 rows) SwinMTL SwinMTL: A Shared Architecture for Simultaneous Depth Estimation... code — Compare
OMNIGLOT (2 rows) Gumbel-Matrix Routing Flexible Multi-task Networks by Learning Parameter Allocation — — Compare
CelebA (1 row) MGDA-UB Multi-Task Learning as Multi-Objective Optimization code Syntology ran 2 of 19 samples · 17 unverified Compare
ChestX-ray14 (1 row) BayesAgg-MTL Bayesian Uncertainty for Gradient Aggregation in Multi-Task Learning code Syntology ran 7 of 8 samples · 1 unverified Compare
UTKFace (1 row) BayesAgg-MTL Bayesian Uncertainty for Gradient Aggregation in Multi-Task Learning code Syntology ran 7 of 8 samples · 1 unverified Compare
wireframe dataset (1 row) LETR Line Segment Detection Using Transformers without Edges code Syntology ran 1 of 1 samples · 0 unverified Compare

Syntology column: samples harvested from the paper's repositories and executed on synthesized fixtures; “ran” is not a correctness claim and does not order the table. A dash means no Syntology record for that paper, not a recorded non-run. Read from the graph 2026-09-24.

Libraries

Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.

Datasets archive 2025-07-28

59 datasets whose archive record lists this task, ordered by the archive's paper count. 30 shown of 59 until expanded.

Subtasks archive 2025-07-28

2 subtasks in the archive's task tree.

Parent tasks archive 2025-07-28

Most implemented papers archive 2025-07-28

30 shown of 1,306 papers with code (3,687 tagged with this task in all), ordered by repositories listed in the archive, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers without a page here are shown as plain text.

Syntology lines on 17 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced. Read from the graph 2026-09-24.

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