Sciweavers

686 search results - page 61 / 138
» Minimax Probability Machine
Sort
View
COLT
2000
Springer
14 years 2 months ago
Average-Case Complexity of Learning Polynomials
The present paper deals with the averagecase complexity of various algorithms for learning univariate polynomials. For this purpose an appropriate framework is introduced. Based o...
Frank Stephan, Thomas Zeugmann
KDD
1999
ACM
152views Data Mining» more  KDD 1999»
14 years 2 months ago
Applying General Bayesian Techniques to Improve TAN Induction
Tree Augmented Naive Bayes (TAN) has shown to be competitive with state-of-the-art machine learning algorithms [3]. However, the TAN induction algorithm that appears in [3] can be...
Jesús Cerquides
COLT
1993
Springer
14 years 2 months ago
Lower Bounds on the Vapnik-Chervonenkis Dimension of Multi-Layer Threshold Networks
We consider the problem of learning in multilayer feed-forward networks of linear threshold units. We show that the Vapnik-Chervonenkis dimension of the class of functions that ca...
Peter L. Bartlett
COLT
1994
Springer
14 years 2 months ago
Lower Bounds on the VC-Dimension of Smoothly Parametrized Function Classes
We examine the relationship between the VCdimension and the number of parameters of a smoothly parametrized function class. We show that the VC-dimension of such a function class ...
Wee Sun Lee, Peter L. Bartlett, Robert C. Williams...
COLT
1992
Springer
14 years 2 months ago
Toward Efficient Agnostic Learning
In this paper we initiatean investigationof generalizationsof the ProbablyApproximatelyCorrect (PAC) learningmodelthat attemptto significantlyweakenthe target functionassumptions.T...
Michael J. Kearns, Robert E. Schapire, Linda Selli...