L1-Norm Higher-Order Orthogonal Iterations for Robust Tensor Analysis
Lists
Only you see this
Abstract
Standard Tucker tensor decomposition seeks to maximize the L2-norm of the compressed tensor; thus, it is very responsive to outlying/high-magnitude entries among the processed data. To counteract the impact of outliers in tensor data analysis, we propose L1-Tucker: a reformulation of standard Tucker decomposition, resulting by simple substitution of the outlier-responsive L2-norm by the sturdier L1-norm. Then, we propose the L1-norm Higher Order Orthogonal Iterations (L1-HOOI) algorithm for the approximate solution to L1-Tucker. Our numerical studies on data reconstruction and classification corroborate that L1-HOOI exhibits sturdy resistance against outliers compared to standard counterparts.
BibTeX
@inproceedings{chachlakis2020l,
author = {Dimitris G. Chachlakis and Ashley Prater-Bennette and Panos P. Markopoulos},
title = {{L1-Norm Higher-Order Orthogonal Iterations for Robust Tensor Analysis}},
booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
year = {2020},
url = {https://openreview.net/forum?id=3F9SvTSsV9},
}Loading related content...