A Family of Simple Non-Parametric Kernel Learning Algorithms

Abstract

Previous studies of Non-Parametric Kernel Learning (NPKL) usually formulate the learning task as a Semi-Definite Programming (SDP) problem that is often solved by some general purpose SDP solvers. However, for N data examples, the time complexity of NPKL using a standard interiorpoint SDP solver could be as high as O(N6.5), which prohibits NPKL methods… (More)

Topics

16 Figures and Tables

Statistics

010202012201320142015201620172018
Citations per Year

52 Citations

Semantic Scholar estimates that this publication has 52 citations based on the available data.

See our FAQ for additional information.