Skip to content
conftrace_

sparse group lasso

10 papers

Explore in graph

Also known as

SGL

Co-occurring keywords · papers mentioning both

convex optimization (4) feature reduction (3) dual feasible set (2) screening rule (2) linear regression (2) feature selection (2) bregman admm (1) event branching (1) l1 norm (1) l2 norm (1)

Papers

A Plug-and-Play Bregman ADMM Module for Inferring Event Branches in Temporal Point Processes AAAI 2025 Dual Feature Reduction for the Sparse-group Lasso and its Adaptive Variant ICML 2025 On Regularized Square-root Regression Problems: Distributionally Robust Interpretation and Fast Computations JMLR 2022 Fast Sparse Group Lasso NeurIPS 2019 Two-Layer Feature Reduction for Sparse-Group Lasso via Decomposition of Convex Sets JMLR 2019 Two New Approaches to Compressed Sensing Exhibiting Both Robust Sparse Recovery and the Grouping Effect JMLR 2017 GAP Safe Screening Rules for Sparse-Group Lasso NeurIPS 2016 Learning Granger Causality for Hawkes Processes ICML 2016 Making the Most of Bag of Words: Sentence Regularization with Alternating Direction Method of Multipliers ICML 2014 Two-Layer Feature Reduction for Sparse-Group Lasso via Decomposition of Convex Sets NeurIPS 2014