Gradient Descent for Sparse Rank-One Matrix Completion for Crowd-Sourced Aggregation of Sparsely Interacting Workers

25 April 2019

Papers citing "Gradient Descent for Sparse Rank-One Matrix Completion for Crowd-Sourced Aggregation of Sparsely Interacting Workers"

9 / 9 papers shown

Title
Introduction to Online Convex Optimization Elad Hazan OffRL 172 1,929 0 07 Sep 2019
A Minimax Optimal Algorithm for Crowdsourcing Thomas Bonald Richard Combes 25 5 0 01 Jun 2016
Exact Exponent in Optimal Rates for Crowdsourcing Chao Gao Yu Lu Dengyong Zhou FedML 263 49 0 25 May 2016
Matrix Completion has No Spurious Local Minimum Rong Ge Jason D. Lee Tengyu Ma 105 599 0 24 May 2016
Error Rate Bounds and Iterative Weighted Majority Voting for Crowdsourcing Hongwei Li Bin Yu FedML 68 89 0 15 Nov 2014
Spectral Methods meet EM: A Provably Optimal Algorithm for Crowdsourcing Yuchen Zhang Xi Chen Dengyong Zhou Michael I. Jordan FedML 108 386 0 15 Jun 2014
Consistency of weighted majority votes D. Berend A. Kontorovich 79 37 0 02 Dec 2013
Minimax Optimal Convergence Rates for Estimating Ground Truth from Crowdsourced Labels Chao Gao Dengyong Zhou 102 71 0 22 Oct 2013
Budget-Optimal Task Allocation for Reliable Crowdsourcing Systems David R Karger Sewoong Oh Devavrat Shah 126 380 0 17 Oct 2011