Sciweavers

16 search results - page 3 / 4
» Improved Second-Order Bounds for Prediction with Expert Advi...
Sort
View
ICML
2010
IEEE
13 years 3 months ago
Online Prediction with Privacy
In this paper, we consider online prediction from expert advice in a situation where each expert observes its own loss at each time while the loss cannot be disclosed to others fo...
Jun Sakuma, Hiromi Arai
ALGORITHMICA
1998
103views more  ALGORITHMICA 1998»
13 years 5 months ago
On Bayes Methods for On-Line Boolean Prediction
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...
Nicolò Cesa-Bianchi, David P. Helmbold, San...
RTCSA
2009
IEEE
14 years 5 days ago
Branch Target Buffers: WCET Analysis Framework and Timing Predictability
—One step in the verification of hard real-time systems is to determine upper bounds on the worst-case execution times (WCET) of tasks. To obtain tight bounds, a WCET analysis h...
Daniel Grund, Jan Reineke, Gernot Gebhard
SIGECOM
2010
ACM
149views ECommerce» more  SIGECOM 2010»
13 years 10 months ago
A new understanding of prediction markets via no-regret learning
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...
Yiling Chen, Jennifer Wortman Vaughan
COLT
2006
Springer
13 years 9 months ago
Logarithmic Regret Algorithms for Online Convex Optimization
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal