Efficient Sparse Modeling With Automatic Feature Grouping

Leon Wenliang Zhong, James T. Kwok

Published: 2012, Last Modified: 23 Sept 2023IEEE Trans. Neural Networks Learn. Syst. 2012Readers: Everyone

Abstract: For high-dimensional data, it is often desirable to group similar features together during the learning process. This can reduce the estimation variance and improve the stability of feature selection, leading to better generalization. Moreover, it can also help in understanding and interpreting data. Octagonal shrinkage and clustering algorithm for regression (OSCAR) is a recent sparse-modeling approach that uses a l 1 -regularizer and a pairwise l ∞ -regularizer on the feature coefficients to encourage such feature grouping. However, computationally, its optimization procedure is very expensive. In this paper, we propose an efficient solver based on the accelerated gradient method. We show that its key proximal step can be solved by a highly efficient simple iterative group merging algorithm. Given d input features, this reduces the empirical time complexity from O ( d 2 ~ d 5 ) for the existing solvers to just O ( d ). Experimental results on a number of toy and real-world datasets demonstrate that OSCAR is a competitive sparse-modeling approach, but with the added ability of automatic feature grouping.

0 Replies