Sparse Group Lasso: Optimal Sample Complexity, Convergence Rate, and Statistical Inference

DOI10.1109/TIT.2022.3175455OpenAlexW2974735694MaRDI QIDQ5039993

Author name not available (Why is that?)

Publication date: 11 October 2022

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.09851

Mathematics Subject Classification ID

Information and communication theory, circuits (94-XX)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• The benefit of group sparsity in group inference with de-biased scaled group Lasso 👍 👎
• Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms 👍 👎
• An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems 👍 👎
• Asymptotic theory of the adaptive sparse group Lasso 👍 👎
• Convergence and sparsity of Lasso and group Lasso in high-dimensional generalized linear models 👍 👎
• An Iterative Sparse-Group Lasso 👍 👎
• Multivariate sparse group lasso for the multivariate multiple linear regression with an arbitrary group structure 👍 👎
• Sparse optimization for nonconvex group penalized estimation 👍 👎

This page was built for publication: Sparse Group Lasso: Optimal Sample Complexity, Convergence Rate, and Statistical Inference

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5039993)