May 2026· arXiv.org· Vol abs/2605.02827· 1 citation
Computer ScienceMathematics
TL;DR
This work proposes an Efficiency-Aware Surrogate-adjusted Estimator (EASE) that directly chooses the sampling law and surrogate to minimize the leading mean squared error (MSE), and demonstrates that EASE consistently outperforms existing estimators for various probabilistic values.
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 representation 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 expansion, in which the leading term is determined by the sampling law and a working surrogate function. This first-order representation yields an explicit expression for the leading mean squared error (MSE), which characterizes how the sampling law and the surrogate jointly determine statistical efficiency. Guided by this criterion, we propose an Efficiency-Aware Surrogate-adjusted Estimator (EASE) that directly chooses the sampling law and surrogate to minimize the first-order MSE. We demonstrate that EASE consistently outperforms existing estimators for various probabilistic values.
A one-step estimator with K-fold cross-fitting and a U-statistic correction of the squared loss that removes the Monte Carlo bias of the naive plug-in is proposed, which is $\sqrt{n}$-consistent and asymptotically normal under double-robust rate conditions, and the resulting Wald interval attains nominal coverage.
We study preference elicitation under the Bradley-Terry-Luce (BTL) model where the true partworth vector is unknown and has to be estimated as a parameter with elicited preference information. The set of selected pairwise queries is non-uniform, deterministic, and arbitrary over a collection of alternatives, provided t...
An expert who supplies examples of a quantity often also signals how plausible each one is; when is that signal worth using? We study eliciting a Bayesian prior from an expert who provides example points together with their approximate likelihoods. We propose fitting the prior by least squares--minimizing the squared d...
A hierarchy of three entropy-based Shapley games makes this output-side choice explicit for any ordered multivariate outcome, ranging from per-component marginal entropy to fully joint entropy, and establishes a chain-rule decomposition of the joint attribution and characterize the cross-component term through conditio...
Niklas Koenen, Claudia Battistin, Jeriek Van den Abeele et al.· 0 citations
This work derives a finite-dimensional dual formulation of PrO inference that separates sampling fluctuation, approximation under a divergence budget, regularization, and numerical optimization error and uses an exactly solvable categorical example to show that predictive-risk convergence can imply convergence to a uni...
Aurya Javeed, D. Kouri, Teresa Portone et al.· 0 citations
This paper introduces a computer science approach to large-scale skill estimation that unifies probabilistic modeling with algorithmic efficiency. We present a Bayesian rating framework that models skills, performances, and ranked evidence, deriving closed-form MAP updates and a pseudodiffusion mechanism for temporal s...
Mafaz Mohammed Nadherssa· International Journal of Int...· 0 citations