AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Do Current Multi-Task Optimization Methods in Deep Learning Even Help?

NeurIPS 2022 · Learning theory and algorithms › Combinatorial and search optimization · approach: Constrained neural network optimization · 17 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use MTO algorithms (MGDA, GradNorm, PCGrad, IMTL, RLW) instead of scalarizationTransformer NMT · En->{Fr,Zh}, En->{Fr,De}train/test loss trade-offNo clear effect
use MTO algorithms instead of tuned scalarizationTransformer NMT · En->{Fr,Ro} test generalizationtest lossHurt
use MTO algorithms instead of scalarizationResNet-50 segmentation+depth · CityScapestest loss/accuracy trade-offHurt
use MGDA instead of scalarizationCelebA multitask model · CelebA testaverage error: 9.23 -> 9.53Hurt
use PCGrad instead of scalarizationCelebA multitask model · CelebA testaverage error: 9.23 -> 9.35No clear effect
scale model depth (3L to 12L) with scalarization instead of using per-task-gradient MTOTransformer NMT · En->{Zh,Fr}Pareto front: 11.52 -> 5.48 steps/sec for 12LHelped
tune learning rate on a sparse grid versus varying seedMTO evaluation · NMTperformance varianceHurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy