23 search results - page 3 / 5 » alt 2005 |
ALT
2005
Springer
2005
Springer
PAC-Learnability of Probabilistic Deterministic Finite State Automata in Terms of Variation Distance
14 years 2 months ago
We consider the problem of PAC-learning distributions over strings, represented by probabilistic deterministic finite automata (PDFAs). PDFAs are a probabilistic model for the gen...
ALT
2005
Springer
14 years 2 months ago
2005
Springer
Efficient learnability using the state merging algorithm is known for a subclass of probabilistic automata termed µ-distinguishable. In this paper, we prove that state merging alg...
ALT
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We describe and analyze an algorithm for predicting a sequence of n-dimensional binary vectors based on a set of experts making vector predictions in [0, 1]n . We measure...
ALT
2001
Springer
14 years 2 months ago
2001
Springer
While there has been a significant amount of theoretical and empirical research on the multiple-instance learning model, most of this research is for concept learning. However, f...
ALT
2005
Springer
14 years 2 months ago
2005
Springer
This paper shows how universal learning can be achieved with expert advice. To this aim, we specify an experts algorithm with the following characteristics: (a) it uses only feedba...