Dynamic L1-Norm Tucker Tensor Decomposition

نویسندگان

چکیده

Tucker decomposition is a standard method for processing multi-way (tensor) measurements and finds many applications in machine learning data mining, among other fields. When tensor arrive streaming fashion or are too to jointly decompose, incremental analysis preferred. In addition, dynamic adaptation of bases desired when the nominal subspaces change. At same time, it has been documented that outliers can significantly compromise performance existing methods analysis. this work, we present Dynamic L1-Tucker: an algorithm outlier-resistant data. Our experimental studies on both real synthetic datasets corroborate proposed (i) attains high estimation performance, (ii) identifies/rejects outliers, (iii) adapts changes subspaces.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convex Tensor Decomposition via Structured Schatten Norm Regularization

We study a new class of structured Schatten norms for tensors that includes two recently proposed norms (“overlapped” and “latent”) for convex-optimization-based tensor decomposition. Based on the properties of the structured Schatten norms, we analyze the performance of “latent” approach for tensor decomposition, which was empirically found to perform better than the “overlapped” approach in s...

متن کامل

Hierarchical Tucker Tensor Optimization - Applications to Tensor Completion

Abstract—In this work, we develop an optimization framework for problems whose solutions are well-approximated by Hierarchical Tucker (HT) tensors, an efficient structured tensor format based on recursive subspace factorizations. Using the differential geometric tools presented here, we construct standard optimization algorithms such as Steepest Descent and Conjugate Gradient for interpolating ...

متن کامل

On Tensor Tucker Decomposition: the Case for an Adjustable Core Size

This paper is concerned with the problem of finding a Tucker decomposition for tensors. Traditionally, solution methods for Tucker decomposition presume that the size of the core tensor is specified in advance, which may not be a realistic assumption in some applications. In this paper we propose a new computational model where the configuration and the size of the core become a part of the dec...

متن کامل

Dynamic Point Selection for the L1 Norm Hyperplane Separation Problem

L1 norm discrimination consists in finding the hyperplane that minimizes the sum of L1 norm distances between the hyperplane and the points that lie on the wrong side of the hyperplane. This problem is difficult for datasets containing more than 100,000 points. Since few points are needed to obtain the optimal hyperplane, we propose a point selection algorithm which iteratively adds the necessa...

متن کامل

L1-norm Kernel PCA

We present the first model and algorithm for L1-norm kernel PCA. While L2-norm kernel PCA has been widely studied, there has been no work on L1-norm kernel PCA. For this non-convex and non-smooth problem, we offer geometric understandings through reformulations and present an efficient algorithm where the kernel trick is applicable. To attest the efficiency of the algorithm, we provide a conver...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Journal of Selected Topics in Signal Processing

سال: 2021

ISSN: ['1941-0484', '1932-4553']

DOI: https://doi.org/10.1109/jstsp.2021.3058846