资源论文Max-Margin Majority Voting for Learning from Crowds

Max-Margin Majority Voting for Learning from Crowds

2020-02-04 | |  116 |   48 |   0

Abstract

 Learning-from-crowds aims to design proper aggregation strategies to infer the unknown true labels from the noisy labels provided by ordinary web workers. This paper presents max-margin majority voting (M3 V) to improve the discriminative ability of majority voting and further presents a Bayesian generalization to incorporate the flexibility of generative methods on modeling noisy observations with worker confusion matrices. We formulate the joint learning as a regularized Bayesian inference problem, where the posterior regularization is derived by maximizing the margin between the aggregated score of a potential true label and that of any alternative label. Our Bayesian model naturally covers the Dawid-Skene estimator and M3 V. Empirical results demonstrate that our methods are competitive, often achieving better results than state-of-the-art estimators.

上一篇:Lifted Symmetry Detection and Breaking for MAP Inference

下一篇:Regularization Path of Cross-Validation Error Lower Bounds

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...