255 search results - page 9 / 51 » Generalized Boosting Algorithms for Convex Optimization |
103
click to vote
ACL
2008
15 years 1 months ago
2008
Current re-ranking algorithms for machine translation rely on log-linear models, which have the potential problem of underfitting the training data. We present BoostedMERT, a nove...
NIPS
2007
15 years 1 months ago
2007
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...
SIAMJO
2011
14 years 6 months ago
2011
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
87
Voted
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
In this paper we present two results on reducing the peak power of orthogonal frequency division multiplexing (OFDM) symbols via constellation extension (CE). The first result is...
89
Voted
KDD
2009
ACM
16 years 4 days ago
2009
ACM
We present novel semi-supervised boosting algorithms that incrementally build linear combinations of weak classifiers through generic functional gradient descent using both labele...