This work considers a model‐based agreement measure defined as a one‐to‐one transformation of the precision parameter of a beta distribution and develops a model‐based estimator developed for continuous beta ratings and further extended to discrete and ordered beta models.
Abstract
Data crowdsourcing is often used to collect relevance assessments in information retrieval tasks. However, estimating the agreement among crowdworkers is nontrivial, since data is sparse and often collected on a variety of rating scales. We consider a model‐based agreement measure defined as a one‐to‐one transformation of the precision parameter of a beta distribution. To avoid assumptions about the distribution of item‐specific relevance parameters, we model them as fixed effects and address the resulting incidental parameter problem via modified profile likelihood (MPL) estimation. The proposed estimator is developed for continuous beta ratings and further extended to discrete and ordered beta models. Simulation studies show that the resulting estimators provide accurate inference in sparse settings and outperform standard likelihood‐based approaches. Applications to crowdsourced relevance assessments illustrate the effectiveness of the proposed methods and highlight how discreteness and boundary inflation affect agreement estimation. The methods are implemented in an R package.
Calibration has been extensively studied for classifiers, but remains largely unexplored for crowdsourcing aggregation methods, which are increasingly used for making probabilistic decisions. To the best of our knowledge, we provide the first theoretical and empirical study of calibration in label aggregation. To our g...
G. Singer, Reda Arab, Maïssa Frikha et al.· 0 citations
This article introduces two metrics—bias and variance—to quantify, respectively, the discrepancy between a worker’s labels and those of other workers on similar instances (bias), and the inconsistency in a worker’s own labels across different instances (variance).
Wei Zong, Hui-Ze Feng, Zong-Yao Nie· Knowledge and Information Sy...· 0 citations
This work proposes Product Monte Carlo (PMC), an algorithm for computing arbitrary expectations under a product of densities using only Monte Carlo draws from individual densities, and achieves higher estimation accuracy, better-calibrated uncertainty coverage, and improved scalability at a lower computational cost tha...
Pietro Carlotti, Si-Fan Liu, Yu-Ling Yao· 0 citations
Evaluating model uncertainty on real-world data is challenging because each instance provides only a single observed label, leaving true conditional class probabilities unknown. To address this, we introduce ProbabilityBench, a benchmark that provides exact, instance-level class probabilities across three simulated tex...
Yu-Yang Dai, Yu-Ting Tang, Futoshi Futami et al.· 0 citations
Cluster weight on advice (CWOA) is proposed, a novel “two-shot” algorithm to identify a more accurate subgroup in a single-prediction-problem context and consistently outperforms benchmarks, including the state-of-the-art metaprediction-based methods.
In this work, we investigate three modified versions of the classic Hegselmann-Krause opinion dynamics model, incorporating features that are typical of many real-world systems, such as uncertainty in the selection of interacting agents and a weighted evaluation of the relevance of their opinions in the influence funct...
Chiara Giaquinta, Laura Hernández, David Chavalarias· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.