Noisy tensor completion via the sum-of-squares hierarchy. Barak, B. & Moitra, A. Math. Program., 193(2):513–548, 2022. Preliminary version in COLT 2016Paper Paper doi bibtex 35 downloads @article{BarakMoitra22,
author = {Boaz Barak and
Ankur Moitra},
title = {Noisy tensor completion via the sum-of-squares hierarchy},
journal = {Math. Program.},
volume = {193},
number = {2},
pages = {513--548},
year = {2022},
url = {https://doi.org/10.1007/s10107-022-01793-9},
doi = {10.1007/s10107-022-01793-9},
timestamp = {Wed, 27 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/BarakM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org},
url_paper ={http://arxiv.org/abs/1501.06521},
note = {Preliminary version in COLT 2016}
}
Downloads: 35
{"_id":"ajebNgxyntCaznbz8","bibbaseid":"barak-moitra-noisytensorcompletionviathesumofsquareshierarchy-2022","author_short":["Barak, B.","Moitra, A."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Boaz"],"propositions":[],"lastnames":["Barak"],"suffixes":[]},{"firstnames":["Ankur"],"propositions":[],"lastnames":["Moitra"],"suffixes":[]}],"title":"Noisy tensor completion via the sum-of-squares hierarchy","journal":"Math. Program.","volume":"193","number":"2","pages":"513–548","year":"2022","url":"https://doi.org/10.1007/s10107-022-01793-9","doi":"10.1007/s10107-022-01793-9","timestamp":"Wed, 27 Jul 2022 01:00:00 +0200","biburl":"https://dblp.org/rec/journals/mp/BarakM22.bib","bibsource":"dblp computer science bibliography, https://dblp.org","url_paper":"http://arxiv.org/abs/1501.06521","note":"Preliminary version in COLT 2016","bibtex":"@article{BarakMoitra22,\n author = {Boaz Barak and\n Ankur Moitra},\n title = {Noisy tensor completion via the sum-of-squares hierarchy},\n journal = {Math. Program.},\n volume = {193},\n number = {2},\n pages = {513--548},\n year = {2022},\n url = {https://doi.org/10.1007/s10107-022-01793-9},\n doi = {10.1007/s10107-022-01793-9},\n timestamp = {Wed, 27 Jul 2022 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/mp/BarakM22.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org},\n url_paper ={http://arxiv.org/abs/1501.06521},\n note = {Preliminary version in COLT 2016}\n}\n\n\n","author_short":["Barak, B.","Moitra, A."],"key":"BarakMoitra22","id":"BarakMoitra22","bibbaseid":"barak-moitra-noisytensorcompletionviathesumofsquareshierarchy-2022","role":"author","urls":{"Paper":"https://doi.org/10.1007/s10107-022-01793-9"," paper":"http://arxiv.org/abs/1501.06521"},"metadata":{"authorlinks":{}},"downloads":35},"bibtype":"article","biburl":"www.boazbarak.org/boaz.bib","dataSources":["763eChmCTEH5onHpy","jomRn3LFHawZsjFia","ZdZkvHBZGR7Mt6sXE","rRM8G92fpDDvXxQen"],"keywords":[],"search_terms":["noisy","tensor","completion","via","sum","squares","hierarchy","barak","moitra"],"title":"Noisy tensor completion via the sum-of-squares hierarchy","year":2022,"downloads":35}