263 search results - page 7 / 53 » Regret Bounds for Prediction Problems |
COLT
2010
Springer
13 years 6 months ago
2010
Springer
We analyze the regret, measured in terms of log loss, of the maximum likelihood (ML) sequential prediction strategy. This "follow the leader" strategy also defines one o...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
The analysis of online least squares estimation is at the heart of many stochastic sequential decision-making problems. We employ tools from the self-normalized processes to provi...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
The problem of distributed learning and channel access is considered in a cognitive network with multiple secondary users. The availability statistics of the channels are initially...
ICML
2009
IEEE
14 years 9 months ago
2009
IEEE
We study online learning in an oblivious changing environment. The standard measure of regret bounds the difference between the cost of the online learner and the best decision in...
SIGECOM
2010
ACM
14 years 1 months ago
2010
ACM
We explore the striking mathematical connections that exist between market scoring rules, cost function based prediction markets, and no-regret learning. We first show that any c...