paper-with-me

Papers

Tensor Regression Using Low-rank and Sparse Tucker Decompositions

2019-11-09 · Talal Ahmed, Haroon Raja, Waheed U. Bajwa

This paper studies a tensor-structured linear regression model with a scalar response variable and tensor-structured predictors, such that the regression parameters form a tensor of order $d$ (i.e., a $d$-fold multiway array) in $\mathbb{R}^{n_1 \times n_2 \times \cdots \times n_d}$. It focuses on the task of estimating the regression tensor from $m$ realizations of the response variable and the predictors where $m\ll n = \prod \nolimits_{i} n_i$. Despite the seeming ill-posedness of this problem, it can still be solved if the parameter tensor belongs to the space of sparse, low Tucker-rank tensors. Accordingly, the estimation procedure is posed as a non-convex optimization program over the space of sparse, low Tucker-rank tensors, and a tensor variant of projected gradient descent is proposed to solve the resulting non-convex problem. In addition, mathematical guarantees are provided that establish the proposed method linearly converges to an appropriate solution under a certain set of conditions. Further, an upper bound on sample complexity of tensor parameter estimation for the model under consideration is characterized for the special case when the individual (scalar) predictors independently draw values from a sub-Gaussian distribution. The sample complexity bound is shown to have a polylogarithmic dependence on $\bar{n} = \max \big\{n_i: i\in \{1,2,\ldots,d \} \big\}$ and, orderwise, it matches the bound one can obtain from a heuristic parameter counting argument. Finally, numerical experiments demonstrate the efficacy of the proposed tensor model and estimation method on a synthetic dataset and a collection of neuroimaging datasets pertaining to attention deficit hyperactivity disorder. Specifically, the proposed method exhibits better sample complexities on both synthetic and real datasets, demonstrating the usefulness of the model and the method in settings where $n \gg m$.

📄 PDF Abstract BibTeX arXiv:1911.03725

Code (0)

등록된 구현이 없습니다.

Tasks

parameter estimationregression

Methods 이 논문이 사용한 방법론

Linear Regression Linear Regression is a method for modelling a relationship between a dependent variable and independent variables. These models can be fit with numerous approaches. The most…

Similar Papers 제목 키워드 기반

Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruption

2023-05-06 · HanQin Cai, Zehan Chao, Longxiu Huang, Deanna Needell

We study the tensor robust principal component analysis (TRPCA) problem, a tensorial extension of matrix robust principal component analysis (RPCA), that aims to split the given tensor into an underlying low-rank compone…

Fast and Accurate Randomized Algorithms for Low-rank Tensor Decompositions

2021-04-02 · NeurIPS 2021 12 · Linjian Ma, Edgar Solomonik

Low-rank Tucker and CP tensor decompositions are powerful tools in data analytics. The widely used alternating least squares (ALS) method, which solves a sequence of over-determined least squares subproblems, is costly f…

Fast Low-Rank Tensor Decomposition by Ridge Leverage Score Sampling

2021-07-22 · Matthew Fahrbach, Mehrdad Ghadiri, Thomas Fu

Low-rank tensor decomposition generalizes low-rank matrix approximation and is a powerful technique for discovering low-dimensional structure in high-dimensional data. In this paper, we study Tucker decompositions and us…

regressionTensor Decomposition

Tensor Decompositions: A New Concept in Brain Data Analysis?

2013-05-02 · Andrzej Cichocki

Matrix factorizations and their extensions to tensor factorizations and decompositions have become prominent techniques for linear and multilinear blind source separation (BSS), especially multiway Independent Component …

blind source separationClassificationClusteringDimensionality Reduction+2

Semi-tensor Product-based TensorDecomposition for Neural Network Compression

2021-09-30 · Hengling Zhao, Yipeng Liu, Xiaolin Huang, Ce Zhu

The existing tensor networks adopt conventional matrix product for connection. The classical matrix product requires strict dimensionality consistency between factors, which can result in redundancy in data representatio…

Low-rank compressionNeural Network CompressionTensor Networks