Sciweavers

683 search results - page 124 / 137
» Generalization Bounds for Learning Kernels
Sort
View
TNN
2010
216views Management» more  TNN 2010»
13 years 2 months ago
Simplifying mixture models through function approximation
Finite mixture model is a powerful tool in many statistical learning problems. In this paper, we propose a general, structure-preserving approach to reduce its model complexity, w...
Kai Zhang, James T. Kwok
CIKM
2004
Springer
14 years 22 days ago
Hierarchical document categorization with support vector machines
Automatically categorizing documents into pre-defined topic hierarchies or taxonomies is a crucial step in knowledge and content management. Standard machine learning techniques ...
Lijuan Cai, Thomas Hofmann
COLT
2004
Springer
14 years 22 days ago
Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary
We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...
H. Brendan McMahan, Avrim Blum
CDC
2008
IEEE
104views Control Systems» more  CDC 2008»
14 years 1 months ago
A structured multiarmed bandit problem and the greedy policy
—We consider a multiarmed bandit problem where the expected reward of each arm is a linear function of an unknown scalar with a prior distribution. The objective is to choose a s...
Adam J. Mersereau, Paat Rusmevichientong, John N. ...
NIPS
2004
13 years 8 months ago
Co-Validation: Using Model Disagreement on Unlabeled Data to Validate Classification Algorithms
In the context of binary classification, we define disagreement as a measure of how often two independently-trained models differ in their classification of unlabeled data. We exp...
Omid Madani, David M. Pennock, Gary William Flake