3250 search results - page 280 / 650 » Parameterized Learning Complexity |
163
click to vote
ECAI
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. We are interested in the relationship between learning efficiency and representation in the case of supervised neural networks for pattern classification trained by conti...
148
click to vote
AAAI
2010
15 years 6 months ago
2010
Recent advancements in model-based reinforcement learning have shown that the dynamics of many structured domains (e.g. DBNs) can be learned with tractable sample complexity, desp...
130
click to vote
NIPS
2007
15 years 6 months ago
2007
We consider apprenticeship learning—learning from expert demonstrations—in the setting of large, complex domains. Past work in apprenticeship learning requires that the expert...
154
click to vote
AAAI
2006
15 years 6 months ago
2006
We present an algorithm that derives actions' effects and preconditions in partially observable, relational domains. Our algorithm has two unique features: an expressive rela...
166
click to vote
ICML
2010
IEEE
15 years 6 months ago
2010
IEEE
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...