COLT
2003
Springer
13 years 10 months ago
2003
Springer
COLT
2003
Springer
13 years 10 months ago
2003
Springer
Sublearning, a model for learning of subconcepts of a concept, is presented. Sublearning a class of total recursive functions informally means to learn all functions from that cla...
COLT
2003
Springer
13 years 10 months ago
2003
Springer
We consider three natural models of random logarithmic depth decision trees over Boolean variables. We give an efficient algorithm that for each of these models learns all but an ...
COLT
2003
Springer
13 years 10 months ago
2003
Springer
COLT
2003
Springer
13 years 10 months ago
2003
Springer
This paper studies sequence prediction based on the monotone Kolmogorov complexity Km=−log m, i.e. based on universal deterministic/one-part MDL. m is extremely close to Solomon...
COLT
2003
Springer
13 years 10 months ago
2003
Springer
A general class of no-regret learning algorithms, called no-Φ-regret learning algorithms, is defined which spans the spectrum from no-external-regret learning to no-internal-reg...
COLT
2003
Springer
13 years 10 months ago
2003
Springer
COLT
2003
Springer
13 years 10 months ago
2003
Springer
COLT
2003
Springer
13 years 10 months ago
2003
Springer
A mere bounded number of random bits judiciously employed by a probabilistically correct algorithmic coordinator is shown to increase the power of learning to coordinate compared ...
COLT
2003
Springer
13 years 10 months ago
2003
Springer
