Skip to content

Truth inference for crowdsourcing via bias-variance fusion graph embedding

Aug 2026 · Knowledge and Information Systems · Vol 68 · 0 citations · 30 references
Mobile Crowdsensing and Crowdsourcing Domain Adaptation and Few-Shot Learning Privacy-Preserving Technologies in Data

TL;DR

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).

Abstract

Crowdsourcing has served as an effective method for data collection and labeling. However, the varying abilities of individual workers lead to inconsistent quality in the collected data. Existing truth-inference methods always assign initial reliability values to workers and refine them iteratively. This methodology for estimating worker reliability fails to accurately assess worker reliability and consequently reduces the accuracy of truth inference. In this article, we explore a novel strategy to measure worker reliability by estimating the label quality of each worker for individual instances. Specifically, we introduce 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). These components are integrated to compute the label quality of each worker for inference instances, enabling accurate assessment of their actual labeling capability and determination their reliability. Building upon this, we propose Graph Embedding for Truth Inference with Worker Reliability (GETI-WR), a bias-variance fusion graph embedding method for crowdsourced truth inference. GETI-WR leverages the obtained worker reliability to map the "task-worker-label" graph into a low-dimensional continuous vector space. Then we use a graph neural network to transform the crowdsourcing problem into a graph-node prediction task to enhance truth-discovery efficiency. Experimental results on two real-world datasets demonstrate that compared with six state-of-the-art baseline methods, our method achieves superior performance in terms of both accuracy and F1-score.

Read PDF

Similar papers

Open access Oct 2026

Accurate agreement estimation in crowdsourced relevance assessments via statistical models based on the beta distribution

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 transformati...

Giuseppe Alfonzetti, R. Bellio, P. Vidoni · 0 citations
#machine learning Preprint Aug 2026

Dual-Primal Graph VAEs for Noisy Label Aggregation

A graph VAE architecture in which the decoder and encoder use GAT-based message passing on the adjacency graph of a crowdsourced dataset and its dual, respectively, enabling unsupervised representation learning without needing to train a separate classifier.

Patrick Stinson, N. Kriegeskorte · 0 citations
Aug 2026

COVER-EL: Class cOVERage-Aware Noise Correction for Crowdsourced Labels via Elimination-Based Inference.

This work proposes a class coverage-aware noise correction method for crowdsourced labels via elimination-based inference (COVER-EL), and provides a probably approximately correct (PAC)-style bound that gives a high-probability guarantee on the overall error after correction.

Bi Wang, Yan-Ting Yang, Xuelian Li · 0 citations
Aug 2026

Label Distribution Enhancement-Based Label Completion for High-Noise-Ratio Crowdsourcing

Label completion serves as a preprocessing step to handle the sparse crowdsourced label matrix problem, significantly boosting the effectiveness of the downstream label integration. However, existing label completion algorithms generally focus on the crowdsourcing scenarios with low noise ratios but rarely focus on the...

Tong Wu, Liang-Xiao Jiang, Wen-Juan Zhang et al. · 0 citations
Preprint Aug 2026

Finding the Signal in the Spam: Jointly Learning Rewards and Worker Reliability from Pairwise Comparisons

The Boltzmann-rational model for pairwise comparisons is adopted, which extends the Bradley-Terry-Luce model by incorporating worker competencies, and an EM-based algorithm for learning is derived by introducing Polya-Gamma latent variables to transform the logistic likelihood into a conditionally Gaussian form, enabli...

Kaustubh Shivshankar Shejole, Tanish Agarwal, Arpit Agarwal et al. · 0 citations

Related blog posts

Microsoft Research Blog Jul 13, 2026

Verifying Rust cryptography in SymCrypt, from standards to code

Cryptographic code supports vital protections in modern computing systems. Learn how a new method helps verify code as developers write it while preserving speed and adaptability as it gets implemented and evolves. The post Verifying Rust cryptography in SymCrypt, from standards to code appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.