@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}
}

{"_id":"SLT2sWccq2dWXyPmQ","bibbaseid":"ma-olshevsky-saligrama-szepesvri-gradientdescentforsparserankonematrixcompletionforcrowdsourcedaggregationofsparselyinteractingworkers-2019","authorIDs":["54ea7b2fcbc9e4a063000f56","5dec4845e16431f20100003a","5dee6c58773914de01000173","5df16ab1d177badf010001b9","5df311e7bc9e6cde01000145","5df3a892ec6029de01000083","5df6d240da9d91de01000015","5e02d878410ebcdf01000054","5e07f854cdee3adf01000020","5e0df97645d2fdde010000e3","5e19659773bf69de01000025","5e1bda344c869ade0100001c","5e1c5385e556c6de010000d9","5e25f077a6f19fde01000283","5e274d4418178ede0100009c","5e2a9bd4c1385ade01000046","5e2eef219033bede010001e5","5e3c319c34cd37de0100011e","5e400b8e17f17dde0100008b","5e432bf28957d0de01000005","5e4bd923a6b53fde0100016d","5e54620188d190df01000112","5e57508518f14bdf0100005b","5e6247ed3c8c6bde0100004f","5e6271d311ac5fde010001dd","5e64a0ae2551dede01000041","5e64dbb40b8008df0100007b","6PixsrKL4kwnNaRse","9Tw9GhrHCuakSZona","9xkK2eT2kxmbsLDwc","A2jsu8asnCKjMMTT7","E2f9vGYjkAPLQPA6A","Ea5r4H2zsuxyKRg8v","EgmTDujheAnEMJmgJ","JLzy4utZyyskcsS2J","NqcrbQfhzJcFhkx5M","PxEKuXt69uTngYHDb","RHoc88QWqXWmKrxYq","YFvQJe3ypTg8LNDmk","dgBqtoi2ZwSBc2jQR","eyEeJc9Tf52o5M5c2","f3pJQknPceTdaMdiZ","gj22A7pmYaovTxnLv","nGgiaqMyjAcvEJFvC","oebB9wDs9WkCm8bWF","sW9ySvEtasPCRphwd","sWC7noErwTCuTjtSy","sXyK5h8ajsdeK8JtW","thsnAwQDSokyMzP7S","tucxT2oskX6Z75EMv","y64jgFvBcnEGWvEQS","ywTadfMoGTaTW5amg","yxZMCECp2cjGHjBmp"],"author_short":["Ma, Y.","Olshevsky, A.","Saligrama, V.","Szepesvári, C."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Yao"],"propositions":[],"lastnames":["Ma"],"suffixes":[]},{"firstnames":["Alex"],"propositions":[],"lastnames":["Olshevsky"],"suffixes":[]},{"firstnames":["Venkatesh"],"propositions":[],"lastnames":["Saligrama"],"suffixes":[]},{"firstnames":["Csaba"],"propositions":[],"lastnames":["Szepesvári"],"suffixes":[]}],"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","bibtex":"@article{DBLP:journals/corr/abs-1904-11608,\n author = {Yao Ma and\n Alex Olshevsky and\n Venkatesh Saligrama and\n Csaba Szepesv{\\'{a}}ri},\n title = {Gradient Descent for Sparse Rank-One Matrix Completion for Crowd-Sourced\n Aggregation of Sparsely Interacting Workers},\n journal = {CoRR},\n volume = {abs/1904.11608},\n year = {2019},\n url = {http://arxiv.org/abs/1904.11608},\n eprinttype = {arXiv},\n eprint = {1904.11608},\n timestamp = {Thu, 02 May 2019 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/abs-1904-11608.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Ma, Y.","Olshevsky, A.","Saligrama, V.","Szepesvári, C."],"key":"DBLP:journals/corr/abs-1904-11608","id":"DBLP:journals/corr/abs-1904-11608","bibbaseid":"ma-olshevsky-saligrama-szepesvri-gradientdescentforsparserankonematrixcompletionforcrowdsourcedaggregationofsparselyinteractingworkers-2019","role":"author","urls":{"Paper":"http://arxiv.org/abs/1904.11608"},"metadata":{"authorlinks":{"saligrama, v":"https://bibbase.org/show?bib=https://dblp.org/pid/67/4721.bib"}},"downloads":0},"bibtype":"article","biburl":"https://dblp.org/pid/67/4721.bib","creationDate":"2019-05-05T03:11:43.498Z","downloads":0,"keywords":[],"search_terms":["gradient","descent","sparse","rank","one","matrix","completion","crowd","sourced","aggregation","sparsely","interacting","workers","ma","olshevsky","saligrama","szepesvári"],"title":"Gradient Descent for Sparse Rank-One Matrix Completion for Crowd-Sourced Aggregation of Sparsely Interacting Workers","year":2019,"dataSources":["vDgwZPGAKNTHeEubz","X3pp7jX6PpQ4DfzpE","cd5AYQRw3RHjTgoQc","wongksCJACgxcZyZW"]}