Sciweavers

44 search results - page 2 / 9
» On numerical optimization theory of infinite kernel learning
Sort
View
COLT
2005
Springer
13 years 11 months ago
Learning Convex Combinations of Continuously Parameterized Basic Kernels
We study the problem of learning a kernel which minimizes a regularization error functional such as that used in regularization networks or support vector machines. We consider thi...
Andreas Argyriou, Charles A. Micchelli, Massimilia...
JAT
2010
51views more  JAT 2010»
13 years 16 days ago
Optimal adaptive computations in the Jaffard algebra and localized frames
We study the efficient numerical solution of infinite matrix equations Au = f for a matrix A in the Jaffard algebra. These matrices appear naturally via frame discretizations in m...
Stephan Dahlke, Massimo Fornasier, Karlheinz Gr&ou...
ICML
2003
IEEE
14 years 6 months ago
The Pre-Image Problem in Kernel Methods
In this paper, we address the problem of finding the pre-image of a feature vector in the feature space induced by a kernel. This is of central importance in some kernel applicatio...
James T. Kwok, Ivor W. Tsang
NIPS
2008
13 years 7 months ago
An Extended Level Method for Efficient Multiple Kernel Learning
We consider the problem of multiple kernel learning (MKL), which can be formulated as a convex-concave problem. In the past, two efficient methods, i.e., Semi-Infinite Linear Prog...
Zenglin Xu, Rong Jin, Irwin King, Michael R. Lyu
ATAL
2008
Springer
13 years 7 months ago
Emerging coordination in infinite team Markov games
In this paper we address the problem of coordination in multi-agent sequential decision problems with infinite statespaces. We adopt a game theoretic formalism to describe the int...
Francisco S. Melo, M. Isabel Ribeiro