A data-driven line search rule for support recovery in high-dimensional data analysis (Q2157522): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1633877
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Yu Ling Jiao / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3216330441 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast global convergence of gradient methods for high-dimensional statistical recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy Sparsity-Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed Sensing With Nonlinear Observations and Related Nonlinear Optimization Problems / 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: Atomic Decomposition by Basis Pursuit / 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: A Primal Dual Active Set Algorithm With Continuation for Compressed Sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pathwise coordinate optimization / 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: Fitting sparse linear models under the sufficient and necessary condition for model identification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4558147 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elastic-net regularization: error estimates and active set methods / 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: The Group Lasso for Logistic Regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified framework for high-dimensional analysis of \(M\)-estimators with decomposable regularizers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Description of the Minimizers of Least Squares Regularized with $\ell_0$-norm. Uniqueness of the Global Minimizer / 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: 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: High-Dimensional Statistics / 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: An extended Newton-type algorithm for \(\ell_2\)-regularized sparse logistic regression and its efficiency for classifying large-scale datasets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordinate descent algorithms for lasso penalized regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Proximal-Gradient Homotopy Method for the Sparse Least-Squares Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4558490 / 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: Q2896066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Recovery With Orthogonal Matching Pursuit Under RIP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton method for \(\ell_0\)-regularized optimization / rank
 
Normal rank

Latest revision as of 16:53, 29 July 2024

scientific article
Language Label Description Also known as
English
A data-driven line search rule for support recovery in high-dimensional data analysis
scientific article

    Statements

    A data-driven line search rule for support recovery in high-dimensional data analysis (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 July 2022
    0 references
    high-dimensional data analysis
    0 references
    sparsity assumption
    0 references
    \(\ell_0\) penalty
    0 references
    line search
    0 references
    \(\ell_2\) error bound
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers