, X m be m lattices with the associated references and let x(K, X i ) be the solution of the expected similarity maximization for lattice X i when using kernel K. Then, the kernel learning optimization problem can be formulated as follows: where K is a convex family of rational kernels and Tr[K] denotes the trace of the kernel matrix.
we could choose K as a family of linear combinations of base rational kernels.