An Interactive Greedy Approach to Group Sparsity in High Dimensions (Q6621653)

scientific article; zbMATH DE number 7928968

Language	Label	Description	Also known as
English	An Interactive Greedy Approach to Group Sparsity in High Dimensions	scientific article; zbMATH DE number 7928968

Statements

instance of

scholarly article

0 references

title

An Interactive Greedy Approach to Group Sparsity in High Dimensions (English)

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

18 October 2024

0 references

MaRDI profile type

Publication

0 references

cites work

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

Simultaneous analysis of Lasso and Dantzig selector

0 references

Decoding by Linear Programming

0 references

The Dantzig selector: statistical estimation when $p$ is much larger than $n$. (With discussions and rejoinder).

0 references

Matrix Variate Regressions and Envelope Models

0 references

Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties

0 references

Strong oracle optimality of folded concave penalized estimation

0 references

ADMM for High-Dimensional Sparse Penalized Quantile Regression

0 references

A tail inequality for quadratic forms of subgaussian random vectors

0 references

A selective review of group selection in high-dimensional models

0 references

The benefit of group sparsity

0 references

A stepwise regression method and consistent model selection for high-dimensional sparse linear models

0 references

Multiscale Mining of fMRI Data with Hierarchical Structured Sparsity

0 references

Group Sparse Recovery via the $\ell ^0(\ell ^2)$ Penalty: Theory and Algorithm

0 references

Q5488701

0 references

Q5405159

0 references

Oracle inequalities and optimal inference under group sparsity

0 references

Matching pursuits with time-frequency dictionaries

0 references

Q3998435

0 references

The Group Lasso for Logistic Regression

0 references

The benefit of group sparsity in group inference with de-biased scaled group Lasso

0 references

On the asymptotic properties of the group lasso estimator for linear models

0 references

Sparse Minimum Discrepancy Approach to Sufficient Dimension Reduction with Simultaneous Variable Selection in Ultrahigh Dimension

0 references

Model selection via standard error adjusted adaptive Lasso

0 references

Kernel estimation and model combination in a bandit problem with covariates

0 references

An Introduction to Conditional Random Fields

0 references

Q4864293

0 references

Greed is Good: Algorithmic Results for Sparse Approximation

0 references

The adaptive and the thresholded Lasso for potentially misspecified models (and a lower bound for the Lasso)

0 references

Consistent group selection in high-dimensional linear regression

0 references

Model Selection and Estimation in Regression with Grouped Variables

0 references

Nearly unbiased variable selection under minimax concave penalty

0 references

Q2880890

0 references

Adaptive Forward-Backward Greedy Algorithm for Learning Sparse Representations

0 references

Sparse Recovery With Orthogonal Matching Pursuit Under RIP

0 references

Pathwise coordinate optimization for sparse learning: algorithm and theory

0 references

The Adaptive Lasso and Its Oracle Properties

0 references

On the adaptive elastic net with a diverging number of parameters

0 references

Identifiers

DOI

10.1080/00401706.2018.1537897

0 references

Mathematics Subject Classification ID

62Pxx

0 references

zbMATH DE Number

7928968

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6621653