4128 search results - page 312 / 826 » Learning and using relational theories |
159
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
— We prove the following strong hardness result for learning: Given a distribution on labeled examples from the hypercube such that there exists a monomial (or conjunction) consi...
188
Voted
COLT
2006
Springer
15 years 10 months ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
172
click to vote
JMLR
2008
15 years 6 months ago
2008
This paper presents the dynamics of multiple learning agents from an evolutionary game theoretic perspective. We provide replicator dynamics models for cooperative coevolutionary ...
187
click to vote
JMLR
2010
15 years 1 months ago
2010
The problem of characterizing learnability is the most basic question of statistical learning theory. A fundamental and long-standing answer, at least for the case of supervised c...
161
click to vote
ECML
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. We introduce a nonparametric model for sensitivity estimation which relies on generating points similar to the prediction point using its k nearest neighbors. Unlike most...