20 search results - page 3 / 4 » A 2-Competitive Algorithm For Online Convex Optimization Wit... |
WDAG
2007
Springer
13 years 12 months ago
2007
Springer
We consider the problem of minimizing the number of ADMs in optical networks. All previous theoretical studies of this problem dealt with the off-line case, where all the lightpat...
ALT
2008
Springer
14 years 2 months ago
2008
Springer
Abstract. We consider an upper confidence bound algorithm for Markov decision processes (MDPs) with deterministic transitions. For this algorithm we derive upper bounds on the onl...
ICML
2009
IEEE
14 years 6 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...
WEBI
2010
Springer
13 years 3 months ago
2010
Springer
Abstract--Expertise matching, aiming to find the alignment between experts and queries, is a common problem in many real applications such as conference paper-reviewer assignment, ...
ICDM
2009
IEEE
14 years 13 days ago
2009
IEEE
—A fast online algorithm OnlineSVMR for training Ramp-Loss Support Vector Machines (SVMR s) is proposed. It finds the optimal SVMR for t+1 training examples using SVMR built on t...