Greedy Feature Construction
Abstract
We present an effective method for supervised feature construction. The main goal of the approach is to construct a feature representation for which a set of linear hypotheses is of sufficient capacity -- large enough to contain a satisfactory solution to the considered problem and small enough to allow good generalization from a small number of training examples. We achieve this goal with a greedy procedure that constructs features by empirically fitting squared error residuals. The proposed constructive procedure is consistent and can output a rich set of features. The effectiveness of the approach is evaluated empirically by fitting a linear ridge regression model in the constructed feature space and our empirical results indicate a superior performance of our approach over competing methods.
BibTeX
@inproceedings{NIPS2016_277a78fc,
author = {Oglic, Dino and G\"{a}rtner, Thomas},
booktitle = {Advances in Neural Information Processing Systems},
editor = {D. Lee and M. Sugiyama and U. Luxburg and I. Guyon and R. Garnett},
pages = {},
publisher = {Curran Associates, Inc.},
title = {Greedy Feature Construction},
url = {https://proceedings.neurips.cc/paper_files/paper/2016/file/277a78fc05c8864a170e9a56ceeabc4c-Paper.pdf},
volume = {29},
year = {2016}
}