Sciweavers

76 search results - page 2 / 16
» Negative Results for Active Learning with Convex Losses
Sort
View
ICDM
2008
IEEE
172views Data Mining» more  ICDM 2008»
13 years 11 months ago
Active Learning of Equivalence Relations by Minimizing the Expected Loss Using Constraint Inference
Selecting promising queries is the key to effective active learning. In this paper, we investigate selection techniques for the task of learning an equivalence relation where the ...
Steffen Rendle, Lars Schmidt-Thieme
COLT
2004
Springer
13 years 10 months ago
Sparseness Versus Estimating Conditional Probabilities: Some Asymptotic Results
One of the nice properties of kernel classifiers such as SVMs is that they often produce sparse solutions. However, the decision functions of these classifiers cannot always be u...
Peter L. Bartlett, Ambuj Tewari
ICML
2009
IEEE
14 years 6 months ago
Surrogate regret bounds for proper losses
We present tight surrogate regret bounds for the class of proper (i.e., Fisher consistent) losses. The bounds generalise the margin-based bounds due to Bartlett et al. (2006). The...
Mark D. Reid, Robert C. Williamson
ICML
2010
IEEE
13 years 6 months ago
Learning Efficiently with Approximate Inference via Dual Losses
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
Ofer Meshi, David Sontag, Tommi Jaakkola, Amir Glo...
JMLR
2010
125views more  JMLR 2010»
13 years 2 days ago
Maximum Likelihood in Cost-Sensitive Learning: Model Specification, Approximations, and Upper Bounds
The presence of asymmetry in the misclassification costs or class prevalences is a common occurrence in the pattern classification domain. While much interest has been devoted to ...
Jacek P. Dmochowski, Paul Sajda, Lucas C. Parra