329 search results - page 17 / 66 » Probably Approximately Correct Learning |
WSC
1997
13 years 8 months ago
1997
We consider the effect of common random numbers (CRNs) among simulated systems in two different multinomial selection procedures; the classical procedure BEM (Bechhofer, Elmaghr...
ESA
2010
Springer
13 years 8 months ago
2010
Springer
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...
STACS
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
TIT
1998
13 years 7 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...
ML
2012
ACM
12 years 3 months ago
2012
ACM
Dependency networks approximate a joint probability distribution over multiple random variables as a product of conditional distributions. Relational Dependency Networks (RDNs) are...