3050 search results - page 296 / 610 » On-line Algorithms in Machine Learning |
169
click to vote
ALT
2005
Springer
2005
Springer
PAC-Learnability of Probabilistic Deterministic Finite State Automata in Terms of Variation Distance
16 years 3 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...
157
click to vote
COLT
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. We establish a generic theoretical tool to construct probabilistic bounds for algorithms where the output is a subset of objects from an initial pool of candidates (or mo...
162
click to vote
ATAL
2005
Springer
16 years 4 days ago
2005
Springer
This paper is concerned with personalisation of user agents by symbolic, on-line machine learning techniques. The application of these ideas to an infotainment agent is discussed ...
172
click to vote
COLT
2000
Springer
15 years 11 months ago
2000
Springer
Haussler, Kearns, Seung and Tishby introduced the notion of a shell decomposition of the union bound as a means of understanding certain empirical phenomena in learning curves suc...
158
click to vote
EWRL
2008
15 years 8 months ago
2008
Abstract. We consider a control problem where the decision maker interacts with a standard Markov decision process with the exception that the reward functions vary arbitrarily ove...