412 search results - page 3 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
COLT
2007
Springer
13 years 11 months ago
2007
Springer
We present data-dependent error bounds for transductive learning based on transductive Rademacher complexity. For specific algorithms we provide bounds on their Rademacher complex...
ICML
1994
IEEE
13 years 8 months ago
1994
IEEE
Model selection is important in many areas of supervised learning. Given a dataset and a set of models for predicting with that dataset, we must choose the model which is expected...
PDPTA
2004
13 years 6 months ago
2004
We present the MBRAM model for static evaluation of the performance of memory-bound programs. The MBRAM model predicts the actual running time of a memory-bound program directly fr...
ML
2000
ACM
13 years 5 months ago
2000
ACM
Twenty-two decision tree, nine statistical, and two neural network algorithms are compared on thirty-two datasets in terms of classification accuracy, training time, and (in the ca...
ATAL
2008
Springer
13 years 7 months ago
2008
Springer
Predictive state representations (PSRs) are models that represent the state of a dynamical system as a set of predictions about future events. The existing work with PSRs focuses ...