Tensor Decomposition With Generalized Lasso Penalties

References

• Allen, G. (2012), “Sparse Higher-Order Principal Components Analysis,” in International Conference on Artificial Intelligence and Statistics, pp. 27–36.
   Google Scholar
• Anandkumar, A., Ge, R., and Janzamin, M. (2014), “Guaranteed Non-Orthogonal Tensor Decomposition via Alternating Rank-1 Updates,” arXiv preprint arXiv:1402.5180.
   Google Scholar
• Arnold, T., and Tibshirani, R. (2016), “Efficient Implementations of the Generalized Lasso Dual Path Algorithm,” Journal of Computational and Graphical Statistics, 25, 1–27.
   Google Scholar
• Bhaskara, A., Charikar, M., Moitra, A., and Vijayaraghavan, A. (2014), “Smoothed Analysis of Tensor Decompositions,” in Proceedings of the 46th Annual ACM Symposium on Theory of Computing, pp. 594–603.
   Google Scholar
• Cichocki, A. (2011), “Tensor Decompositions: A New Concept in Brain Data Analysis?” Journal of Control Measurement, and System Integration, 507–517.
   Google Scholar
• Cichocki, A., Zdunek, R., Phan, A. H., and Amari, S.-I. (2009), Nonnegative Matrix and Tensor Factorizations: Applications to Exploratory Multi-Way Data Analysis and Blind Source Separation, New York: Wiley.
   Google Scholar
• De Lathauwer, L., De Moor, B., and Vandewalle, J. (2000), “A Multilinear Singular Value Decomposition,” SIAM Journal on Matrix Analysis and Applications, 21, 1253–1278.
   Google Scholar
• Duchi, J., Shalev-Shwartz, S., Singer, Y., and Chandra, T. (2008), “Efficient Projections Onto the l 1-Ball for Learning in High Dimensions,” in Proceedings of the 25th International Conference on Machine Learning, ACM, pp. 272–279.
   Google Scholar
• Friedman, J., Hastie, T., and Tibshirani, R. (2010), “Applications of the Lasso and Grouped Lasso to the Estimation of Sparse Graphical Models,” Technical Report, Stanford University.
   Google Scholar
• Harshman, R. A. (1970), “Foundations of the PARAFAC Procedure: Models and Conditions for an ‘Explanatory’ Multimodal Factor Analysis,” UCLA Working Papers in Phonetics, 16, 1–84. Available at http://www.psychology.uwo.ca/faculty/harshman/wpppfac0.pdf
   Google Scholar
• Johnson, N. A. (2013), “A Dynamic Programming Algorithm for the Fused Lasso and L 0-Segmentation,” Journal of Computational and Graphical Statistics, 22, 246–260.
   Google Scholar
• Karatzoglou, A., Amatriain, X., Baltrunas, L., and Oliver, N. (2010), “Multiverse Recommendation: n-Dimensional Tensor Factorization for Context-Aware Collaborative Filtering,” in Proceedings of the Fourth ACM Conference on Recommender Systems, ACM, pp. 79–86.
   Google Scholar
• Kim, S.-J., Koh, K., Boyd, S., and Gorinevsky, D. (2009), “ℓ1 Trend Filtering,” SIAM Review, 51, 339–360.
   Google Scholar
• Kolda, T. G., and Bader, B. W. (2009), “Tensor Decompositions and Applications,” SIAM Review, 51, 455–500.
   Google Scholar
• Kroonenberg, P. M. (2008), Applied Multiway Data Analysis (Vol. 702), New York: Wiley.
   Google Scholar
• Ramdas, A., and Tibshirani, R. J. (2016), “Fast and Flexible ADMM Algorithms for Trend Filtering,” Journal of Computational and Graphical Statistics, 25, 839–858.
   Google Scholar
• Sun, W., Lu, J., Liu, H., and Cheng, G. (2016), “Provable Sparse Tensor Decomposition,” Journal of the Royal Statistical Society, Series B, 1467–9868.
   Google Scholar
• Tibshirani, R. (1996), “Regression Shrinkage and Selection via the Lasso,” Journal of the Royal Statistical Society, Series B, 58, 267–288.
   Google Scholar
• Tibshirani, R., Saunders, M., Rosset, S., Zhu, J., and Knight, K. (2005), “Sparsity and Smoothness via the Fused Lasso,” Journal of the Royal Statistical Society, Series B, 67, 91–108.
   Google Scholar
• Tibshirani, R. J. (2011), “The Solution Path of the Generalized Lasso,” The Annals of Statistics, 39, 1335–1371.
   Google Scholar
• ——— (2014), “Adaptive Piecewise Polynomial Estimation via Trend Filtering,” The Annals of Statistics, 42, 285–323.
   Google Scholar
• Wang, Y.-X., Sharpnack, J., Smola, A., and Tibshirani, R. J. (2014), “Trend Filtering on Graphs,” Journal of Machine Learning Research, 17, 1–41.
   Google Scholar
• Witten, D. M., Tibshirani, R., and Hastie, T. (2009), “A Penalized Matrix Decomposition, With Applications to Sparse Principal Components and Canonical Correlation Analysis,” Biostatistics, 10, 515–534.
   Google Scholar
• Zhu, Y. (2015), “An Augmented ADMM Algorithm With Application to the Generalized Lasso Problem,” Journal of Computational and Graphical Statistics, DOI: 10.1080/10618600.2015.1114491.
   Google Scholar