In this article, we propose a majorization–minimization (MM) algorithm for high-dimensional fused lasso regression (FLR) suitable for parallelization using graphics processing units (GPUs). The MM algorithm is stable and flexible as it can solve the FLR problems with various types of design matrices and penalty structures within a few tens of iterations. We also show that the convergence of the proposed algorithm is guaranteed. We conduct numerical studies to compare our algorithm with other existing algorithms, demonstrating that the proposed MM algorithm is competitive in many settings including the two-dimensional FLR with arbitrary design matrices. The merit of GPU parallelization is also exhibited. Supplementary materials are available online.
High-Dimensional Fused Lasso Regression Using Majorization–Minimization and Parallel Processing
Donghyeon Yu,Joong-Ho Won,Taehoon Lee,Johan Lim,Sungroh Yoon
Published 2013 in Journal of Computational and Graphical Statistics
ABSTRACT
PUBLICATION RECORD
- Publication year
2013
- Venue
Journal of Computational and Graphical Statistics
- Publication date
2013-06-09
- Fields of study
Mathematics, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-37 of 37 references · Page 1 of 1
CITED BY
Showing 1-39 of 39 citing papers · Page 1 of 1