ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1904.11608
  4. Cited By
Gradient Descent for Sparse Rank-One Matrix Completion for Crowd-Sourced
  Aggregation of Sparsely Interacting Workers
v1v2 (latest)

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

25 April 2019
Yao Ma
Alexander Olshevsky
Venkatesh Saligrama
Csaba Szepesvári
ArXiv (abs)PDFHTML

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

13 / 13 papers shown
Entry-Specific Matrix Estimation under Arbitrary Sampling Patterns
  through the Lens of Network Flows
Entry-Specific Matrix Estimation under Arbitrary Sampling Patterns through the Lens of Network Flows
Yudong Chen
Xumei Xi
Christina Lee Yu
211
0
0
06 Sep 2024
Crowd-Certain: Label Aggregation in Crowdsourced and Ensemble Learning
  Classification
Crowd-Certain: Label Aggregation in Crowdsourced and Ensemble Learning Classification
M. S. Majdi
Jeffrey J. Rodriguez
197
2
0
25 Oct 2023
Recovering Top-Two Answers and Confusion Probability in Multi-Choice
  Crowdsourcing
Recovering Top-Two Answers and Confusion Probability in Multi-Choice CrowdsourcingInternational Conference on Machine Learning (ICML), 2022
Hyeonsu Jeong
Hye Won Chung
364
2
0
29 Dec 2022
Rank-1 Matrix Completion with Gradient Descent and Small Random Initialization
Rank-1 Matrix Completion with Gradient Descent and Small Random InitializationNeural Information Processing Systems (NeurIPS), 2022
Daesung Kim
Hye Won Chung
340
3
0
19 Dec 2022
A Light-weight, Effective and Efficient Model for Label Aggregation in
  Crowdsourcing
A Light-weight, Effective and Efficient Model for Label Aggregation in Crowdsourcing
Yi Yang
Zhong-Qiu Zhao
Quan-wei Bai
Qing Liu
Weihua Li
FedML
158
2
0
19 Nov 2022
Identify ambiguous tasks combining crowdsourced labels by weighting
  Areas Under the Margin
Identify ambiguous tasks combining crowdsourced labels by weighting Areas Under the Margin
Tanguy Lefort
Benjamin Charlier
Alexis Joly
Joseph Salmon
411
6
0
30 Sep 2022
A Worker-Task Specialization Model for Crowdsourcing: Efficient
  Inference and Fundamental Limits
A Worker-Task Specialization Model for Crowdsourcing: Efficient Inference and Fundamental LimitsIEEE Transactions on Information Theory (IEEE Trans. Inf. Theory), 2021
Doyeon Kim
Jeonghwa Lee
Hye Won Chung
391
6
0
19 Nov 2021
Factorization Approach for Low-complexity Matrix Completion Problems:
  Exponential Number of Spurious Solutions and Failure of Gradient Methods
Factorization Approach for Low-complexity Matrix Completion Problems: Exponential Number of Spurious Solutions and Failure of Gradient Methods
Baturalp Yalcin
Haixiang Zhang
Javad Lavaei
Somayeh Sojoudi
368
15
0
19 Oct 2021
Detecting adversaries in Crowdsourcing
Detecting adversaries in Crowdsourcing
Panagiotis A. Traganitis
G. Giannakis
224
2
0
07 Oct 2021
Crowdsourcing via Annotator Co-occurrence Imputation and Provable
  Symmetric Nonnegative Matrix Factorization
Crowdsourcing via Annotator Co-occurrence Imputation and Provable Symmetric Nonnegative Matrix FactorizationInternational Conference on Machine Learning (ICML), 2021
Shahana Ibrahim
Xiao Fu
161
12
0
14 Jun 2021
Adversarial Crowdsourcing Through Robust Rank-One Matrix Completion
Adversarial Crowdsourcing Through Robust Rank-One Matrix CompletionNeural Information Processing Systems (NeurIPS), 2020
Qianqian Ma
Alexander Olshevsky
282
42
0
23 Oct 2020
Asymptotic Convergence Rate of Alternating Minimization for Rank One
  Matrix Completion
Asymptotic Convergence Rate of Alternating Minimization for Rank One Matrix CompletionIEEE Control Systems Letters (L-CSS), 2020
Rui Liu
Alexander Olshevsky
148
0
0
11 Aug 2020
Exact Guarantees on the Absence of Spurious Local Minima for
  Non-negative Rank-1 Robust Principal Component Analysis
Exact Guarantees on the Absence of Spurious Local Minima for Non-negative Rank-1 Robust Principal Component Analysis
Salar Fattahi
Somayeh Sojoudi
225
38
0
30 Dec 2018
1
Page 1 of 1