Lune

ICLR2026顶会

From Gradient Volume to Shapley Fairness: Towards Fair Multi-Task Learning

Xiao Wang, Yuying Han, Dazi Li, Fei Zhang, Min Tang

出版方
2026年份

摘要

Multi-task learning often suffers from gradient conflicts, leading to task-level unfair optimization and degraded overall performance. To address this, we present SVFair, a Shapley value-based framework for fair gradient aggregation that explicitly targets task-level fairness under such conflicts. Unlike heuristic scalarization or pairwise conflict penalties, SVFair combines a geometric view of gradient interaction with a cooperative-game view of fair contribution. We propose two scalable geometric conflict metrics: VolDet, a gram determinant volume metric, and VolDetPro, its sign-aware extension distinguishing antagonistic gradients. By integrating these metrics into Shapley value computation, SVFair quantifies each task's deviation from the overall gradient and rebalances updates toward fairness. In parallel, our Shapley value computation admits controllable complexity. Extensive experiments show that SVFair achieves state-of-the-art results across diverse supervised and reinforcement learning benchmarks, and further improves existing methods when integrated as a fairness-enhancing module.

问问这篇 Paper

智能体会读完全文。

Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。

可以从这些问题问起

智能体调用

Luneget_paper_fulltext

在 Lune 里问

免费开始,无需绑卡

它引用的顶会 Paper22

相关 Paper

黄昏的海面,两侧是细线勾勒的悬崖