TY - GEN
T1 - Model-Augmented Conditional Mutual Information Estimation for Feature Selection
AU - Yang, Alan
AU - Ghassami, Amir Emad
AU - Raginsky, Maxim
AU - Kiyavash, Negar
AU - Rosenbaum, Elyse
N1 - Publisher Copyright:
© 2020 Proceedings of Machine Learning Research. All rights reserved.
PY - 2020
Y1 - 2020
N2 - Markov blanket feature selection, while theoretically optimal, is generally challenging to implement. This is due to the shortcomings of existing approaches to conditional independence (CI) testing, which tend to struggle either with the curse of dimensionality or computational complexity. We propose a novel two-step approach which facilitates Markov blanket feature selection in high dimensions. First, neural networks are used to map features to low-dimensional representations. In the second step, CI testing is performed by applying the k-NN conditional mutual information estimator to the learned feature maps. The mappings are designed to ensure that mapped samples both preserve information and share similar information about the target variable if and only if they are close in Euclidean distance. We show that these properties boost the performance of the k-NN estimator in the second step. The performance of the proposed method is evaluated on both synthetic and real data.
AB - Markov blanket feature selection, while theoretically optimal, is generally challenging to implement. This is due to the shortcomings of existing approaches to conditional independence (CI) testing, which tend to struggle either with the curse of dimensionality or computational complexity. We propose a novel two-step approach which facilitates Markov blanket feature selection in high dimensions. First, neural networks are used to map features to low-dimensional representations. In the second step, CI testing is performed by applying the k-NN conditional mutual information estimator to the learned feature maps. The mappings are designed to ensure that mapped samples both preserve information and share similar information about the target variable if and only if they are close in Euclidean distance. We show that these properties boost the performance of the k-NN estimator in the second step. The performance of the proposed method is evaluated on both synthetic and real data.
UR - https://www.scopus.com/pages/publications/85101645442
UR - https://www.scopus.com/pages/publications/85101645442#tab=citedBy
M3 - Conference contribution
AN - SCOPUS:85162635519
T3 - Proceedings of Machine Learning Research
SP - 1139
EP - 1148
BT - Proceedings of the 36th Conference on Uncertainty in Artificial Intelligence (UAI)
T2 - 36th Conference on Uncertainty in Artificial Intelligence, UAI 2020
Y2 - 3 August 2020 through 6 August 2020
ER -