Variational Information Maximization for Feature Selection

By Shuyang Gao, Greg Ver Steeg, Aram Galstyan. 2016

53 citations recorded by the source corpus.

Feature selection is one of the most fundamental problems in machine learning. An extensive body of work on information-theoretic feature selection exists which is based on maximizing mutual information between subsets of features and class labels. Practical methods are forced to rely on approximations due to the difficulty of estimating mutual information. We demonstrate that approximations made by existing methods are based on unrealistic assumptions. We formulate a more flexible and general class of assumptions based on variational distributions and use them to tractably generate lower bounds for mutual information. These bounds define a novel information-theoretic framework for feature selection, which we prove to be optimal under tree graphical models with proper choice of variational distributions. Our experiments demonstrate that the proposed method strongly outperforms existing information-theoretic feature selection approaches.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Jiliang Tang
  2. Le Song
  3. Michael I. Jordan
  4. Huan Liu
  5. Arthur Gretton
  6. Bernhard Schölkopf
  7. Jundong Li
  8. Tatsuya Harada

In Computer Vision and Pattern Recognition

  1. Tatsuya Harada
  2. Luc Van Gool
  3. Yi Yang
  4. Dacheng Tao
  5. Jiliang Tang
  6. Andrea Vedaldi
  7. Ming-Hsuan Yang
  8. Trevor Darrell

Citations in the corpus