Scalable sparse tensor decompositions in distributed memory systems

International Conference for High Performance Computing, Networking, Storage and Analysis, SC

Volumn 15-20-November-2015, Issue , 2015, Pages

  Kaya, Oguz ^a   Uçar, Bora ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DIGITAL STORAGE; DISTRIBUTED COMPUTER SYSTEMS; ITERATIVE METHODS; MEMORY ARCHITECTURE;

CANDECOMP/PARAFAC; DISTRIBUTED MEMORY; DISTRIBUTED MEMORY SYSTEMS; HYPERGRAPH PARTITIONING; KHATRI-RAO PRODUCTS; PARTITIONING METHODS; TENSOR DECOMPOSITION; VECTOR MULTIPLICATION;

TENSORS;

EID: 84966668057     PISSN: 21674329     EISSN: 21674337     Source Type: Conference Proceeding    
DOI: 10.1145/2807591.2807624     Document Type: Conference Paper

References (34)

1. E. Acar, D. M. Dunlavy, and T. G. Kolda. A scalable optimization approach for fitting canonical tensor decompositions. Journal of Chemometrics, 25(2):67-86, February 2011.
2. C. A. Andersson and R. Bro. The N-way toolbox for MATLAB. Chemometrics and Intelligent Laboratory Systems, 52(1):1-4, 2000.
3. C. J. Appellof and E. Davidson. Strategies for analyzing data from video fluorometric monitoring of liquid chromatographic effluents. Analytical Chemistry, 53(13):2053-2056, 1981.
4. C. Aykanat, B. B. Cambazoglu, and B. Ucar. Multi-level direct K-way hypergraph partitioning with multiple constraints and fixed vertices. Journal of Parallel and Distributed Computing, 68:609-625, 2008.
5. B. W. Bader and T. G. Kolda. Efficient MATLAB computations with sparse and factored tensors. SIAM Journal on Scientific Computing, 30(1):205-231, December 2007.
6. B. W. Bader, T. G. Kolda, et al. Matlab tensor toolbox version 2.6. Available online, February 2015.
7. J. Bennett and S. Lanning. The netflix prize. In Proceedings ofKDD cup and workshop, volume 2007, page 35, 2007.
8. R. H. Bisseling and W. Meesen. Communication balancing in parallel sparse matrix-vector multiplication. Electronic Transactions on Numerical Analysis, 21:47-65, 2005.
9. A. Carlson, J. Betteridge, B. Kisiel, B. Settles, E. R. Hruschka Jr, and T. M. Mitchell. Toward an architecture for never-ending language learning. In AAAI, volume 5, page 3, 2010.
10. J. D. Carroll and J.-J. Chang. Analysis of individual differences in multidimensional scaling via an N-way generalization of "Eckart-Young" decomposition. Psychometrika, 35(3):283-319, 1970.
11. U. V. Catalyurek and C. Aykanat. Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication. IEEE Transactions on Parallel and Distributed Systems, 10(7):673-693, Jul 1999.
12. U. V. Catalyurek and C. Aykanat. PaToH: A Multilevel Hypergraph Partitioning Tool, Version 3.0. Bilkent University, Department of Computer Engineering, Ankara, 06533 Turkey. PaToH is available at http://bmi.osu.edu/~umit/software.htm, 1999.
13. U. V. Catalyurek. Hypergraph Models for Sparse Matrix Partitioning and Reordering. PhD thesis, Bilkent University, Computer Engineering and Information Science, Nov 1999.
14. J. H. Choi and S. V. N. Vishwanathan. DFacTo: Distributed factorization of tensors. In Z. Ghahramani, M. Welling, C. Cortes, N. D. Lawrence, and K. Q. Weinberger, editors, 27th Advances in Neural Information Processing Systems, pages 1296-1304, Montreal, Quebec, Canada, 2014.
15. P. Comon. Tensors: A brief introduction. IEEE Signal Processing Magazine, 31(3):44-53, May 2014.
16. L. De Lathauwer and B. De Moor. From matrix to tensor: Multilinear algebra and signal processing. In Institute ofMathematics and Its Applications Conference Series, volume 67, pages 1-16, 1998.
17. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA, 1979.
18. O. Gorlitz, S. Sizov, and S. Staab. Pints: Peer-to-peer infrastructure for tagging systems. In Proceedings of the 7th International Conference on Peer-to-peer Systems, IPTPS'08, page 19, Berkeley, CA, USA, 2008. USENIX Association.
19. G. Guennebaud, B. Jacob, et al. Eigen v3. http://eigen.tuxfamily.org, 2010.
20. R. A. Harshman. Foundations of the PARAFAC procedure: Models and conditions for an "explanatory" multi-modal factor analysis. UCLA Working Papers in Phonetics, 16:1-84, 1970.
21. B. Hendrickson. Load balancing fictions, falsehoods and fallacies. Applied Mathematical Modelling, 25:99-108, 2000.
22. B. Hendrickson and T. G. Kolda. Graph partitioning models for parallel computing. Parallel Computing, 26(12):1519-1534, 2000.
23. U. Kang, E. Papalexakis, A. Harpale, and C. Faloutsos. GigaTensor: Scaling tensor analysis up by 100 times-Algorithms and discoveries. In Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '12, pages 316-324, New York, NY, USA, 2012. ACM.
24. G. Karypis and V. Kumar. Multilevel algorithms for multi-constraint hypergraph partitioning. Technical Report 99-034, University of Minnesota, Department of Computer Science/Army HPC Research Center, Minneapolis, MN 55455, November 1998.
25. T. Kolda and B. Bader. The TOPHITS model for higher-order web link analysis. In Proceedings ofLink Analysis, Counterterrorism and Security 2006, 2006.
26. T. Kolda and B. Bader. Tensor decompositions and applications. SIAM Review, 51(3):455-500, 2009.
27. T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. Wiley-Teubner, Chichester, U.K., 1990.
28. A. P. Liavas and N. D. Sidiropoulos. Parallel algorithms for constrained tensor factorization via the alternating direction method of multipliers. arXiv preprint arXiv:1409.2383, 2014.
29. R. O. Selvitopi, M. M. Ozdal, and C. Aykanat. A novel method for scaling iterative solvers: Avoiding latency overhead of parallel sparse-matrix vector multiplies. IEEE Transactions on Parallel and Distributed Systems, 26(3):632-645, March 2015.
30. S. Smith and G. Karypis. DMS: Distributed sparse tensor factorization with alternating least squares. Technical Report 15-007, Department of Computer Science and Engineering, University of Minnesota, May 2015.
31. S. Smith, N. Ravindran, N. D. Sidiropoulos, and G. Karypis. SPLATT: Efficient and parallel sparse tensor-matrix multiplication. In 29th IEEE International Parallel & Distributed Processing Symposium, 2015. To appear.
32. B. Ucar and C. Aykanat. Encapsulating multiple communication-cost metrics in partitioning sparse rectangular matrices for parallel matrix-vector multiplies. SIAM Journal on Scientific Computing, 25(6):1837-1859, 2004.
33. B. Uccar and C. Aykanat. Revisiting hypergraph models for sparse matrix partitioning. SIAM Review, 49(4):595-603, 2007.
34. M. A. O. Vasilescu and D. Terzopoulos. Multilinear analysis of image ensembles: Tensorfaces. In Computer Vision-ECCV 2002, pages 447-460. Springer, 2002.