4544 search results - page 330 / 909 » Reinforcement Learning with Time |
145
click to vote
COLT
2008
Springer
15 years 6 months ago
2008
Springer
Standard no-internal-regret (NIR) algorithms compute a fixed point of a matrix, and hence typically require O(n3 ) run time per round of learning, where n is the dimensionality of...
121
click to vote
FOCS
2005
IEEE
15 years 10 months ago
2005
IEEE
We consider the problem of learning mixtures of product distributions over discrete domains in the distribution learning framework introduced by Kearns et al. [18]. We give a poly...
122
click to vote
ICGI
2010
Springer
15 years 2 months ago
2010
Springer
In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time length...
151
click to vote
AAAI
2007
15 years 6 months ago
2007
Accurately locating users in a wireless environment is an important task for many pervasive computing and AI applications, such as activity recognition. In a WiFi environment, a m...
154
click to vote
KDD
2008
ACM
16 years 4 months ago
2008
ACM
In many multiclass learning scenarios, the number of classes is relatively large (thousands,...), or the space and time efficiency of the learning system can be crucial. We invest...