1139 search results - page 32 / 228 » Bounded Ideation Theory |
NIPS
2007
13 years 10 months ago
2007
Variational methods are frequently used to approximate or bound the partition or likelihood function of a Markov random field. Methods based on mean field theory are guaranteed ...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
We study the one-way number-on-the-forehead (NOF) communication complexity of the k-layer pointer jumping problem with n vertices per layer. This classic problem, which has connec...
COLT
1998
Springer
14 years 1 months ago
1998
Springer
Most of the work which attempts to give bounds on the generalization error of the hypothesis generated by a learning algorithm is based on methods from the theory of uniform conve...
ICPR
2002
IEEE
14 years 1 months ago
2002
IEEE
This paper describes a novel application of Statistical Learning Theory (SLT) for motion prediction. SLT provides analytical VC-generalization bounds for model selection; these bo...
COLT
2000
Springer
14 years 1 months ago
2000
Springer
We give the first rigorous upper bounds on the error of temporal difference (td) algorithms for policy evaluation as a function of the amount of experience. These upper bounds pr...