KAIROS快速评估数据价值,无需重训练且精度更高。
KAIROS: Scalable Model-Agnostic Data Valuation
- 用MMD分布影响力评分替代传统方法,避免重训练
- 理论误差小于1/N²,支持在线更新,速度提升50倍
- 适合数据质量检测与模型可解释性研究
训练数据不仅影响模型准确率,还关乎合规性与AI资产估值。现有方法存在缺陷:基于模型的方法依赖单一模型并继承其偏差,而如Data Shapley等算法在大规模下需昂贵重训练。近期基于Wasserstein的无模型方法依赖近似,导致样本排序失真。我们提出KAIROS,一种可扩展的无模型数据估值框架,为每个样本赋予分布影响力得分:其对经验训练分布与干净参考集之间最大均值差异(MMD)的贡献。不同于Wasserstein代理,我们的MMD影响力具有闭式解,能以$O(1/N^2)$误差内精确逼近真实留一法(LOO)排名,无需重训练,并自然拓展至条件核函数,实现标签与特征错误统一检测。此外,当新一批大小为m的数据到来时,所有得分可在$O(mN)$时间内高效更新,相比基线提速达50倍,且不损失排名质量。在噪声、误标和中毒基准上的实证表明,KAIROS在准确率与运行时间上均持续优于最先进的模型、Shapley及Wasserstein基线。我们提供严格的理论保证,包括对称性以确保可复现排名,以及密度分离性以实现可解释阈值。
原文摘要 · Abstract (English)
Training data increasingly shapes not only model accuracy but also regulatory compliance and market valuation of AI assets. Yet existing valuation methods remain inadequate: model-based techniques depend on a single fitted model and inherit its biases, while algorithm-based approaches such as Data Shapley require costly retrainings at web scale. Recent Wasserstein-based model-agnostic methods rely on approximations that misrank examples relative to their true leave-one-out (LOO) utility. We introduce KAIROS, a scalable, model-agnostic valuation framework that assigns each example a distributional influence score: its contribution to the Maximum Mean Discrepancy (MMD) between the empirical training distribution and a clean reference set. Unlike Wasserstein surrogates, our MMD-based influence admits a closed-form solution that faithfully approximates the exact LOO ranking within $O(1/N^2)$ error, requires no retraining, and naturally extends to conditional kernels for unified label- and feature-error detection. Moreover, KAIROS supports efficient online updates: when a new batch of size m arrives, all scores can be updated in $O(mN)$ time, delivering up to 50x speedup without compromising ranking quality. Empirical evaluations on noise, mislabeling, and poisoning benchmarks show that KAIROS consistently outperforms state-of-the-art model-, Shapley-, and Wasserstein-based baselines in both accuracy and runtime. We provide rigorous theoretical guarantees, including symmetry for reproducible rankings and density-separation for interpretable thresholds.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。