4773 search results - page 206 / 955 » Learning from Uncertain Data |
ICML
2000
IEEE
14 years 11 months ago
2000
IEEE
Eligibility traces have been shown to speed reinforcement learning, to make it more robust to hidden states, and to provide a link between Monte Carlo and temporal-difference meth...
EUROCOLT
1999
Springer
14 years 3 months ago
1999
Springer
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
ML
2006
ACM
13 years 10 months ago
2006
ACM
It is well known that many hard tasks considered in machine learning and data mining can be solved in a rather simple and robust way with an instanceand distance-based approach. In...
ICVGIP
2008
14 years 7 days ago
2008
Constructing a high-resolution (HR) image from lowresolution (LR) image(s) has been a very active research topic recently with focus shifting from multi-frames to learning based s...
NIPS
2007
14 years 6 days ago
2007
This contribution develops a theoretical framework that takes into account the effect of approximate optimization on learning algorithms. The analysis shows distinct tradeoffs for...