923 search results - page 79 / 185 » Requirements for Machine Lifelong Learning |
114
Voted
COLT
2000
Springer
15 years 5 months ago
2000
Springer
We investigate the computational complexity of the task of detecting dense regions of an unknown distribution from un-labeled samples of this distribution. We introduce a formal l...
113
click to vote
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
We consider a sequential decision problem where the rewards are generated by a piecewise-stationary distribution. However, the different reward distributions are unknown and may c...
92
Voted
ICML
2007
IEEE
16 years 1 months ago
2007
IEEE
Although each iteration of the popular kMeans clustering heuristic scales well to larger problem sizes, it often requires an unacceptably-high number of iterations to converge to ...
91
Voted
ICML
2008
IEEE
16 years 1 months ago
2008
IEEE
Typically agent evaluation is done through Monte Carlo estimation. However, stochastic agent decisions and stochastic outcomes can make this approach inefficient, requiring many s...
ICML
2008
IEEE
16 years 1 months ago
2008
IEEE
Point processes are difficult to analyze because they provide only a sparse and noisy observation of the intensity function driving the process. Gaussian Processes offer an attrac...