用预测代替重训,大幅提速数据价值评估
DUPRE: Data Utility Prediction for Efficient Data Valuation
- 基于高斯过程预测数据子集的性能,避免反复训练模型
- 采用切片沃瑟斯坦距离设计核函数,预测误差低且计算快
- 适用于多种模型、数据集和评价指标,提升数据估值效率
数据估值在机器学习中用于确定数据提供者的合理补偿,并识别对模型有益或有害的数据。基于合作博弈论的数据估值方法(如Data Shapley)需多次评估数据子集的效用并重新训练模型。现有工作多聚焦于减少需评估的子集数量,而我们的框架DUPRE采取互补策略:通过预测而非重训来降低每个子集的评估成本。给定部分子集的已评估效用后,DUPRE拟合高斯过程回归模型,预测其余子集的效用。核心贡献在于设计基于经验数据分布间切片沃瑟斯坦距离的高斯过程核函数,该核函数有效且半正定,编码了子集间的相似性先验知识,且可高效计算。实验证明,DUPRE在多种机器学习模型、数据集和效用函数下均实现低预测误差,并显著加速数据估值。
原文摘要 · Abstract (English)
Data valuation is increasingly used in machine learning (ML) to decide the fair compensation for data owners and identify valuable or harmful data for improving ML models. Cooperative game theory-based data valuation, such as Data Shapley, requires evaluating the data utility (e.g., validation accuracy) and retraining the ML model for multiple data subsets. While most existing works on efficient estimation of the Shapley values have focused on reducing the number of subsets to evaluate, our framework, \texttt{DUPRE}, takes an alternative yet complementary approach that reduces the cost per subset evaluation by predicting data utilities instead of evaluating them by model retraining. Specifically, given the evaluated data utilities of some data subsets, \texttt{DUPRE} fits a \emph{Gaussian process} (GP) regression model to predict the utility of every other data subset. Our key contribution lies in the design of our GP kernel based on the sliced Wasserstein distance between empirical data distributions. In particular, we show that the kernel is valid and positive semi-definite, encodes prior knowledge of similarities between different data subsets, and can be efficiently computed. We empirically verify that \texttt{DUPRE} introduces low prediction error and speeds up data valuation for various ML models, datasets, and utility functions.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。