Noisy tensor completion for tensors with a sparse canonical polyadic factor

Swayambhoo Jain, Alexander Gutierrez, Jarvis Haupt

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

'To be considered for the 2017 IEEE Jack Keil Wolf ISIT Student Paper Award.' In this paper we study the problem of noisy tensor completion for tensors that admit a canonical polyadic or CANDE-COMP/PARAFAC (CP) decomposition with one of the factors being sparse. We present general theoretical error bounds for an estimate obtained by using a complexity-regularized maximum likelihood principle and then instantiate these bounds for the case of additive white Gaussian noise. We also provide an ADMM-type algorithm for solving the complexity-regularized maximum likelihood problem and validate the theoretical finding via experiments on synthetic data set.

Original languageEnglish (US)
Title of host publication2017 IEEE International Symposium on Information Theory, ISIT 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2153-2157
Number of pages5
ISBN (Electronic)9781509040964
DOIs
StatePublished - Aug 9 2017
Event2017 IEEE International Symposium on Information Theory, ISIT 2017 - Aachen, Germany
Duration: Jun 25 2017Jun 30 2017

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Other

Other2017 IEEE International Symposium on Information Theory, ISIT 2017
CountryGermany
CityAachen
Period6/25/176/30/17

Bibliographical note

Funding Information:
We thank Professor Nicholas Sidiropoulos for his insightful guidance and discussions on tensors which helped in completion of this work. Swayambhoo Jain and Jarvis Haupt were supported by the DARPA Young Faculty Award, Grant N66001-14-1-4047. Alexander Gutierrez was supported by the NSF Graduate Research Fellowship Program under Grant No. 00039202.

Keywords

  • CANDECOMP/PARAFAC decomposition
  • Complexity-regularized maximum likelihood estimation
  • Noisy tensor completion
  • Sparse canonical polyadic decomposition
  • Sparse factor models
  • Tensor decomposition

Fingerprint Dive into the research topics of 'Noisy tensor completion for tensors with a sparse canonical polyadic factor'. Together they form a unique fingerprint.

Cite this