A Geometric Algorithm for Scalable Multiple Kernel Learning

25 Jun 2012John MoellerParasaran RamanAvishek SahaSuresh Venkatasubramanian

We present a geometric formulation of the Multiple Kernel Learning (MKL) problem. To do so, we reinterpret the problem of learning kernel weights as searching for a kernel that maximizes the minimum (kernel) distance between two convex polytopes... (read more)

PDF Abstract


No code implementations yet. Submit your code now


Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.