First-Order Efficiency for Probabilistic Value Estimation via A Statistical Viewpoint
Ziqi Liu, Kiljae Lee, Yuan Zhang, Weijing Tang

TL;DR
This paper introduces a first-order error analysis for probabilistic value estimators, leading to an efficiency-optimized estimator that outperforms existing methods in data valuation tasks.
Contribution
The paper reveals a common first-order error structure among various estimators and proposes EASE, a new estimator that optimizes sampling and surrogate choices for better efficiency.
Findings
EASE consistently outperforms state-of-the-art estimators.
First-order error structure unifies different estimation strategies.
Explicit MSE expression guides efficiency improvements.
Abstract
Probabilistic values, including Shapley values and semivalues, provide a model-agnostic framework to attribute the behavior of a black-box model to data points or features, with a wide range of applications including explainable artificial intelligence and data valuation. However, their exact computation requires utility evaluations over exponentially many coalitions, making Monte Carlo approximation essential in modern machine learning applications. Existing estimators are often developed through different identification strategies, including weighted averages, self-normalized weighting, regression adjustment, and weighted least squares. Our key observation is that these seemingly distinct constructions share a common first-order error structure, in which the leading term is an augmented inverse-probability weighted influence term determined by the sampling law and a working surrogate…
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.
