412 search results - page 5 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
TSP
2008
14 years 9 months ago
2008
We consider sequential regression of individual sequences under the square error loss. Using a competitive algorithm framework, we construct a sequential algorithm that can achieve...
EDBT
2009
ACM
15 years 22 days ago
2009
ACM
Constructing Haar wavelet synopses under a given approximation error has many real world applications. In this paper, we take a novel approach towards constructing unrestricted Ha...
ICML
2001
IEEE
15 years 10 months ago
2001
IEEE
We present an improved bound on the difference between training and test errors for voting classifiers. This improved averaging bound provides a theoretical justification for popu...
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
We propose a formulation of the Decision Tree learning algorithm in the Compression settings and derive tight generalization error bounds. In particular, we propose Sample Compres...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
—The standard algebraic decoding algorithm of cyclic codes [n, k, d] up to the BCH bound t is very efficient and practical for relatively small n while it becomes unpractical fo...