18 search results - page 2 / 4 » New Error Bounds for Solomonoff Prediction |
COLT
2007
Springer
13 years 11 months ago
2007
Springer
We describe and analyze a new approach for feature ranking in the presence of categorical features with a large number of possible values. It is shown that popular ranking criteria...
COLT
1999
Springer
13 years 9 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
TCOM
2010
13 years 3 months ago
2010
In this paper we formally analyze the interleaver and code design for QAM-based BICM transmissions using the binary reflected Gray code. We develop analytical bounds on the bit e...
MA
2010
Springer
13 years 3 months ago
2010
Springer
Model selection by the predictive least squares (PLS) principle has been thoroughly studied in the context of regression model selection and autoregressive (AR) model order estima...
INFOCOM
2006
IEEE
13 years 11 months ago
2006
IEEE
— We address the problem of energy efficient sensing by adaptively coordinating the sleep schedules of sensor nodes while guaranteeing that values of sleeping nodes can be recov...