Stochastic Iterative Hard Thresholding for Low-Tucker-Rank Tensor Recovery

Rachel Grotheer, Shuang Li, Anna Ma, Deanna Needell, Jing Qin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

Low-rank tensor recovery problems have been widely studied in many signal processing and machine learning applications. Tensor rank is typically defined under certain tensor decomposition. In particular, Tucker decomposition is known as one of the most popular tensor decompositions. In recent years, researchers have developed many state-of-the-art algorithms to address the problem of low-Tucker-rank tensor recovery. Motivated by the favorable properties of the stochastic algorithms, such as stochastic gradient descent and stochastic iterative hard thresholding, we aim to extend the stochastic iterative hard thresholding algorithm from vectors to tensors in order to address the problem of recovering a low-Tucker-rank tensor from its linear measurements. We have also developed linear convergence analysis for the proposed method and conducted a series of experiments with both synthetic and real data to illustrate the performance of the proposed method.

Original languageEnglish
Title of host publication2020 Information Theory and Applications Workshop, ITA 2020
ISBN (Electronic)9781728141909
DOIs
StatePublished - Feb 2 2020
Event2020 Information Theory and Applications Workshop, ITA 2020 - San Diego, United States
Duration: Feb 2 2020Feb 7 2020

Publication series

Name2020 Information Theory and Applications Workshop, ITA 2020

Conference

Conference2020 Information Theory and Applications Workshop, ITA 2020
Country/TerritoryUnited States
CitySan Diego
Period2/2/202/7/20

Bibliographical note

Funding Information:
This material is based upon work supported by the National Security Agency under Grant No. H98230-19-1-0119, The Lyda Hill Foundation, The McGovern Foundation, and Microsoft Research, while the authors were in residence at the Mathematical Sciences Research Institute in Berkeley, California, during the summer of 2019 as part of the Summer Research for Women in Mathematics (SWiM) program. In addition, Li was supported by the NSF grants CCF-1409258, CCF-1704204, and the DARPA Lagrange Program under ONR/SPAWAR contract N660011824020. Grotheer was supported by the Goucher College Summer Research grant. Needell was supported by NSF CAREER DMS #1348721 and NSF BIGDATA DMS #1740325. Qin was supported by the NSF DMS #1941197.

Publisher Copyright:
© 2020 IEEE.

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computational Theory and Mathematics
  • Computer Science Applications
  • Information Systems and Management
  • Control and Optimization

Fingerprint

Dive into the research topics of 'Stochastic Iterative Hard Thresholding for Low-Tucker-Rank Tensor Recovery'. Together they form a unique fingerprint.

Cite this