finding
active
finding:db-mtl-has-similar-per-epoch-running-time-to-gradient-balancing-methods-on-nyuv2-slower-than-loss-balancing-methodsDB-MTL has similar per-epoch running time to gradient balancing methods on NYUv2, slower than loss balancing methods.
Computational efficiency comparison.
Source paper
extracted_from(2023) · Baijiong Lin · Weisen Jiang · Feiyang Ye · Yu Zhang +5
Neighborhood — ranked by edge-count
Communities (3)
community
- Dual-balancing multi-task learningmembers_ofDB-MTL jointly balances loss scale and gradient magnitude, benchmarked on NYUv2 and Office-31.
- Dual balancing multi-task learningmembers_ofDB-MTL combines loss-scale and gradient-magnitude balancing, benchmarked across NYUv2, Cityscapes, QM9, and Office datasets.
- Explores gradient/loss balancing techniques with exponential moving average forgetting rates, evaluated on dense prediction tasks like semantic segmentation.
Related by similarity (8)
cosine ≥ 0.65 · no typed edgeEntities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.
- Concise summary of the DB-MTL method from the abstract.
- Training stability analysis.
- Core claim of the paper.
- Effect on gradient conflict.
- Analysis of gradient conflict reduction.
- DB-MTL achieves ∆p = +1.15±0.16 on NYUv2, outperforming all baselines including state-of-the-artfinding0.810Primary empirical validation on scene understanding task
- Training stability claim.
- The gradient-magnitude balancing method outperforms GradNorm on NYUv2, Cityscapes, Office-31, Office-Home.finding0.793Comparison of gradient-magnitude balancing with GradNorm.