495 search results - page 1 / 99 » Approximation algorithms for budgeted learning problems |
STOC
2007
ACM
15 years 6 months ago
2007
ACM
COLT
2004
Springer
14 years 9 months ago
2004
Springer
straction of the following scenarios: choosing from among a set of alternative treatments after a fixed number of clinical trials, determining the best parameter settings for a pro...
APPROX
2004
Springer
14 years 11 months ago
2004
Springer
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
IPL
2007
14 years 5 months ago
2007
We study a model that incorporates a budget constraint in a decision making problem. Our goal is to maximize the expected wealth, where in each time period we can either stop the ...
ICDM
2007
IEEE
15 years 23 hour 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...