35 search results - page 1 / 7 » Bandit-Based Algorithms for Budgeted Learning |
ICDM
2007
IEEE
13 years 11 months ago
2007
IEEE
We explore the problem of budgeted machine learning, in which the learning algorithm has free access to the training examples’ labels but has to pay for each attribute that is s...
ECML
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. For large state-space Markovian Decision Problems MonteCarlo planning is one of the few viable approaches to find near-optimal solutions. In this paper we introduce a new...
ICML
2010
IEEE
13 years 5 months ago
2010
IEEE
When equipped with kernel functions, online learning algorithms are susceptible to the "curse of kernelization" that causes unbounded growth in the model size. To addres...
SADM
2010
13 years 2 months ago
2010
: This paper proposes twin prototype support vector machine (TVM), a constant space and sublinear time support vector machine (SVM) algorithm for online learning. TVM achieves its ...
STOC
2007
ACM
14 years 4 months ago
2007
ACM