Sciweavers

7 search results - page 1 / 2
» Mistake Bounds for Maximum Entropy Discrimination
Sort
View
NIPS
2004
13 years 6 months ago
Mistake Bounds for Maximum Entropy Discrimination
We establish a mistake bound for an ensemble method for classification based on maximizing the entropy of voting weights subject to margin constraints. The bound is the same as a ...
Philip M. Long, Xinyu Wu
ICML
2001
IEEE
14 years 5 months ago
An Improved Predictive Accuracy Bound for Averaging Classifiers
We present an improved bound on the difference between training and test errors for voting classifiers. This improved averaging bound provides a theoretical justification for popu...
John Langford, Matthias Seeger, Nimrod Megiddo
UAI
2004
13 years 6 months ago
The Minimum Information Principle for Discriminative Learning
Exponential models of distributions are widely used in machine learning for classification and modelling. It is well known that they can be interpreted as maximum entropy models u...
Amir Globerson, Naftali Tishby
JMLR
2011
148views more  JMLR 2011»
12 years 11 months ago
Multitask Sparsity via Maximum Entropy Discrimination
A multitask learning framework is developed for discriminative classification and regression where multiple large-margin linear classifiers are estimated for different predictio...
Tony Jebara
NIPS
2004
13 years 6 months ago
Class-size Independent Generalization Analsysis of Some Discriminative Multi-Category Classification
We consider the problem of deriving class-size independent generalization bounds for some regularized discriminative multi-category classification methods. In particular, we obtai...
Tong Zhang