31 search results - page 4 / 7 » Sharpening Occam's Razor |
ICGI
1994
Springer
14 years 1 months ago
1994
Springer
We describe a framework for inducing probabilistic grammars from corpora of positive samples. First, samples are incorporated by adding ad-hoc rules to a working grammar; subseque...
AAAI
2007
13 years 12 months ago
2007
In this paper, we consider the exploration of topological environments by a robot with weak sensory capabilities. We assume only that the robot can recognize when it has reached a...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Skepticism of the building block hypothesis has previously been expressed on account of the weak theoretical foundations of this hypothesis and anomalies in the empirical record o...
JIFS
2002
13 years 9 months ago
2002
This work addresses the problem of finding the adjustable parameters of a learning algorithm using Genetic Algorithms. This problem is also known as the model selection problem. In...
NIPS
2000
13 years 11 months ago
2000
Learning of a smooth but nonparametric probability density can be regularized using methods of Quantum Field Theory. We implement a field theoretic prior numerically, test its eff...