GSDAR: a fast Newton algorithm for \(\ell_0\) regularized generalized linear models with statistical guarantee (Q2135875): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00180-021-01098-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3146025976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adapting to unknown sparsity by controlling the false discovery rate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian model selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended Bayesian information criteria for model selection with large model spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended BIC for small-n-large-P sparse GLM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothing Methods and Semismooth Methods for Nondifferentiable Operator Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of unconstrained \(L_2 - L_p\) minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sure Independence Screening for Ultrahigh Dimensional Feature Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phenotypes and genotypes. The search for influential genes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4558147 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified primal dual active set algorithm for nonconvex sparse recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group Sparse Recovery via the $\ell ^0(\ell ^2)$ Penalty: Theory and Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularized M-estimators with nonconvexity: Statistical and algorithmic theory for local optima / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential Lasso Cum EBIC for Feature Selection With Ultra-High Dimensional Feature Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transformed \(\ell_1\) regularization for learning sparse deep neural networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized linear models / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Group Lasso for Logistic Regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Approximate Solutions to Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradient methods for minimizing composite functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>L</i> 1-Regularization Path Algorithm for Generalized Linear Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonsmooth version of Newton's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the dimension of a model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-dimensional generalized linear models and the lasso / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calibrating nonconvex penalized regression in ultra-high dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal computational and statistical rates of convergence for sparse nonconvex learning problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2896196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4558490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified versions of the Bayesian information criterion for sparse generalized linear models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly unbiased variable selection under minimax concave penalty / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general theory of concave regularization for high-dimensional sparse estimation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularization and Variable Selection Via the Elastic Net / rank
 
Normal rank

Latest revision as of 21:52, 28 July 2024

scientific article
Language Label Description Also known as
English
GSDAR: a fast Newton algorithm for \(\ell_0\) regularized generalized linear models with statistical guarantee
scientific article

    Statements

    GSDAR: a fast Newton algorithm for \(\ell_0\) regularized generalized linear models with statistical guarantee (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 May 2022
    0 references
    high-dimensional generalized linear models
    0 references
    sparse learning
    0 references
    \( \ell_0\)-penalty
    0 references
    support detection
    0 references
    estimation error
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers