Sciweavers

255 search results - page 5 / 51
» Generalized Boosting Algorithms for Convex Optimization
Sort
View
ICML
2001
IEEE
14 years 8 months ago
Some Theoretical Aspects of Boosting in the Presence of Noisy Data
This is a survey of some theoretical results on boosting obtained from an analogous treatment of some regression and classi cation boosting algorithms. Some related papers include...
Wenxin Jiang
ML
2007
ACM
127views Machine Learning» more  ML 2007»
13 years 7 months ago
Density estimation with stagewise optimization of the empirical risk
We consider multivariate density estimation with identically distributed observations. We study a density estimator which is a convex combination of functions in a dictionary and ...
Jussi Klemelä
SIAMJO
2008
212views more  SIAMJO 2008»
13 years 7 months ago
Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints
A new active set algorithm for minimizing quadratic functions with separable convex constraints is proposed by combining the conjugate gradient method with the projected gradient. ...
Radek Kucera
PKDD
2009
Springer
184views Data Mining» more  PKDD 2009»
14 years 2 days ago
Boosting Active Learning to Optimality: A Tractable Monte-Carlo, Billiard-Based Algorithm
Abstract. This paper focuses on Active Learning with a limited number of queries; in application domains such as Numerical Engineering, the size of the training set might be limite...
Philippe Rolet, Michèle Sebag, Olivier Teyt...
COLT
2006
Springer
13 years 11 months ago
Logarithmic Regret Algorithms for Online Convex Optimization
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal