Gradient Descent for Sparse Rank-One Matrix Completion for Crowd-Sourced Aggregation of Sparsely Interacting Workers. Ma, Y., Olshevsky, A., Saligrama, V., & Szepesvári, C. CoRR, 2019.
Gradient Descent for Sparse Rank-One Matrix Completion for Crowd-Sourced Aggregation of Sparsely Interacting Workers [link]Paper  bibtex   
@article{DBLP:journals/corr/abs-1904-11608,
  author       = {Yao Ma and
                  Alex Olshevsky and
                  Venkatesh Saligrama and
                  Csaba Szepesv{\'{a}}ri},
  title        = {Gradient Descent for Sparse Rank-One Matrix Completion for Crowd-Sourced
                  Aggregation of Sparsely Interacting Workers},
  journal      = {CoRR},
  volume       = {abs/1904.11608},
  year         = {2019},
  url          = {http://arxiv.org/abs/1904.11608},
  eprinttype    = {arXiv},
  eprint       = {1904.11608},
  timestamp    = {Thu, 02 May 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1904-11608.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0