Sciweavers

3339 search results - page 216 / 668
» Relational Learning by Imitation
Sort
View
ICML
1996
IEEE
16 years 7 months ago
On the Learnability of the Uncomputable
Within Valiant'smodel of learning as formalized by Kearns, we show that computable total predicates for two formallyuncomputable problems the classical Halting Problem, and t...
Richard H. Lathrop
ALT
2006
Springer
16 years 3 months ago
Asymptotic Learnability of Reinforcement Problems with Arbitrary Dependence
We address the problem of reinforcement learning in which observations may exhibit an arbitrary form of stochastic dependence on past observations and actions. The task for an age...
Daniil Ryabko, Marcus Hutter
UAI
2008
15 years 8 months ago
Convex Point Estimation using Undirected Bayesian Transfer Hierarchies
When related learning tasks are naturally arranged in a hierarchy, an appealing approach for coping with scarcity of instances is that of transfer learning using a hierarchical Ba...
Gal Elidan, Benjamin Packer, Geremy Heitz, Daphne ...
ML
2008
ACM
15 years 6 months ago
A bias/variance decomposition for models using collective inference
Bias/variance analysis is a useful tool for investigating the performance of machine learning algorithms. Conventional analysis decomposes loss into errors due to aspects of the le...
Jennifer Neville, David Jensen
DIS
2010
Springer
15 years 5 months ago
Adapted Transfer of Distance Measures for Quantitative Structure-Activity Relationships
Quantitative structure-activity relationships (QSARs) are regression models relating chemical structure to biological activity. Such models allow to make predictions for toxicologi...
Ulrich Rückert, Tobias Girschick, Fabian Buch...