548 search results - page 83 / 110 » Optimization of Convex Risk Functions |
120
Voted
ICML
2004
IEEE
16 years 4 months ago
2004
IEEE
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...
121
Voted
PKDD
2009
Springer
15 years 10 months ago
2009
Springer
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...
106
Voted
UAI
2004
15 years 5 months ago
2004
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...
131
Voted
GLOBECOM
2008
IEEE
15 years 3 months ago
2008
IEEE
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 ...
134
Voted
ECCC
2006
15 years 3 months ago
2006
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...