Dynamic Shapley Computation
Xuan Yang, Hsi-Wen Chen, Ming-Syan Chen, Jian Pei

TL;DR
D-Shap introduces an efficient dynamic data valuation framework using structured matrix maintenance, enabling rapid updates and reducing computational costs significantly in evolving training scenarios.
Contribution
It presents D-Shap, a novel method for dynamic Shapley value computation that exploits task and player locality to enable fast, structure-aware updates and self-valuation from data.
Findings
D-Shap updates tasks in milliseconds.
Reduces player update costs by up to 1000x.
Achieves valuation quality comparable to full recomputation.
Abstract
Shapley-based data valuation provides a principled way to quantify the contribution of training data, but its high computational cost makes it impractical in dynamic settings where tasks and training players evolve. Existing methods treat Shapley computation as a one-shot process and collapse contributions into aggregated scores, preventing reuse and requiring recomputation under any change. We introduce a new perspective that represents Shapley values as a player-by-task matrix and formulates dynamic valuation as a structured matrix maintenance problem. We exploit the fact that each task depends on a small subset of training players and that similar tasks yield similar valuations, leading to utility locality and coalition locality. Based on these insights, we propose D-Shap, a dynamic valuation framework that enables efficient updates by modifying only a small portion of the matrix:…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
