DB-MTL does not affect training stability; losses converge smoothly.

Entities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.

• DB-MTL is a simple yet effective method that addresses both loss-scale and gradient-magnitude imbalances.claim0.825
  Core claim of the paper.
• DB-MTL reduces gradient conflict and improves task balance compared to EW.claim0.821
  Effect on gradient conflict.
• DB-MTL achieves loss-scale balancing by performing logarithm transformation on each task loss, and rescales gradient magnitudes by normalizing all task gradients to comparable magnitudes using the maximum gradient norm.quote0.815
  Concise summary of the DB-MTL method from the abstract.
• DB-MTL increases gradient cosine similarity faster and keeps it positive on Office-31, reducing gradient conflict vs EW.finding0.812
  Analysis of gradient conflict reduction.
• DB-MTL has similar per-epoch running time to gradient balancing methods on NYUv2, slower than loss balancing methods.finding0.794
  Computational efficiency comparison.
• DB-MTL with EMA forgetting rate β in a wide range performs better than without EMA (β=0) on Office-31.finding0.788
  Effect of EMA forgetting rate on performance.
• Current training methods rely on loss minimization, meaning the experiential profile of training is predominantly negative across billions of parameter updatesclaim0.758
  Ethical implication about the nature of AI training experience if the thesis holds
• DB-MTL (Dual-Balancing Multi-Task Learning)method0.755
  The proposed method combining loss-scale balancing via logarithm transformation and gradient-magnitude balancing via maximum-norm normalization.