Sciweavers

88 search results - page 6 / 18
» Constraint Projections for Ensemble Learning
Sort
View
NIPS
2007
14 years 11 months ago
Regularized Boost for Semi-Supervised Learning
Semi-supervised inductive learning concerns how to learn a decision rule from a data set containing both labeled and unlabeled data. Several boosting algorithms have been extended...
Ke Chen 0001, Shihai Wang
NIPS
2004
14 years 11 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
ICASSP
2010
IEEE
14 years 9 months ago
A nullspace analysis of the nuclear norm heuristic for rank minimization
The problem of minimizing the rank of a matrix subject to linear equality constraints arises in applications in machine learning, dimensionality reduction, and control theory, and...
Krishnamurthy Dvijotham, Maryam Fazel
AAAI
2004
14 years 11 months ago
Analogical Path Planning
We present a probabilistic method for path planning that considers trajectories constrained by both the environment and an ensemble of restrictions or preferences on preferred mot...
Saul Simhon, Gregory Dudek
COLT
1999
Springer
15 years 1 months ago
Boosting as Entropy Projection
We consider the AdaBoost procedure for boosting weak learners. In AdaBoost, a key step is choosing a new distribution on the training examples based on the old distribution and th...
Jyrki Kivinen, Manfred K. Warmuth