382 search results - page 63 / 77 » Gradient estimation in global optimization algorithms |
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
We compute a common feature selection or kernel selection configuration for multiple support vector machines (SVMs) trained on different yet inter-related datasets. The method is ...
NIPS
2007
13 years 9 months ago
2007
We present a globally convergent method for regularized risk minimization problems. Our method applies to Support Vector estimation, regression, Gaussian Processes, and any other ...
TIP
2010
13 years 6 months ago
2010
In this paper we model the components of the compressive sensing (CS) problem, i.e., the signal acquisition process, the unknown signal coefficients and the model parameters for ...
NIPS
2007
13 years 9 months ago
2007
Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization pro...
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
Many applications in multiagent learning are essentially convex optimization problems in which agents have only limited communication and partial information about the function be...