A new stochastic optimization algorithm to decompose large nonnegative tensors

Abstract : In this letter, the problem of nonnegative tensor decompositions is addressed. Classically, this problem is carried out using iterative (either alternating or global) deterministic optimization algorithms. Here, a rather different stochastic approach is suggested. In addition, the ever-increasing volume of data requires the development of new and more efficient approaches to be able to process " Big data " tensors to extract relevant information. The stochastic algorithm outlined here comes within this framework. Both flexible and easy to implement, it is designed to solve the problem of the CP (Candecomp/Parafac) decomposition of huge nonnegative 3-way tensors while simultaneously enabling to handle possible missing data.
Document type :
Journal articles
Complete list of metadatas

Cited literature [33 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01146443
Contributor : Caroline Chaux <>
Submitted on : Tuesday, April 28, 2015 - 2:00:33 PM
Last modification on : Tuesday, April 2, 2019 - 2:03:33 AM
Long-term archiving on : Wednesday, April 19, 2017 - 9:00:16 AM

File

SingleFinalForIEEESPL.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01146443, version 1

Citation

Xuan Thanh Vu †, Sylvain Maire, Caroline Chaux, Nadège Thirion-Moreau. A new stochastic optimization algorithm to decompose large nonnegative tensors. IEEE Signal Processing Letters, Institute of Electrical and Electronics Engineers, 2015, 12 pp. ⟨hal-01146443⟩

Share

Metrics

Record views

600

Files downloads

469