329 search results - page 3 / 66 » Probably Approximately Correct Learning |
COLT
1994
Springer
13 years 9 months ago
1994
Springer
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 ...
VLDB
2006
ACM
14 years 5 months ago
2006
ACM
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
JMLR
2006
13 years 5 months ago
2006
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
ICANN
2003
Springer
13 years 10 months ago
2003
Springer
We discuss a Probably Approximate Correct (PAC) learning paradigm for Boolean formulas, which we call PAC meditation, where the class of formulas to be learnt is not known in advan...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
We propose a method to improve approximate inference methods by correcting for the influence of loops in the graphical model. The method is a generalization and alternative implem...