Pathwise Coordinate Optimization for Sparse Learning: Algorithm and Theory

@article{Zhao2014PathwiseCO,
  title={Pathwise Coordinate Optimization for Sparse Learning: Algorithm and Theory},
  author={Tuo Zhao and Han Liu and Tong Zhang},
  journal={ArXiv},
  year={2014},
  volume={abs/1412.7477}
}
  • Tuo Zhao, Han Liu, Tong Zhang
  • Published 2014
  • Mathematics, Computer Science
  • ArXiv
  • The pathwise coordinate optimization is one of the most important computational frameworks for high dimensional convex and nonconvex sparse learning problems. It differs from the classical coordinate optimization algorithms in three salient features: {\it warm start initialization}, {\it active set updating}, and {\it strong rule for coordinate preselection}. Such a complex algorithmic structure grants superior empirical performance, but also poses significant challenge to theoretical analysis… CONTINUE READING
    31 Citations
    Statistical Optimization for High Dimensional Machine Learning with Privacy and Sparsity Constraints
    • J. Ge
    • Computer Science
    • 2019
    • Highly Influenced
    • PDF
    On Quadratic Convergence of DC Proximal Newton Algorithm for Nonconvex Sparse Learning in High Dimensions
    • 2
    • PDF
    On Faster Convergence of Cyclic Block Coordinate Descent-type Methods for Strongly Convex Minimization
    • 14
    • PDF
    On Quadratic Convergence of DC Proximal Newton Algorithm in Nonconvex Sparse Learning
    • 6
    • PDF
    An Interactive Greedy Approach to Group Sparsity in High Dimensions
    • 2
    • PDF
    Faster Coordinate Descent via Adaptive Importance Sampling
    • 33
    • PDF
    Safe Active Feature Selection for Sparse Learning
    • Highly Influenced
    • PDF

    References

    SHOWING 1-10 OF 76 REFERENCES
    PATHWISE COORDINATE OPTIMIZATION
    • 1,761
    • Highly Influential
    • PDF
    OPTIMAL COMPUTATIONAL AND STATISTICAL RATES OF CONVERGENCE FOR SPARSE NONCONVEX LEARNING PROBLEMS.
    • 134
    • PDF
    Accelerated Path-Following Iterative Shrinkage Thresholding Algorithm With Application to Semiparametric Graph Estimation
    • Tuo Zhao, H. Liu
    • Mathematics, Medicine
    • Journal of computational and graphical statistics : a joint publication of American Statistical Association, Institute of Mathematical Statistics, Interface Foundation of North America
    • 2016
    • 7
    • PDF
    SparseNet: Coordinate Descent With Nonconvex Penalties
    • 382
    • Highly Influential
    • PDF
    An Improved Convergence Analysis of Cyclic Block Coordinate Descent-type Methods for Strongly Convex Minimization
    • 12
    • PDF
    Regularized M-estimators with nonconvexity: statistical and algorithmic theory for local optima
    • 311
    • PDF
    Gradient methods for minimizing composite objective function
    • 1,222
    • Highly Influential
    • PDF
    Analysis of Multi-stage Convex Relaxation for Sparse Regularization
    • Tong Zhang
    • Mathematics, Computer Science
    • J. Mach. Learn. Res.
    • 2010
    • 389
    • PDF
    CALIBRATING NON-CONVEX PENALIZED REGRESSION IN ULTRA-HIGH DIMENSION.
    • 104
    • Highly Influential
    • PDF