Sciweavers

569 search results - page 60 / 114
» Online Bounds for Bayesian Algorithms
Sort
View
IPL
2008
79views more  IPL 2008»
14 years 10 months ago
Ski rental with two general options
We define and solve a simple extension of the ski-rental problem [4]. In the classical version, the algorithm needs to decide when to switch from renting to buying. In our version...
Zvi Lotker, Boaz Patt-Shamir, Dror Rawitz
COLT
2010
Springer
14 years 8 months ago
Robust Selective Sampling from Single and Multiple Teachers
We present a new online learning algorithm in the selective sampling framework, where labels must be actively queried before they are revealed. We prove bounds on the regret of ou...
Ofer Dekel, Claudio Gentile, Karthik Sridharan
SODA
2001
ACM
115views Algorithms» more  SODA 2001»
14 years 11 months ago
Loss-bounded analysis for differentiated services
We consider a network providing Differentiated Services (DiffServ) which allow network service providers to offer different levels of Quality of Service (QoS) to different traffic...
Alexander Kesselman, Yishay Mansour
COLT
2008
Springer
14 years 11 months ago
Adaptive Aggregation for Reinforcement Learning with Efficient Exploration: Deterministic Domains
We propose a model-based learning algorithm, the Adaptive Aggregation Algorithm (AAA), that aims to solve the online, continuous state space reinforcement learning problem in a de...
Andrey Bernstein, Nahum Shimkin
CORR
2010
Springer
112views Education» more  CORR 2010»
14 years 7 months ago
Optimal Distributed Online Prediction using Mini-Batches
Online prediction methods are typically presented as serial algorithms running on a single processor. However, in the age of web-scale prediction problems, it is increasingly comm...
Ofer Dekel, Ran Gilad-Bachrach, Ohad Shamir, Lin X...