Low-rank Structured Data Analysis: Methods, Models and Algorithms

Job Candidate Talk
Tuesday, February 22, 2022 - 11:00am for 1 hour (actually 50 minutes)
Longxiu Huang – UCLA – huangL3@math.ucla.eduhttp://longxiuhuang.com/
Wenjing Liao

In modern data analysis, the datasets are often represented by large-scale matrices or tensors (the generalization of matrices to higher dimensions). To have a better understanding or extract   values effectively from these data, an important step is to construct a low-dimensional/compressed representation of the data that may be better to analyze and interpret in light of a corpus of field-specific information. To implement the goal, a primary tool is the matrix/tensor decomposition. In this talk, I will talk about novel matrix/tensor decompositions, CUR decompositions, which are memory efficient and computationally cheap. Besides, I will also discuss the applications of CUR decompositions on developing efficient algorithms or models to robust decompositions or data completion problems. Additionally, some simulation results will be provided on real and synthetic datasets.