76 search results - page 7 / 16 » Agnostically Learning Halfspaces |
TIT
1998
13 years 6 months ago
1998
We show that if the closureof a function class F under the metric induced by some probability distribution is not convex, then the sample complexity for agnostically learning F wi...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We present and analyze an agnostic active learning algorithm that works without keeping a version space. This is unlike all previous approaches where a restricted set of candidate...
CC
2010
Springer
13 years 4 months ago
2010
Springer
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...
COLT
1992
Springer
13 years 10 months ago
1992
Springer
In this paper we initiatean investigationof generalizationsof the ProbablyApproximatelyCorrect (PAC) learningmodelthat attemptto significantlyweakenthe target functionassumptions.T...
IJCNN
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— The optimal model parameters of a kernel machine are typically given by the solution of a convex optimisation problem with a single global optimum. Obtaining the best p...