107 search results - page 6 / 22 » General Loss Bounds for Universal Sequence Prediction |
AAAI
1997
13 years 8 months ago
1997
The absolute loss is the absolute difference between the desired and predicted outcome. I demonstrateworst-case upper bounds on the absolute loss for the perceptron algorithm and ...
COLT
2005
Springer
13 years 9 months ago
2005
Springer
Abstract. We investigate the generalization behavior of sequential prediction (online) algorithms, when data are generated from a probability distribution. Using some newly develop...
RC
2007
13 years 6 months ago
2007
This paper develops easily computed, tight bounds on Generalized Linear Predictors and instrumental variable estimators when outcome data are partially identi…ed. A salient exam...
TIT
2002
13 years 7 months ago
2002
The problem of optimal sequential decision for individual sequences, relative to a class of competing o -line reference strategies, is studied for general loss functions with memo...
DAM
1999
13 years 7 months ago
1999
The Stacker-Crane Problem (SCP) isa sequencing problem, arising inscheduling and transportation, that consists of nding the minimum cost cycle on a mixed graph with oriented arcs ...