Open AccessPosted Content
Graph-Aided Online Multi-Kernel Learning.
Pouya M. Ghari,Yanning Shen +1 more
TL;DR: In this paper, a graph-aided multi-kernel learning (MKL) framework is proposed to improve the accuracy of function approximation and reduce the computational complexity of MKL.
read more
Abstract: Multi-kernel learning (MKL) has been widely used in function approximation tasks. The key problem of MKL is to combine kernels in a prescribed dictionary. Inclusion of irrelevant kernels in the dictionary can deteriorate accuracy of MKL, and increase the computational complexity. To improve the accuracy of function approximation and reduce the computational complexity, the present paper studies data-driven selection of kernels from the dictionary that provide satisfactory function approximations. Specifically, based on the similarities among kernels, the novel framework constructs and refines a graph to assist choosing a subset of kernels. In addition, random feature approximation is utilized to enable online implementation for sequentially obtained data. Theoretical analysis shows that our proposed algorithms enjoy tighter sub-linear regret bound compared with state-of-art graph-based online MKL alternatives. Experiments on a number of real datasets also showcase the advantages of our novel graph-aided framework.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
References
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Bernhard Schölkopf,Alexander J. Smola +1 more
- 01 Dec 2001
TL;DR: Learning with Kernels provides an introduction to SVMs and related kernel methods that provide all of the concepts necessary to enable a reader equipped with some basic mathematical knowledge to enter the world of machine learning using theoretically well-founded yet easy-to-use kernel algorithms.
10.2K
•Book
Spline models for observational data
Grace Wahba
- 01 Mar 1990
TL;DR: In this paper, a theory and practice for the estimation of functions from noisy data on functionals is developed, where convergence properties, data based smoothing parameter selection, confidence intervals, and numerical methods are established which are appropriate to a number of problems within this framework.
6.9K
•Proceedings Article
Random Features for Large-Scale Kernel Machines
Ali Rahimi,Benjamin Recht +1 more
- 03 Dec 2007
TL;DR: Two sets of random features are explored, provided convergence bounds on their ability to approximate various radial basis kernels, and it is shown that in large-scale classification and regression tasks linear machine learning algorithms applied to these features outperform state-of-the-art large- scale kernel machines.
A Greedy Heuristic for the Set-Covering Problem
TL;DR: It turns out that the ratio between the two grows at most logarithmically in the largest column sum of A when all the components of cT are the same, which reduces to a theorem established previously by Johnson and Lovasz.
2.8K
•Proceedings Article
Using the Nyström Method to Speed Up Kernel Machines
Christopher Williams,Matthias Seeger +1 more
- 01 Jan 2000
TL;DR: It is shown that an approximation to the eigendecomposition of the Gram matrix can be computed by the Nystrom method (which is used for the numerical solution of eigenproblems) and the computational complexity of a predictor using this approximation is O(m2n).
Related Papers (5)
Khanh Nguyen,Trung Le,Vu Nguyen,Tu Dinh Nguyen,Dinh Phung +4 more
- 01 Jan 2016
Kuo Chin King,Michael Rung Iyu,Haiqin Yang +2 more
- 15 Apr 2011