1.4k citations
- RIKENJP127 papers
- The University of TokyoJP69 papers
- Japan Science and Technology AgencyJP30 papers
- Kyoto UniversityJP14 papers
- Systems Research InstitutePL12 papers
- University of TsukubaJP10 papers
- Forschungszentrum JülichDE8 papers
- Kobe City College of TechnologyJP8 papers
- Polish Academy of SciencesPL8 papers
- Yokohama National UniversityJP8 papers
- Centre National de la Recherche ScientifiqueFR7 papers
- Yamaguchi UniversityJP7 papers
4 papers · 2 filters
CANDECOMP/PARAFAC Decomposition of High-order Tensors Through Tensor Reshaping
Anh Huy Phan, Petr Tichavsky, Andrzej Cichocki
In general, algorithms for order-3 CANDECOMP/-PARAFAC (CP), also coined canonical polyadic decomposition (CPD), are easily to implement and can be extended to higher order CPD. Unf…
Accelerated Canonical Polyadic Decomposition by Using Mode Reduction
Guoxu Zhou, Andrzej Cichocki, Shengli Xie
Canonical Polyadic (or CANDECOMP/PARAFAC, CP) decompositions (CPD) are widely applied to analyze high order tensors. Existing CPD methods use alternating least square (ALS) iterati…
Low Complexity Damped Gauss-Newton Algorithms for CANDECOMP/PARAFAC
Anh Huy Phan, Petr Tichavský, Andrzej Cichocki
The damped Gauss-Newton (dGN) algorithm for CANDECOMP/PARAFAC (CP) decomposition can handle the challenges of collinearity of factors and different magnitudes of factors; neverthel…
On Fast Computation of Gradients for CANDECOMP/PARAFAC Algorithms
Anh Huy Phan, Petr Tichavský, Andrzej Cichocki
Product between mode- unfolding $\bY_{(n)}$ of an -D tensor $\tY$ and Khatri-Rao products of factor matrices $\bA^{(m)}$, exists in algo…