Bounds on error expectation for support vector machines.

V Vapnik; O Chapelle

doi:10.1162/089976600300015042

Home/Archive/PubMed

PubMed · 10976137

Bounds on error expectation for support vector machines.

V Vapnik·O Chapelle

View original source ↗Export metadata ↓

Abstract

We introduce the concept of span of support vectors (SV) and show that the generalization ability of support vector machines (SVM) depends on this new geometrical concept. We prove that the value of the span is always smaller (and can be much smaller) than the diameter of the smallest sphere containing the support vectors, used in previous bounds (Vapnik, 1998). We also demonstrate experimentally that the prediction of the test error given by the span is very accurate and has direct application in model selection (choice of the optimal parameters of the SVM).

Explore related subjects

Learning Models, Neurological Neural Networks, Computer Pattern Recognition, Automated Journal Article

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

V Vapnik, O Chapelle. 2000. Bounds on error expectation for support vector machines.. https://doi.org/10.1162/089976600300015042

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

PubMed2006

Lessons learned, funded research, integrity--what does it all mean?

Explore the source record for details and available documents.

Learning↗

PubMed2006

A statistical property of multiagent learning based on Markov decision process.

We exhibit an important property called the asymptotic equipartition property (AEP) on empirical sequences in an ergodic multiagent Markov decision process (MDP). Using the AEP which facilitates the analysis of multiagent learning, we give a statistical property of multiagent learning, such as reinforcement learning (RL), near the end of the learning process. We examine the effect of the conditions among the agents on the achievement of a cooperative policy in three different cases: blind, visible, and communicable. Also, we derive a bound on the speed with which the empirical sequence converges to the best sequence in probability, so that the multiagent learning yields the best cooperative result.

Learning↗

PubMed2006

Second order neurons and learning in Cohen-Grossberg networks.

The well known Cohen-Grossberg network is modified to include second order neural interconnections and also to have a learning component. Sufficient conditions are obtained for the existence of a globally exponentially stable equilibrium. The model provides a two-fold generalization of the Cohen-Grossberg network in the sense if one removes the learning component, then one gets a network with second order synaptic interactions; if both the learning component and the second order interactions are removed, then the model reduces to the standard Cohen-Grossberg network.

Learning↗