Support vector machines learning noisy polynomial rules

M. Opper and R. Urbanczik

Physica A: Statistical Mechanics and its Applications, 2001, vol. 302, issue 1, 110-118

Abstract: Using statistical physics, we study support vector machines (SVMs) learning noisy target rules in cases when the optimal predictor is a polynomial of the inputs. If the kernel of the SVM has sufficiently high order or is transcendental, the scale of the learning curve and the asymptote is determined by the target rule and does not depend on the kernel. On this scale we find convergence to optimal generalization but no convergence of the training error to the generalization error.

Keywords: Support vector machine; Learning theory; Disordered systems (search for similar items in EconPapers)
Date: 2001
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437101004460
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:302:y:2001:i:1:p:110-118

DOI: 10.1016/S0378-4371(01)00446-0

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().