Selecting Diverse Features via Spectral Regularization
published: Jan. 15, 2013, recorded: December 2012, views: 2700
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
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 ℓ1-regularization schemes and show that we obtain a more diverse set of features that result in the regression problem being stable under perturbations.
Download slides: machine_das_spectral_01.pdf (471.3 KB)
Download article: machine_das_spectral_01.pdf (271.4 KB)
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !