@inproceedings{1999,
  title = {On the Complexity of Learning the Kernel Matrix},
  journal = {Advances in Neural Information Processing Systems, 15},
  booktitle = {Advances in Neural Information Processing Systems 15},
  abstract = {We investigate data based procedures for selecting the kernel when learning with Support Vector Machines. We provide generalization error bounds by estimating the Rademacher complexities of the corresponding function classes. In particular we obtain a complexity bound for  function classes induced by kernels with given eigenvectors, i.e., we allow to vary the spectrum and keep the eigenvectors fix. This bound is only a logarithmic factor bigger than the complexity of the function class induced by a single kernel. However, optimizing the margin over such classes leads to overfitting. We thus propose a suitable way of constraining the class. We use an efficient algorithm to solve the resulting optimization problem, present preliminary experimental results, and compare them
  to an alignment-based approach.},
  pages = {399-406},
  editors = {Becker, S. , S. Thrun, K. Obermayer},
  publisher = {The MIT Press},
  organization = {Max-Planck-Gesellschaft},
  school = {Biologische Kybernetik},
  address = {Cambridge, MA, USA},
  month = oct,
  year = {2003},
  slug = {1999},
  author = {Bousquet, O. and Herrmann, D.},
  month_numeric = {10}
}