Abstract
The least absolute shrinkage and selection operator (Lasso) has become very popular and attractive approach for regularization and variable selection for high-dimensional data in machine learning. In this paper, we present an extended alternating direction method of multipliers (ADMM) for solving the Lasso. The extended ADMM is global convergent, and all the subproblems can easily get the solutions. It can also be implemented in distributed manner, which is beneficial for storage and computation requirement. Numerical experiments demonstrated that the extended ADMM outperforms other popular algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
