tensor data, which exhibits more sophisticated structures than matrix data and brings unique statistical and computational challenges, has attracted a flurry of interest in modern statistics and data science. while tensor estimation has been extensively studied in recent literature, most existing methods rely heavily on idealistic assumptions (e.g., i.i.d. noise), which are often violated in real applications. in addition, uncertainty quantification for low-rank tensors, also known as statistical inference in this context, remains vastly underexplored.

in this talk, i will present our recent progress on tensor learning. the first part of the talk is concerned with heteroskedastic tensor clustering, which seeks to extract underlying cluster structures from tensor observations in the presence of heteroskedastic noise. a novel tensor clustering algorithm will be introduced to achieve exact clustering under an (almost) necessary signal-to-noise ratio condition for polynomial-time algorithms. the second part of the talk focuses on uncertainty quantification for tensor learning. under a classical tensor pca model, i will present a two-iteration alternating minimization procedure, and demonstrate that inference of principal components can be efficiently accomplished. these two developments represent the prolific interplay between statistics and computation in tensor learning.