Sciweavers

683 search results - page 92 / 137
» Generalization Bounds for Learning Kernels
Sort
View
CORR
2008
Springer
108views Education» more  CORR 2008»
13 years 10 months ago
Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning
Resolution refinements called w-resolution trees with lemmas (WRTL) and with input lemmas (WRTI) are introduced. Dag-like resolution is equivalent to both WRTL and WRTI when there...
Samuel R. Buss, Jan Hoffmann 0002, Jan Johannsen
ICML
2007
IEEE
14 years 10 months ago
Direct convex relaxations of sparse SVM
Although support vector machines (SVMs) for binary classification give rise to a decision rule that only relies on a subset of the training data points (support vectors), it will ...
Antoni B. Chan, Nuno Vasconcelos, Gert R. G. Lanck...
ICCV
2009
IEEE
1019views Computer Vision» more  ICCV 2009»
15 years 2 months ago
Similarity Functions for Categorization: from Monolithic to Category Specific
Similarity metrics that are learned from labeled training data can be advantageous in terms of performance and/or efficiency. These learned metrics can then be used in conjuncti...
Boris Babenko, Steve Branson, Serge Belongie
ICCV
2003
IEEE
14 years 11 months ago
Controlling Model Complexity in Flow Estimation
This paper describes a novel application of Statistical Learning Theory (SLT) to control model complexity in flow estimation. SLT provides analytical generalization bounds suitabl...
Zoran Duric, Fayin Li, Harry Wechsler, Vladimir Ch...
ICML
2010
IEEE
13 years 11 months ago
OTL: A Framework of Online Transfer Learning
In this paper, we investigate a new machine learning framework called Online Transfer Learning (OTL) that aims to transfer knowledge from some source domain to an online learning ...
Peilin Zhao, Steven C. H. Hoi