A Unifying Framework for Typical Multitask Multiple Kernel Learning Problems
19
TL;DR: In this paper, a general multitask multiple kernel learning (MT-MKL) framework is presented, which subsumes well-known multitask learning methods as well as several important MKL approaches on single-task problems.
read more
Abstract: Over the past few years, multiple kernel learning (MKL) has received significant attention among data-driven feature selection techniques in the context of kernel-based learning. MKL formulations have been devised and solved for a broad spectrum of machine learning problems, including multitask learning (MTL). Solving different MKL formulations usually involves designing algorithms that are tailored to the problem at hand, which is, typically, a nontrivial accomplishment. In this paper we present a general multitask multiple kernel learning (MT-MKL) framework that subsumes well-known MT-MKL formulations, as well as several important MKL approaches on single-task problems. We then derive a simple algorithm that can solve the unifying framework. To demonstrate the flexibility of the proposed framework, we formulate a new learning problem, namely partially-shared common space MT-MKL, and demonstrate its merits through experimentation.
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
Citations
On the Impact of Regularization Variation on Localized Multiple Kernel Learning
TL;DR: Stability bounds based on the norm of the variation of localized kernel weights for three LMKL methods cast in the support vector machine classification framework are given and performance differences produced by these regularization methods are revealed.
14
•Posted Content
Multi-Task Classification Hypothesis Space with Improved Generalization Bounds
TL;DR: For these new hypothesis spaces (HSs) of vector-valued functions, empirical Rademacher complexity-based generalization bounds are derived, and are shown to be tighter than the bound of a particular HS, which has appeared recently in the literature, leading to improved performance.
Multitask Classification Hypothesis Space With Improved Generalization Bounds
TL;DR: In this article, a pair of hypothesis spaces (HSs) of vector-valued functions intended to be used in the context of multitask classification are presented, and empirical Rademacher complexity-based generalization bounds are derived, and are shown to be tighter than the bound of a particular HS.
10
A Referenced Framework on New Challenges and Cutting-Edge Research Trends for Big-Data Processing Using Machine Learning Approaches
05 Feb 2023
TL;DR: A literature evaluation of the most recent advancement in ML (machine learning) approaches for large amounts of data processing is presented in this article , where the authors focused on evaluating and analyzing the challenging situation and potential solutions associated with handling huge data sets with machine learning.
9
•Posted Content
Learning to Rank for Blind Image Quality Assessment
TL;DR: This paper explores and exploits preference image pairs such as the quality of image Ia is better than that of image Ib for training a robust BIQA model and investigates the utilization of a multiple kernel learning algorithm based on group lasso to provide a solution.
6
References
LIBSVM: A library for support vector machines
Chih-Chung Chang,Chih-Jen Lin +1 more
TL;DR: Issues such as solving SVM optimization problems theoretical convergence multiclass classification probability estimates and parameter selection are discussed in detail.
Support-Vector Networks
Corinna Cortes,Vladimir Vapnik +1 more
TL;DR: High generalization ability of support-vector networks utilizing polynomial input transformations is demonstrated and the performance of the support- vector network is compared to various classical learning algorithms that all took part in a benchmark study of Optical Character Recognition.
Statistical learning theory
Vladimir Vapnik
- 01 Jan 1998
TL;DR: Presenting a method for determining the necessary and sufficient conditions for consistency of learning process, the author covers function estimates from small data pools, applying these estimations to real-life problems, and much more.
30.4K
Estimating the Support of a High-Dimensional Distribution
TL;DR: In this paper, the authors propose a method to estimate a function f that is positive on S and negative on the complement of S. The functional form of f is given by a kernel expansion in terms of a potentially small subset of the training data; it is regularized by controlling the length of the weight vector in an associated feature space.