Name
Abstract | ||
|---|---|---|
Real data tensors are usually high dimensional but their intrinsic information is preserved in low-dimensional space, which motivates to use tensor decompositions such as Tucker decomposition. Often, real data tensors are not only low dimensional, but also smooth, meaning that the adjacent elements are similar or continuously changing, which typically appear as spatial or temporal data. To incorporate the smoothness property, we propose the smoothed Tucker decomposition (STD). STD leverages the smoothness by the sum of a few basis functions, which reduces the number of parameters. The objective function is formulated as a convex problem and, to solve that, an algorithm based on the alternating direction method of multipliers is derived. We theoretically show that, under the smoothness assumption, STD achieves a better error bound. The theoretical result and performances of STD are numerically verified. |
Year | Venue | Field |
|---|---|---|
2017 | ICML | Tensor density,Pattern recognition,Mathematical analysis,Computer science,Artificial intelligence,Smoothness,Tensor decomposition |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Masaaki Imaizumi | 1 | 2 | 2.75 |
| Hayashi, Kohei | 2 | 159 | 15.31 |