Sciweavers

1062 search results - page 50 / 213
» Sublinear Optimization for Machine Learning
Sort
View
ICML
2005
IEEE
14 years 9 months ago
Optimizing abstaining classifiers using ROC analysis
Classifiers that refrain from classification in certain cases can significantly reduce the misclassification cost. However, the parameters for such abstaining classifiers are ofte...
Tadeusz Pietraszek
COLT
2006
Springer
14 years 22 days ago
Optimal Oracle Inequality for Aggregation of Classifiers Under Low Noise Condition
We consider the problem of optimality, in a minimax sense, and adaptivity to the margin and to regularity in binary classification. We prove an oracle inequality, under the margin ...
Guillaume Lecué
COLT
2008
Springer
13 years 10 months ago
High-Probability Regret Bounds for Bandit Online Linear Optimization
We present a modification of the algorithm of Dani et al. [8] for the online linear optimization problem in the bandit setting, which with high probability has regret at most O ( ...
Peter L. Bartlett, Varsha Dani, Thomas P. Hayes, S...
JMLR
2010
187views more  JMLR 2010»
13 years 3 months ago
SFO: A Toolbox for Submodular Function Optimization
In recent years, a fundamental problem structure has emerged as very useful in a variety of machine learning applications: Submodularity is an intuitive diminishing returns proper...
Andreas Krause
ECML
2007
Springer
14 years 3 months ago
Optimizing Feature Sets for Structured Data
Choosing a suitable feature representation for structured data is a non-trivial task due to the vast number of potential candidates. Ideally, one would like to pick a small, but in...
Ulrich Rückert, Stefan Kramer