AI & ML
Allocating Human Oversight in AI-Enabled Analytics
arXiv stat.ML0 views
arXiv:2604.12497v3 Announce Type: replace-cross Abstract: Artificial intelligence provides low-cost predictions for many analytics tasks, but their reliability and the value of another human label vary across tasks. We study how to allocate a shared human-validation budget when task-level uncertainty is unknown and each acquired label informs both estimation and subsequent allocation. For known difficulty levels, the benchmark follows a cost-adjusted Neyman rule that accounts for task importance and label cost. Within our Tuned Rectification-Difficulty framework, we develop an upper-confidence-bound policy that jointly learns the correction coefficients of tuned prediction-powered inference and the resulting difficulties from paired human labels and predictions, and establish an allocation-regret guarantee for the confidence-radius policy. In synthetic experiments and a real digital-twin survey with 68 tasks and over 2,000 respondents, our method closes most of the gap to the oracle on the allocation objective. It matches the estimation error of uniform allocation with up to 22.7% and 4.5% fewer human labels, respectively. The same allocation structure extends beyond scalar means to vector-valued decision models, including regression and choice/conjoint estimation, by replacing the scalar residual variance with a scalarized sandwich covariance. The value of AI depends not only on model accuracy but also on the operational policy that targets human oversight where it matters most.
Source:https://arxiv.org/abs/2604.12497PreviousA unifying view of contrastive learning, importance sampling, and bridge sampling for energy-based modelsNextVariance Reduction for Gradients from Diffusion Teachers
Related posts
FDR-Controlled Variable Selection for Generalized Linear Models and Cox Regression with Virtual Dummies
0arXiv eess.SP
Terrain Perception for Agricultural UAVs in Complex Farmland via Rotating mmWave Radar
0arXiv eess.SP
FUTON: Fourier Tensor Networks for Implicit Neural Representations
0arXiv eess.SP
Writing Bug Reports for Software Repair Agents: What Information Matters Most?
0arXiv cs.SE
SACS: A Code Smell Dataset using Semi-automatic Generation Approach
0arXiv cs.SE
Resolution of Vinzant's Conjecture on Phase Retrieval Injectivity
0arXiv math.IT