495 search results - page 70 / 99 » Approximation algorithms for budgeted learning problems |
STOC
2005
ACM
15 years 10 months ago
2005
ACM
We study an extension of the "standard" learning models to settings where observing the value of an attribute has an associated cost (which might be different for differ...
IMC
2007
ACM
14 years 11 months ago
2007
ACM
The ability to discover network organization, whether in the form of explicit topology reconstruction or as embeddings that approximate topological distance, is a valuable tool. T...
PRL
2008
14 years 9 months ago
2008
In this work we propose an approach to binary classification based on an extension of Bayes Point Machines. Particularly, we take into account the whole set of hypotheses that are...
66
Voted
NIPS
2008
14 years 11 months ago
2008
We study the profit-maximization problem of a monopolistic market-maker who sets two-sided prices in an asset market. The sequential decision problem is hard to solve because the ...
78
Voted
COLT
2008
Springer
14 years 11 months ago
2008
Springer
We study the problem of clustering discrete probability distributions with respect to the Kullback-Leibler (KL) divergence. This problem arises naturally in many applications. Our...