97 search results - page 15 / 20 » Logarithmic Regret Algorithms for Online Convex Optimization |
SIGECOM
2010
ACM
14 years 14 days ago
2010
ACM
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— We consider the problem of scheduling a sequence of packets over a linear network, where every packet has a source and a target, as well as a release time and a deadline by whi...
NIPS
2004
13 years 9 months ago
2004
In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. Wh...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
In this paper, we present an information-theoretic approach to learning a Mahalanobis distance function. We formulate the problem as that of minimizing the differential relative e...
ICDM
2009
IEEE
14 years 2 months 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...