107 search results - page 11 / 22 » General Loss Bounds for Universal Sequence Prediction |
ALGORITHMICA
1998
13 years 7 months ago
1998
We examine a general Bayesian framework for constructing on-line prediction algorithms in the experts setting. These algorithms predict the bits of an unknown Boolean sequence usin...
CADE
2001
Springer
14 years 7 months ago
2001
Springer
Context trees are a popular and effective tool for tasks such as compression, sequential prediction, and language modeling. We present an algebraic perspective of context trees for...
WINE
2009
Springer
14 years 1 months ago
2009
Springer
We study the problem of designing prediction markets for random variables with continuous or countably infinite outcomes on the real line. Our interval betting languages allow tra...
NIPS
2007
13 years 8 months ago
2007
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Ensuring sufficient liquidity is one of the key challenges for designers of prediction markets. Various market making algorithms have been proposed in the literature and deployed ...