Noisy tensor completion via the sum-of-squares hierarchy. Barak, B. & Moitra, A. Math. Program., 193(2):513–548, 2022. Preliminary version in COLT 2016
Noisy tensor completion via the sum-of-squares hierarchy [link]Paper  Noisy tensor completion via the sum-of-squares hierarchy [link]Paper  doi  bibtex   33 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: 33