Sciweavers

3694 search results - page 141 / 739
» Stochastic complexity in learning
Sort
View
ALT
2006
Springer
14 years 7 months ago
Active Learning in the Non-realizable Case
Most of the existing active learning algorithms are based on the realizability assumption: The learner’s hypothesis class is assumed to contain a target function that perfectly c...
Matti Kääriäinen
CORR
2008
Springer
147views Education» more  CORR 2008»
13 years 10 months ago
A Minimum Relative Entropy Principle for Learning and Acting
This paper proposes a method to construct an adaptive agent that is universal with respect to a given class of experts, where each expert is designed specifically for a particular...
Pedro A. Ortega, Daniel A. Braun
NAACL
2010
13 years 8 months ago
Learning Dense Models of Query Similarity from User Click Logs
The goal of this work is to integrate query similarity metrics as features into a dense model that can be trained on large amounts of query log data, in order to rank query rewrit...
Fabio De Bona, Stefan Riezler, Keith Hall, Massimi...
ACL
2009
13 years 8 months ago
Learning to Tell Tales: A Data-driven Approach to Story Generation
Computational story telling has sparked great interest in artificial intelligence, partly because of its relevance to educational and gaming applications. Traditionally, story gen...
Neil McIntyre, Mirella Lapata
IJCNN
2007
IEEE
14 years 4 months ago
Multi-Stage Optimal Component Analysis
— Optimal component analysis (OCA) uses a stochastic gradient optimization process to find optimal representations for general criteria and shows good performance in object reco...
Yiming Wu, Xiuwen Liu, Washington Mio