107 search results - page 5 / 22 » General Loss Bounds for Universal Sequence Prediction |
ALT
2004
Springer
14 years 4 months ago
2004
Springer
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Solomonoff completed the Bayesian framework by providing a rigorous, unique, formal, and universal choice for the model class and the prior. We discuss in breadth how and in which...
JMLR
2010
13 years 2 months ago
2010
Structured prediction tasks pose a fundamental trade-off between the need for model complexity to increase predictive power and the limited computational resources for inference i...
ALT
2004
Springer
14 years 4 months ago
2004
Springer
When applying aggregating strategies to Prediction with Expert Advice, the learning rate must be adaptively tuned. The natural choice of complexity/current loss renders the analys...
NIPS
2004
13 years 8 months ago
2004
Prediction suffix trees (PST) provide a popular and effective tool for tasks such as compression, classification, and language modeling. In this paper we take a decision theoretic...