This communication deals with N-th order tensor decompositions. More precisely, we are interested in the (Canonical) Polyadic Decomposition. In our case, this problem is formulated under a variational approach where the considered criterion to be minimized is composed of several terms: one accounting for the fidelity to data and others that can represent not only regularization (such as sparsity prior) but also hard constraints (such as nonnegativity). The resulting optimization problem is solved by using the Block-Coordinate Variable Metric Forward-Backward (BC-VMFB) algorithm. The robustness and efficiency of the suggested approach is illustrated on realistic synthetic data such as those encountered in the context of environmental data analysis and fluorescence spectroscopy. Our simulations are performed on 4-th order tensors.
CITATION STYLE
Vu, X., Chaux, C., Thirion-Moreau, N., & Maire, S. (2017). A proximal approach for nonnegative tensor decomposition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10169 LNCS, pp. 201–210). Springer Verlag. https://doi.org/10.1007/978-3-319-53547-0_20
Mendeley helps you to discover research relevant for your work.