Sciweavers

255 search results - page 9 / 51
» Generalized Boosting Algorithms for Convex Optimization
Sort
View
ACL
2008
13 years 10 months ago
Beyond Log-Linear Models: Boosted Minimum Error Rate Training for N-best Re-ranking
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...
Kevin Duh, Katrin Kirchhoff
NIPS
2007
13 years 10 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
SIAMJO
2011
13 years 3 months ago
A Unifying Polyhedral Approximation Framework for Convex Optimization
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
Dimitri P. Bertsekas, Huizhen Yu
ICASSP
2011
IEEE
13 years 13 days ago
Generalized interior-point method for constrained peak power minimization of OFDM signals
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...
Zhenhua Yu, Robert J. Baxley, G. Tong Zhou
KDD
2009
ACM
150views Data Mining» more  KDD 2009»
14 years 9 months ago
Information theoretic regularization for semi-supervised boosting
We present novel semi-supervised boosting algorithms that incrementally build linear combinations of weak classifiers through generic functional gradient descent using both labele...
Lei Zheng, Shaojun Wang, Yan Liu, Chi-Hoon Lee