This portal has been archived. Explore the next generation of this technology.

Selecting Diverse Features via Spectral Regularization

lib:bf5cc7834dc48093 (v1.0.0)

Authors: Abhimanyu Das,Anirban Dasgupta,Ravi Kumar
Where published: NeurIPS 2012 12
Document:  PDF  DOI 
Abstract URL: http://papers.nips.cc/paper/4689-selecting-diverse-features-via-spectral-regularization


We study the problem of diverse feature selection in linear regression: selecting a small subset of diverse features that can predict a given objective. Diversity is useful for several reasons such as interpretability, robustness to noise, etc. We propose several spectral regularizers that capture a notion of diversity of features and show that these are all submodular set functions. These regularizers, when added to the objective function for linear regression, result in approximately submodular functions, which can then be maximized approximately by efficient greedy and local search algorithms, with provable guarantees. We compare our algorithms to traditional greedy and $\ell_1$-regularization schemes and show that we obtain a more diverse set of features that result in the regression problem being stable under perturbations.

Relevant initiatives  

Related knowledge about this paper Reproduced results (crowd-benchmarking and competitions) Artifact and reproducibility checklists Common formats for research projects and shared artifacts Reproducibility initiatives

Comments  

Please log in to add your comments!
If you notice any inapropriate content that should not be here, please report us as soon as possible and we will try to remove it within 48 hours!