181 search results - page 9 / 37 » Polynomial Learning of Distribution Families |
COLT
1992
Springer
14 years 1 months ago
1992
Springer
We consider PAC-learning where the distribution is known to the student. The problem addressed here is characterizing when learnability with respect to distribution D1 implies lea...
EUROGP
2008
Springer
13 years 11 months ago
2008
Springer
We present N-gram GP, an estimation of distribution algorithm for the evolution of linear computer programs. The algorithm learns and samples the joint probability distribution of...
FOCS
1990
IEEE
14 years 1 months 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 ...
NEUROSCIENCE
2001
Springer
14 years 2 months ago
2001
Springer
We propose a theoretical framework for specification and analysis of a class of learning problems that arise in open-ended environments that contain multiple, distributed, dynamic...
ICCV
2011
IEEE
12 years 10 months ago
2011
IEEE
Recent work on unsupervised feature learning has shown that learning on polynomial expansions of input patches, such as on pair-wise products of pixel intensities, can improve the...