IEEE Transactions on Signal Processing· 2017Q1· Review
Tensor Decomposition for Signal Processing and Machine Learning
- 1,611citations
- Q1SCImago
- 2017year
Short summary
This overview article introduces tensor decomposition, a powerful mathematical tool for analyzing multi-dimensional data, to researchers and practitioners in signal processing and machine learning.
AI-generated from the title and abstract; the full text is not read.
Key points
- Tensors are multi-dimensional arrays extending matrix concepts to data with three or more indices.
- The paper covers tensor rank, decomposition, factorization models, and their properties.
- Algorithms discussed include alternating optimization and stochastic gradient methods.
- Applications span source separation, collaborative filtering, topic modeling, and multilinear subspace learning.
AI-generated from the title and abstract; the full text is not read.
Abstract
Tensors or multiway arrays are functions of three or more indices (i, j, k, . . . )-similar to matrices (two-way arrays), which are functions of two indices (r, c) for (row, column). Tensors have a rich history, stretching over almost a century, and touching upon numerous disciplines; but they have only recently become ubiquitous in signal and data analytics at the confluence of signal processing, statistics, data mining, and machine learning. This overview article aims to provide a good starting point for researchers and practitioners interested in learning about and working with tensors. As such, it focuses on fundamentals and motivation (using various application examples), aiming to strike an appropriate balance of breadth and depth that will enable someone having taken first graduate courses in matrix algebra and probability to get started doing research and/or developing tensor algorithms and software. Some background in applied optimization is useful but not strictly required. The material covered includes tensor rank and rank decomposition; basic tensor factorization models and their relationships and properties (including fairly good coverage of identifiability); broad coverage of algorithms ranging from alternating optimization to stochastic gradient; statistical performance analysis; and applications ranging from source separation to collaborative filtering, mixture and topic modeling, classification, and multilinear subspace learning.
The authors' abstract, as published at the source. IEEE Transactions on Signal Processing, 2017 · DOI ↗
Continue with a free account
Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.
Continue free on the webSign in with Google or Apple; no card needed. You come back to this paper.
On your phone:
Field: Computational Mathematics
Computational MathematicsMathematics