Sciweavers

548 search results - page 83 / 110
» Optimization of Convex Risk Functions
Sort
View
ICML
2004
IEEE
14 years 10 months ago
Surrogate maximization/minimization algorithms for AdaBoost and the logistic regression model
Surrogate maximization (or minimization) (SM) algorithms are a family of algorithms that can be regarded as a generalization of expectation-maximization (EM) algorithms. There are...
Zhihua Zhang, James T. Kwok, Dit-Yan Yeung
PKDD
2009
Springer
138views Data Mining» more  PKDD 2009»
14 years 4 months ago
Margin and Radius Based Multiple Kernel Learning
A serious drawback of kernel methods, and Support Vector Machines (SVM) in particular, is the difficulty in choosing a suitable kernel function for a given dataset. One of the appr...
Huyen Do, Alexandros Kalousis, Adam Woznica, Melan...
UAI
2004
13 years 11 months ago
Variational Chernoff Bounds for Graphical Models
Recent research has made significant progress on the problem of bounding log partition functions for exponential family graphical models. Such bounds have associated dual paramete...
Pradeep D. Ravikumar, John D. Lafferty
GLOBECOM
2008
IEEE
13 years 10 months ago
Power Allocation for Cognitive Radios Based on Primary User Activity in an OFDM System
Efficient and reliable power allocation algorithm in Cognitive radio (CR) networks is a challenging problem. Traditional water-filling algorithm is inefficient for CR networks due ...
Ziaul Hasan, Ekram Hossain, Charles L. Despins, Vi...
ECCC
2006
218views more  ECCC 2006»
13 years 10 months ago
Efficient Algorithms for Online Game Playing and Universal Portfolio Management
We introduce a new algorithm and a new analysis technique that is applicable to a variety of online optimization scenarios, including regret minimization for Lipschitz regret func...
Amit Agarwal, Elad Hazan