Sciweavers

376 search results - page 5 / 76
» On the Advice Complexity of Online Problems
Sort
View
JMLR
2011
137views more  JMLR 2011»
14 years 4 months ago
Online Learning in Case of Unbounded Losses Using Follow the Perturbed Leader Algorithm
In this paper the sequential prediction problem with expert advice is considered for the case where losses of experts suffered at each step cannot be bounded in advance. We presen...
Vladimir V. V'yugin
72
Voted
COLT
1997
Springer
15 years 1 months ago
On-line Learning and the Metrical Task System Problem
We relate two problems that have been explored in two distinct communities. The first is the problem of combining expert advice, studied extensively in the computational learning...
Avrim Blum, Carl Burch
98
Voted
ACMICEC
2006
ACM
217views ECommerce» more  ACMICEC 2006»
15 years 3 months ago
Adaptive decision support system (ADSS) for B2C e-commerce
This paper covers the research problem of supporting users' decision making in E-Commerce systems with complex choices, and design of an Adaptive Decision Support System (ADS...
Faisal Al-Qaed, Alistair G. Sutcliffe
JMLR
2008
137views more  JMLR 2008»
14 years 9 months ago
Online Learning of Complex Prediction Problems Using Simultaneous Projections
We describe and analyze an algorithmic framework for online classification where each online trial consists of multiple prediction tasks that are tied together. We tackle the prob...
Yonatan Amit, Shai Shalev-Shwartz, Yoram Singer
80
Voted
MFCS
2010
Springer
14 years 8 months ago
Information Complexity of Online Problems
Abstract. What is information? Frequently spoken about in many contexts, yet nobody has ever been able to define it with mathematical rigor. The best we are left with so far is th...
Juraj Hromkovic, Rastislav Královic, Richar...