Hierarchical Learning in Polynomial Support Vector Machines
Abstract
We study the typical properties of polynomial Support Vector Machines within a Statistical Mechanics approach that takes into account the number of high order features relative to the input space dimension. We analyze the effect of different features' normalizations on the generalization error, for different kinds of learning tasks. If the normalization is adequately selected, hierarchical learning of features of increasing order takes place as a function of the training set size. Otherwise, the performance worsens, and there is no hierarchical learning at all.
Cite
Text
Risau-Gusman and Gordon. "Hierarchical Learning in Polynomial Support Vector Machines." Machine Learning, 2002. doi:10.1023/A:1012442008732Markdown
[Risau-Gusman and Gordon. "Hierarchical Learning in Polynomial Support Vector Machines." Machine Learning, 2002.](https://mlanthology.org/mlj/2002/risaugusman2002mlj-hierarchical/) doi:10.1023/A:1012442008732BibTeX
@article{risaugusman2002mlj-hierarchical,
title = {{Hierarchical Learning in Polynomial Support Vector Machines}},
author = {Risau-Gusman, Sebastian and Gordon, Mirta B.},
journal = {Machine Learning},
year = {2002},
pages = {53-70},
doi = {10.1023/A:1012442008732},
volume = {46},
url = {https://mlanthology.org/mlj/2002/risaugusman2002mlj-hierarchical/}
}