Hierarchical learning in polynomial Support Vector Machines
Sebastian Risau-Gusman, Mirta B. Gordon
Abstract
We study the typical properties of polynomial Support Vector Machines within a Statistical Mechanics approach that allows us to analyze the effect of different normalizations of the features. If the normalization is adecuately chosen, there is a hierarchical learning of features of increasing order as a function of the training set size.
Create a lesson
Related papers
The Stone-Wales trefoil: a new topological defect in graphene
M. V. Kondrin, Y. B. Lebed, V. V. Brazhkin
Short-Range Vector Spin Glasses: Parisi Hierarchies and Real-Space Ultrametricity
Akash Vijay, Jaewon Kim, Jong Yeon Lee
Lyapunov spectrum of random neural networks
David G. Clark
Revealing more on complex energy landscapes by passing less local information: Cavity approach with trust region in non-convex optimization problems
Zhiqi Xu, Chi Ho Yeung
Predicting activation-barrier and plasticity-onset statistics in a model of glasses
Makoto Suda, Edan Lerner, Eran Bouchbinder
Classifications in modular restricted Boltzmann machines
Elena Agliari, Andrea Lepre, Edoardo Roscani