Pith. sign in

REVIEW 2 cited by

Controllable Pareto Multi-Task Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2010.06313 v2 pith:EIO4PKYH submitted 2020-10-13 cs.LG stat.ML

classification cs.LGstat.ML
keywords trade-offdifferentmodeltaskslearningmulti-taskpreferencessystem
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

A multi-task learning (MTL) system aims at solving multiple related tasks at the same time. With a fixed model capacity, the tasks would be conflicted with each other, and the system usually has to make a trade-off among learning all of them together. For many real-world applications where the trade-off has to be made online, multiple models with different preferences over tasks have to be trained and stored. This work proposes a novel controllable Pareto multi-task learning framework, to enable the system to make real-time trade-off control among different tasks with a single model. To be specific, we formulate the MTL as a preference-conditioned multiobjective optimization problem, with a parametric mapping from preferences to the corresponding trade-off solutions. A single hypernetwork-based multi-task neural network is built to learn all tasks with different trade-off preferences among them, where the hypernetwork generates the model parameters conditioned on the preference. For inference, MTL practitioners can easily control the model performance based on different trade-off preferences in real-time. Experiments on different applications demonstrate that the proposed model is efficient for solving various MTL problems.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Gradient-Based Multi-Objective Deep Learning: Algorithms, Theories, Applications, and Beyond

    cs.LG 2025-01 conditional novelty 4.0 of 10

    A comprehensive survey categorizes gradient-based multi-objective deep learning by output type, with theory, applications, datasets, libraries, and open challenges.

  2. Pareto Set Learning for Multi-Objective Reinforcement Learning

    cs.LG 2025-01 reject novelty 4.0 of 10

    PSL-MORL trains a hypernetwork to output policy parameters for every preference weight, claiming dense Pareto-front coverage with personalized policies.

Pith tools