701 search results - page 60 / 141 » Self Bounding Learning Algorithms |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
A number of updates for density matrices have been developed recently that are motivated by relative entropy minimization problems. The updates involve a softmin calculation based...
ALT
2008
Springer
14 years 4 months ago
2008
Springer
In this paper, we initiate a theoretical study of the problem of clustering data under interactive feedback. We introduce a query-based model in which users can provide feedback to...
COLT
2006
Springer
13 years 11 months ago
2006
Springer
We address the problem of online de-noising a stream of input points. We assume that the clean data is embedded in a linear subspace. We present two online algorithms for tracking ...
JMLR
2002
13 years 7 months ago
2002
We extend the classical algorithms of Valiant and Haussler for learning compact conjunctions and disjunctions of Boolean attributes to allow features that are constructed from the...