no code implementations • 16 Nov 2022 • Mingyu Qi, Tianxi Li
Thanks to the separability, the computation of regularization based on our penalty is substantially faster than that of the overlapping group lasso, especially for large-scale and high-dimensional problems.
