Sciweavers

3694 search results - page 211 / 739
» Stochastic complexity in learning
Sort
View
KCAP
2009
ACM
15 years 11 months ago
Interactively shaping agents via human reinforcement: the TAMER framework
As computational learning agents move into domains that incur real costs (e.g., autonomous driving or financial investment), it will be necessary to learn good policies without n...
W. Bradley Knox, Peter Stone
ICDM
2005
IEEE
116views Data Mining» more  ICDM 2005»
15 years 10 months ago
Learning Functional Dependency Networks Based on Genetic Programming
Bayesian Network (BN) is a powerful network model, which represents a set of variables in the domain and provides the probabilistic relationships among them. But BN can handle dis...
Wing-Ho Shum, Kwong-Sak Leung, Man Leung Wong
ICML
2007
IEEE
16 years 5 months ago
Sample compression bounds for decision trees
We propose a formulation of the Decision Tree learning algorithm in the Compression settings and derive tight generalization error bounds. In particular, we propose Sample Compres...
Mohak Shah
ALT
2010
Springer
15 years 6 months ago
Distribution-Dependent PAC-Bayes Priors
We further develop the idea that the PAC-Bayes prior can be informed by the data-generating distribution. We prove sharp bounds for an existing framework of Gibbs algorithms, and ...
Guy Lever, François Laviolette, John Shawe-...
NPL
2002
151views more  NPL 2002»
15 years 4 months ago
Additive Composition of Supervised Self Organizing Maps
The learning of complex relationships can be decomposed into several neural networks. The modular organization is determined by prior knowledge of the problem that permits to split...
Jean-Luc Buessler, Jean-Philippe Urban, Julien Gre...