Learning Model-Based Sparsity via Projected Gradient Descent
From MaRDI portal
Abstract: Several convex formulation methods have been proposed previously for statistical estimation with structured sparsity as the prior. These methods often require a carefully tuned regularization parameter, often a cumbersome or heuristic exercise. Furthermore, the estimate that these methods produce might not belong to the desired sparsity model, albeit accurately approximating the true parameter. Therefore, greedy-type algorithms could often be more desirable in estimating structured-sparse parameters. So far, these greedy methods have mostly focused on linear statistical models. In this paper we study the projected gradient descent with non-convex structured-sparse parameter model as the constraint set. Should the cost function have a Stable Model-Restricted Hessian the algorithm produces an approximation for the desired minimizer. As an example we elaborate on application of the main results to estimation in Generalized Linear Model.
Cited in
(4)- From mathematical equivalence such as Ma equivalence to generalized Zhang equivalency including gradient equivalency
- Global and quadratic convergence of Newton hard-thresholding pursuit
- Quickly Finding the Best Linear Model in High Dimensions via Projected Gradient Descent
- Projective, sparse and learnable latent position network models
This page was built for publication: Learning Model-Based Sparsity via Projected Gradient Descent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976933)
