3694 search results - page 354 / 739 » Stochastic complexity in learning |
199
click to vote
ALT
1997
Springer
15 years 11 months ago
1997
Springer
Efficient learning of DFA is a challenging research problem in grammatical inference. It is known that both exact and approximate (in the PAC sense) identifiability of DFA is har...
199
click to vote
COLT
1993
Springer
15 years 10 months ago
1993
Springer
In this paper we demonstrate how weighted majority voting with multiplicative weight updating can be applied to obtain robust algorithms for learning binary relations. We first pre...
176
click to vote
AUTONOMICS
2007
ACM
15 years 10 months ago
2007
ACM
Abstract. Adaptation of devices and applications based on contextual information has a great potential to enhance usability and mitigate the increasing complexity of mobile devices...
185
click to vote
ECAI
2000
Springer
15 years 10 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...
192
click to vote
AAAI
2010
15 years 8 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...