Sciweavers

732 search results - page 27 / 147
» Strongly Non-U-Shaped Learning Results by General Techniques
Sort
View
RIA
2006
84views more  RIA 2006»
13 years 7 months ago
Learning Recursive Automata from Positive Examples
In this theoretical paper, we compare the "classical" learning techniques used to infer regular grammars from positive examples with the ones used to infer categorial gra...
Isabelle Tellier
ICML
2000
IEEE
14 years 8 months ago
Eligibility Traces for Off-Policy Policy Evaluation
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...
Doina Precup, Richard S. Sutton, Satinder P. Singh
EPS
1997
Springer
13 years 11 months ago
Performance-Enhanced Genetic Programming
Genetic Programming is increasing in popularity as the basis for a wide range of learning algorithms. However, the technique has to date only been successfully applied to modest t...
Chris Clack, Tina Yu
ECCV
2010
Springer
13 years 11 months ago
Discovering Multipart Appearance Models from Captioned Images
Abstract. Even a relatively unstructured captioned image set depicting a variety of objects in cluttered scenes contains strong correlations between caption words and repeated visu...
MCS
2009
Springer
14 years 2 months ago
Selective Ensemble under Regularization Framework
An ensemble is generated by training multiple component learners for a same task and then combining them for predictions. It is known that when lots of trained learners are availab...
Nan Li, Zhi-Hua Zhou