Dynamic Screening: Accelerating First-Order Algorithms for the Lasso and Group-Lasso

DOI10.1109/TSP.2015.2447503zbMath1394.94087arXiv1412.4080OpenAlexW1757098471MaRDI QIDQ4580827

Valentin Emiya, Liva Ralaivola, Antoine Bonnefoy, Rémi Gribonval

Publication date: 22 August 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (9)

A Scalable Hierarchical Lasso for Gene–Environment Interactions ⋮ Unnamed Item ⋮ Screening for a reweighted penalized conditional gradient method ⋮ Communication-efficient distributed multi-task learning with matrix sparsity regularization ⋮ ``FISTA in Banach spaces with adaptive discretisations ⋮ A safe reinforced feature screening strategy for Lasso based on feasible solutions ⋮ Unnamed Item ⋮ A hybrid acceleration strategy for nonparallel support vector machine ⋮ Gap Safe screening rules for sparsity enforcing penalties

This page was built for publication: Dynamic Screening: Accelerating First-Order Algorithms for the Lasso and Group-Lasso