224 search results - page 8 / 45 » Bounding Learning Time in XCS |
JMLR
2006
13 years 8 months ago
2006
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
ECCC
2010
13 years 8 months ago
2010
Much work has been done on learning various classes of "simple" monotone functions under the uniform distribution. In this paper we give the first unconditional lower bo...
FOCS
1990
IEEE
14 years 14 days ago
1990
IEEE
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...
FOCS
2010
IEEE
13 years 6 months ago
2010
IEEE
We present a new algorithm for learning a convex set in n-dimensional space given labeled examples drawn from any Gaussian distribution. The complexity of the algorithm is bounded ...
WSC
2007
13 years 10 months ago
2007
Adaptive Time Warp protocols in the literature are usually based on a pre-defined analytic model of the system, expressed as a closed form function that maps system state to cont...