Scientific Computing Seminar

Date:
Friday, March 11, 2005
Time:
1:00pm-2:00pm
Location:
50B-4205
Seminar Speaker:
Lek-Heng Lim
Institute for Computational and Mathematical Engineering
Stanford University
http://www.stanford.edu/~lekheng/
Title:
Low-rank approximation of tensors and the statistical analysis of multi-indexed data
Abstract:
Multi-indexed (or multiway) data has become increasingly common in many applications from Chemistry to Psychology to Signal Processing. This is in part an inevitable consequence of technological advancement -- the use of more sophisticated instruments and methodologies has led to data of a more complex nature. For example, measurements from a spectrophotometric fluorescence detector in high-performance liquid chromatography yield a 3-way data array. It is thus pertinent that corresponding mathematical and statistical techniques be developed to the modelling and analysis of such data.

We will discuss generalizations of factor analysis and principal component analysis to multiway data. Just as matrix-based methods are often used in the analysis of 2-way data arrays (modelled as matrices), tensor-based methods may be used to effectively analyze k-way data arrays (modelled as order-k tensors). Unfortunately, the properties of tensors of order 3 or higher is markedly different from those of tensors of order 2 (ie. matrices) and thus straight-forward generalizations of matrix techniques to tensors often do not work. We will show that an "Eckart-Young Theorem"-like result for tensors is non-existent for tensors of order 3 or higher, regardless of the choice of norm. In fact, the problem of finding an optimal low-rank approximation to an arbitrary tensor is ill-posed in every sense of the word -- nonexistent, nonunique and unstable. The ill-posedness of the problem leads to serious ill-conditioning in practice when one tries to compute a near optimal low-rank tensor approximation. We will show how the problem may be remedied by a natural redefinition of rank and with the use of the hyperdeterminant -- a generalization of the matrix determinant to k-way arrays, first introduced by Cayley 160 years ago but remained largely unknown until recently. We will give examples of applications.

This is joint work with Vin de Silva, Department of Mathematics, Stanford University

Sponsor of Seminar:
Chris Ding
Scientific Computing

Contact Esmond G. Ng EGNg@lbl.gov