Gradient Descent for Sparse Rank-One Matrix Completion for Crowd-Sourced Aggregation of Sparsely Interacting Workers. Ma, Y., Olshevsky, A., Szepesvári, C., & Saligrama, V. In Proceedings of the 35th International Conference on Machine Learning, ICML 2018, Stockholmsmässan, Stockholm, Sweden, July 10-15, 2018, pages 3341–3350, 2018.
Gradient Descent for Sparse Rank-One Matrix Completion for Crowd-Sourced Aggregation of Sparsely Interacting Workers [link]Paper  bibtex   
@inproceedings{DBLP:conf/icml/MaOSS18,
  author    = {Yao Ma and
               Alexander Olshevsky and
               Csaba Szepesv{\'{a}}ri and
               Venkatesh Saligrama},
  title     = {Gradient Descent for Sparse Rank-One Matrix Completion for Crowd-Sourced
               Aggregation of Sparsely Interacting Workers},
  booktitle = {Proceedings of the 35th International Conference on Machine Learning,
               {ICML} 2018, Stockholmsm{\"{a}}ssan, Stockholm, Sweden, July 10-15,
               2018},
  pages     = {3341--3350},
  year      = {2018},
  crossref  = {DBLP:conf/icml/2018},
  url       = {http://proceedings.mlr.press/v80/ma18b.html},
  timestamp = {Wed, 03 Apr 2019 18:17:30 +0200},
  biburl    = {https://dblp.org/rec/conf/icml/MaOSS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0