Dense limit of the Dawid–Skene model for crowdsourcing and regions of sub-optimality of message passing algorithms

DOI10.1088/1751-8121/AB757FMaRDI QIDQ5060424zbMATH OpenOpenAlexFDO

Authors Christian Schmidt, Lenka Zdeborová

Publication date 10 January 2023

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1803.04924

zbMATH Keywords

Bayesian statisticsapproximation algorithmsdisordered systemssignal reconstructionspin Glassmessage passing algorithms

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX) Quantum theory (81-XX)

Recommendations

• The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing
• An optimal lower bound for distinct elements in the message passing model
• Distributed Mean-Field Density Estimation for Large-Scale Systems
• Finite Sample Analysis of Approximate Message Passing Algorithms
• Asymptotic Properties of Distributed and Communicating Stochastic Approximation Algorithms
• Universality of approximate message passing algorithms
• Distributed Inference Over Directed Networks: Performance Limits and Optimal Design
• Dense graph limits under respondent-driven sampling
• Mean-field limits for large-scale random-access networks
• Distributed Stochastic Approximation: Weak Convergence and Network Design

Cites work

• scientific article; zbMATH DE number 3567782 (Why is no real title available?)
• An iterative construction of solutions of the TAP equations for the Sherrington-Kirkpatrick model
• Constrained low-rank matrix estimation: phase transitions, approximate message passing and applications
• Optimal Inference in Crowdsourced Classification via Belief Propagation
• State evolution for general approximate message passing algorithms, with applications to spatial coupling

Cited in

(2)

• Spectral methods meet EM: a provably optimal algorithm for crowdsourcing
• Gradient descent for sparse rank-one matrix completion for crowd-sourced aggregation of sparsely interacting workers

This page was built for publication: Dense limit of the Dawid–Skene model for crowdsourcing and regions of sub-optimality of message passing algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5060424)