412 search results - page 33 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
COLT
2004
Springer
15 years 5 months ago
2004
Springer
We study the properties of the Minimum Description Length principle for sequence prediction, considering a two-part MDL estimator which is chosen from a countable class of models....
118
click to vote
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract— We consider the problem of estimating cascaded aggregates over a matrix presented as a sequence of updates in a data stream. A cascaded aggregate P ◦Q is defined by ...
ML
2008
ACM
14 years 11 months ago
2008
ACM
Abstract We present a new margin-based approach to first-order rule learning. The approach addresses many of the prominent challenges in first-order rule learning, such as the comp...
100
click to vote
STOC
2009
ACM
16 years 13 days ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
IPPS
2008
IEEE
2008
IEEE
Modeling and predicting application performance on parallel computers using HPC challenge benchmarks
15 years 6 months ago
A method is presented for modeling application performance on parallel computers in terms of the performance of microkernels from the HPC Challenge benchmarks. Specifically, the a...