1878 search results - page 124 / 376 » The Vienna Abstract Machine |
106
Voted
ALT
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We consider the framework of stochastic multi-armed bandit problems and study the possibilities and limitations of strategies that explore sequentially the arms. The stra...
ALT
2008
Springer
15 years 11 months ago
2008
Springer
Abstract. The nearest neighbor and the perceptron algorithms are intuitively motivated by the aims to exploit the “cluster” and “linear separation” structure of the data to...
109
Voted
ALT
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We consider the problem of learning stochastic tree languages, i.e. probability distributions over a set of trees T(F), from a sample of trees independently drawn accordi...
112
click to vote
ALT
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. Smooth boosting algorithms are variants of boosting methods which handle only smooth distributions on the data. They are proved to be noise-tolerant and can be used in th...
121
Voted
ALT
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. The present study aims at insights into the nature of incremental learning in the context of Gold’s model of identification in the limit. With a focus on natural requi...