9886 search results - page 469 / 1978 » Learning Compressible Models |
157
click to vote
COLT
1999
Springer
15 years 10 months ago
1999
Springer
This paper proposes the use of constructive ordinals as mistake bounds in the on-line learning model. This approach elegantly generalizes the applicability of the on-line mistake ...
178
click to vote
CIKM
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we study the problem of learning block classification models to estimate block functions. We distinguish general models, which are learned across multiple sites, an...
232
click to vote
NIPS
2007
15 years 7 months ago
2007
Bayesian Reinforcement Learning has generated substantial interest recently, as it provides an elegant solution to the exploration-exploitation trade-off in reinforcement learning...
152
click to vote
IJAR
2007
15 years 6 months ago
2007
Pseudo-independent (PI) models are a special class of probabilistic domain model (PDM) where a set of marginally independent domain variables shows collective dependency, a specia...
144
click to vote
CIA
2001
Springer
15 years 11 months ago
2001
Springer
This paper describes a framework to construct interface agents with example dialogs based on the tasks by the machine learning technology. The Wizard of Oz method is used to collec...