Back to results

Massachusetts Institute of Technology

Themes in numerical tensor calculus

Abstract

dc:description.abstract

This thesis studies several distinct, but related, aspects of numerical tensor calculus. First, we introduce a simple, black-box compression format for tensors with a multiscale structure. By representing the tensor as a sum of compressed tensors defined on increasingly coarse grids, the format captures low-rank structures on each grid-scale, which leads to an increase in compression for a fixed accuracy. Secondly, we consider phase retrieval problems for signals that exhibit a low-rank tensor structure. This class of signals naturally includes a wide set of multidimensional spatial and temporal signals, as well as one- or two-dimensional signals that can be reshaped to higher-dimensional tensors. For a tensor of order 𝑑, dimension 𝑛 and rank 𝑟, we present a provably correct, polynomial-time algorithm that can recover the tensor-structured signals using a total of 𝒪(𝑑𝑛𝑟) measurements, far lower than the 𝒪(𝑛 𝑑 ) measurements required by dense methods. Thirdly, we consider the problem of recovering an orthogonally decomposable tensor with a subset of elements distorted by noise with arbitrarily large magnitude. We focus on the particular case where each mode in the decomposition is corrupted by noise vectors with components that are correlated locally, i.e., with nearby components. This deterministic tensor completion problem has the unusual property that it can be solved in polynomial time if the rank of the tensor is sufficiently large. This is the polar opposite of the low-rank assumptions of typical low-rank tensor and matrix completion settings. Our approach enables recovery even with a substantial number of missing entries, for instance for 𝑛-dimensional tensors of rank 𝑛 with up to 40% missing entries. Lastly, we study properties and algorithms for low storage-cost representations in two constrained tensor formats. We study algorithms for computing with the tensor ring format, which is an extension of the tensor train format with variable end-ranks, as well as properties of orthogonally decomposable symmetric tensors.

Degree

thesis:*
Name thesis:degree_name
Doctoral
Department dc:contributor.department
Massachusetts Institute of Technology. Department of Mathematics
Grantor dc:publisher
Massachusetts Institute of Technology
Year dc:date.issued
2021

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Mickelin, Oscar
Advisor dc:contributor.advisor
  • Karaman, Sertac

Rights

dc:rights
Statement dc:rights
  • In Copyright - Educational Use Permitted
  • Copyright MIT

Identifiers

dc:identifier.*
Handle dc:identifier.uri
https://hdl.handle.net/1721.1/139243
OAI identifier oai:identifier
oai:dspace.mit.edu:1721.1/139243

Chain of custody

source
Harvested from
MIT
Base URL
dspace.mit.edu/oai/request
Last updated
2026-07-22
Source record
OAI-PMH GetRecord
related terms
citation

Mickelin, Oscar. Themes in numerical tensor calculus. Massachusetts Institute of Technology, 2021. https://hdl.handle.net/1721.1/139243