To refer to this page use:
|Abstract:||We propose an accelerated path-following iterative shrinkage thresholding algorithm (APISTA) for solving high-dimensional sparse nonconvex learning problems. The main difference between APISTA and the path-following iterative shrinkage thresholding algorithm (PISTA) is that APISTA exploits an additional coordinate descent subroutine to boost the computational performance. Such a modification, though simple, has profound impact: APISTA not only enjoys the same theoretical guarantee as that of PISTA, that is, APISTA attains a linear rate of convergence to a unique sparse local optimum with good statistical properties, but also significantly outperforms PISTA in empirical benchmarks. As an application, we apply APISTA to solve a family of nonconvex optimization problems motivated by estimating sparse semiparametric graphical models. APISTA allows us to obtain new statistical recovery results that do not exist in the existing literature. Thorough numerical results are provided to back up our theory.|
|Citation:||Tuo Zhao & Han Liu. (2016). Accelerated Path-Following Iterative Shrinkage Thresholding Algorithm With Application to Semiparametric Graph Estimation, Journal of Computational and Graphical Statistics, 25:4, 1272-1296, DOI: 10.1080/10618600.2016.1164533|
|Pages:||1272 - 1296|
|Type of Material:||Journal Article|
|Journal/Proceeding Title:||Journal of Computational and Graphical Statistics|
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.